AtCoder Typical Contest 001

Submission #7137024

Source codeソースコード

#include <string>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <bitset>
#include <stack>
using namespace std;

struct pos
{
    int x;
    int y;
    pos() {}
    pos(int _x, int _y)
    {
        x = _x; y = _y;
    }
};

int main()
{
    int h, w;
    cin >> h >> w;
    char* cell = new char[h * w];
    bool* visited = new bool[h * w];
    pos s, g;
    for (int x = 0; x < h; x++)
    {
        for (int y = 0; y < w; y++)
        {
            visited[h * x + y] = false;
            cin >> cell[h * x + y];
            if (cell[h * x + y] == 's')
            {
                s.x = x; s.y = y;
            }
            else if (cell[h * x + y] == 'g')
            {
                g.x = x; g.y = y;
            }
        }
    }

    stack<pos> st;
    st.push(s);
    while (!st.empty())
    {
        pos c = st.top();
        st.pop();

        if (visited[h * c.x + c.y] || cell[h * c.x + c.y] == '#') continue;
        else if (cell[h * c.x + c.y] == 'g')
        {
            cout << "Yes" << endl;
            return 0;
        }
        visited[h * c.x + c.y] = true;

        if (c.x > 0) st.push(pos(c.x - 1, c.y));
        if (c.x < h - 1) st.push(pos(c.x + 1, c.y));
        if (c.y > 0) st.push(pos(c.x, c.y - 1));
        if (c.y < w - 1) st.push(pos(c.x, c.y + 1));
    }

    cout << "No" << endl;
    return 0;    
}

Submission

Task問題 A - 深さ優先探索
User nameユーザ名 junkun87
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 RE
Score得点 0
Source lengthソースコード長 1452 Byte
File nameファイル名
Exec time実行時間 ms
Memory usageメモリ使用量 -

Test case

Set

Set name Score得点 / Max score Cases
Sample - 00_sample_01.txt,00_sample_02.txt,00_sample_03.txt,00_sample_04.txt,00_sample_05.txt
All 0 / 100 00_min_01.txt,00_min_02.txt,00_min_03.txt,00_min_04.txt,00_min_05.txt,00_min_06.txt,00_min_07.txt,00_min_08.txt,00_sample_01.txt,00_sample_02.txt,00_sample_03.txt,00_sample_04.txt,00_sample_05.txt,01_rnd_00.txt,01_rnd_01.txt,01_rnd_02.txt,01_rnd_03.txt,01_rnd_04.txt,01_rnd_05.txt,01_rnd_06.txt,01_rnd_07.txt,01_rnd_08.txt,01_rnd_09.txt,01_rnd_10.txt,01_rnd_11.txt,01_rnd_12.txt,01_rnd_13.txt,01_rnd_14.txt,01_rnd_15.txt,01_rnd_16.txt,01_rnd_17.txt,01_rnd_18.txt,01_rnd_19.txt,02_rndhard_00.txt,02_rndhard_01.txt,02_rndhard_02.txt,02_rndhard_03.txt,02_rndhard_04.txt,02_rndhard_05.txt,02_rndhard_06.txt,02_rndhard_07.txt,02_rndhard_08.txt,02_rndhard_09.txt,02_rndhard_10.txt,02_rndhard_11.txt,02_rndhard_12.txt,02_rndhard_13.txt,02_rndhard_14.txt,02_rndhard_15.txt,02_rndhard_16.txt,02_rndhard_17.txt,02_rndhard_18.txt,02_rndhard_19.txt,02_rndhard_20.txt,02_rndhard_21.txt,02_rndhard_22.txt,02_rndhard_23.txt,02_rndhard_24.txt,02_rndhard_25.txt,02_rndhard_26.txt,02_rndhard_27.txt,02_rndhard_28.txt,02_rndhard_29.txt,02_rndhard_30.txt,02_rndhard_31.txt,02_rndhard_32.txt,02_rndhard_33.txt,02_rndhard_34.txt,02_rndhard_35.txt,02_rndhard_36.txt,02_rndhard_37.txt,02_rndhard_38.txt,02_rndhard_39.txt,03_rndhardsmall_00.txt,03_rndhardsmall_01.txt,03_rndhardsmall_02.txt,03_rndhardsmall_03.txt,03_rndhardsmall_04.txt,03_rndhardsmall_05.txt,03_rndhardsmall_06.txt,03_rndhardsmall_07.txt,03_rndhardsmall_08.txt,03_rndhardsmall_09.txt

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
00_min_01.txt AC 1 ms 256 KB
00_min_02.txt AC 1 ms 256 KB
00_min_03.txt AC 1 ms 256 KB
00_min_04.txt AC 1 ms 256 KB
00_min_05.txt AC 1 ms 256 KB
00_min_06.txt AC 1 ms 256 KB
00_min_07.txt AC 1 ms 256 KB
00_min_08.txt AC 1 ms 256 KB
00_sample_01.txt AC 1 ms 256 KB
00_sample_02.txt AC 1 ms 256 KB
00_sample_03.txt AC 1 ms 256 KB
00_sample_04.txt AC 1 ms 256 KB
00_sample_05.txt AC 1 ms 256 KB
01_rnd_00.txt AC 15 ms 768 KB
01_rnd_01.txt AC 18 ms 1536 KB
01_rnd_02.txt AC 19 ms 1280 KB
01_rnd_03.txt AC 27 ms 2540 KB
01_rnd_04.txt AC 24 ms 2944 KB
01_rnd_05.txt AC 15 ms 768 KB
01_rnd_06.txt AC 18 ms 1024 KB
01_rnd_07.txt AC 16 ms 896 KB
01_rnd_08.txt AC 15 ms 768 KB
01_rnd_09.txt AC 17 ms 768 KB
01_rnd_10.txt AC 21 ms 896 KB
01_rnd_11.txt AC 15 ms 768 KB
01_rnd_12.txt AC 26 ms 2560 KB
01_rnd_13.txt AC 22 ms 2176 KB
01_rnd_14.txt AC 15 ms 768 KB
01_rnd_15.txt AC 21 ms 1152 KB
01_rnd_16.txt AC 15 ms 768 KB
01_rnd_17.txt AC 24 ms 896 KB
01_rnd_18.txt AC 15 ms 768 KB
01_rnd_19.txt AC 22 ms 3200 KB
02_rndhard_00.txt AC 15 ms 768 KB
02_rndhard_01.txt AC 15 ms 768 KB
02_rndhard_02.txt AC 16 ms 768 KB
02_rndhard_03.txt AC 16 ms 768 KB
02_rndhard_04.txt AC 15 ms 768 KB
02_rndhard_05.txt AC 15 ms 768 KB
02_rndhard_06.txt AC 15 ms 768 KB
02_rndhard_07.txt AC 15 ms 768 KB
02_rndhard_08.txt AC 15 ms 768 KB
02_rndhard_09.txt AC 15 ms 768 KB
02_rndhard_10.txt AC 15 ms 768 KB
02_rndhard_11.txt AC 15 ms 768 KB
02_rndhard_12.txt AC 15 ms 768 KB
02_rndhard_13.txt AC 15 ms 768 KB
02_rndhard_14.txt AC 15 ms 768 KB
02_rndhard_15.txt AC 15 ms 768 KB
02_rndhard_16.txt AC 15 ms 768 KB
02_rndhard_17.txt AC 15 ms 768 KB
02_rndhard_18.txt AC 15 ms 768 KB
02_rndhard_19.txt AC 15 ms 768 KB
02_rndhard_20.txt AC 16 ms 768 KB
02_rndhard_21.txt AC 15 ms 768 KB
02_rndhard_22.txt AC 15 ms 768 KB
02_rndhard_23.txt AC 15 ms 768 KB
02_rndhard_24.txt AC 15 ms 768 KB
02_rndhard_25.txt AC 15 ms 768 KB
02_rndhard_26.txt AC 15 ms 768 KB
02_rndhard_27.txt AC 15 ms 768 KB
02_rndhard_28.txt AC 15 ms 768 KB
02_rndhard_29.txt AC 15 ms 768 KB
02_rndhard_30.txt AC 15 ms 768 KB
02_rndhard_31.txt AC 15 ms 768 KB
02_rndhard_32.txt AC 15 ms 768 KB
02_rndhard_33.txt AC 15 ms 768 KB
02_rndhard_34.txt AC 15 ms 768 KB
02_rndhard_35.txt AC 15 ms 768 KB
02_rndhard_36.txt AC 15 ms 768 KB
02_rndhard_37.txt AC 15 ms 768 KB
02_rndhard_38.txt AC 15 ms 768 KB
02_rndhard_39.txt AC 15 ms 768 KB
03_rndhardsmall_00.txt AC 1 ms 256 KB
03_rndhardsmall_01.txt AC 1 ms 256 KB
03_rndhardsmall_02.txt RE
03_rndhardsmall_03.txt RE
03_rndhardsmall_04.txt RE
03_rndhardsmall_05.txt RE
03_rndhardsmall_06.txt AC 1 ms 256 KB
03_rndhardsmall_07.txt AC 1 ms 256 KB
03_rndhardsmall_08.txt AC 1 ms 256 KB
03_rndhardsmall_09.txt AC 1 ms 256 KB