Submission #7137024


Source Code Expand

Copy
#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 Info

Submission Time
Task A - 深さ優先探索
User junkun87
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1452 Byte
Status
Exec Time 98 ms
Memory 3200 KB

Judge Result

Set Name Score / Max Score Test Cases
Sample 0 / 0 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
Case Name Status Exec Time Memory
00_min_01.txt 1 ms 256 KB
00_min_02.txt 1 ms 256 KB
00_min_03.txt 1 ms 256 KB
00_min_04.txt 1 ms 256 KB
00_min_05.txt 1 ms 256 KB
00_min_06.txt 1 ms 256 KB
00_min_07.txt 1 ms 256 KB
00_min_08.txt 1 ms 256 KB
00_sample_01.txt 1 ms 256 KB
00_sample_02.txt 1 ms 256 KB
00_sample_03.txt 1 ms 256 KB
00_sample_04.txt 1 ms 256 KB
00_sample_05.txt 1 ms 256 KB
01_rnd_00.txt 15 ms 768 KB
01_rnd_01.txt 18 ms 1536 KB
01_rnd_02.txt 19 ms 1280 KB
01_rnd_03.txt 27 ms 2540 KB
01_rnd_04.txt 24 ms 2944 KB
01_rnd_05.txt 15 ms 768 KB
01_rnd_06.txt 18 ms 1024 KB
01_rnd_07.txt 16 ms 896 KB
01_rnd_08.txt 15 ms 768 KB
01_rnd_09.txt 17 ms 768 KB
01_rnd_10.txt 21 ms 896 KB
01_rnd_11.txt 15 ms 768 KB
01_rnd_12.txt 26 ms 2560 KB
01_rnd_13.txt 22 ms 2176 KB
01_rnd_14.txt 15 ms 768 KB
01_rnd_15.txt 21 ms 1152 KB
01_rnd_16.txt 15 ms 768 KB
01_rnd_17.txt 24 ms 896 KB
01_rnd_18.txt 15 ms 768 KB
01_rnd_19.txt 22 ms 3200 KB
02_rndhard_00.txt 15 ms 768 KB
02_rndhard_01.txt 15 ms 768 KB
02_rndhard_02.txt 16 ms 768 KB
02_rndhard_03.txt 16 ms 768 KB
02_rndhard_04.txt 15 ms 768 KB
02_rndhard_05.txt 15 ms 768 KB
02_rndhard_06.txt 15 ms 768 KB
02_rndhard_07.txt 15 ms 768 KB
02_rndhard_08.txt 15 ms 768 KB
02_rndhard_09.txt 15 ms 768 KB
02_rndhard_10.txt 15 ms 768 KB
02_rndhard_11.txt 15 ms 768 KB
02_rndhard_12.txt 15 ms 768 KB
02_rndhard_13.txt 15 ms 768 KB
02_rndhard_14.txt 15 ms 768 KB
02_rndhard_15.txt 15 ms 768 KB
02_rndhard_16.txt 15 ms 768 KB
02_rndhard_17.txt 15 ms 768 KB
02_rndhard_18.txt 15 ms 768 KB
02_rndhard_19.txt 15 ms 768 KB
02_rndhard_20.txt 16 ms 768 KB
02_rndhard_21.txt 15 ms 768 KB
02_rndhard_22.txt 15 ms 768 KB
02_rndhard_23.txt 15 ms 768 KB
02_rndhard_24.txt 15 ms 768 KB
02_rndhard_25.txt 15 ms 768 KB
02_rndhard_26.txt 15 ms 768 KB
02_rndhard_27.txt 15 ms 768 KB
02_rndhard_28.txt 15 ms 768 KB
02_rndhard_29.txt 15 ms 768 KB
02_rndhard_30.txt 15 ms 768 KB
02_rndhard_31.txt 15 ms 768 KB
02_rndhard_32.txt 15 ms 768 KB
02_rndhard_33.txt 15 ms 768 KB
02_rndhard_34.txt 15 ms 768 KB
02_rndhard_35.txt 15 ms 768 KB
02_rndhard_36.txt 15 ms 768 KB
02_rndhard_37.txt 15 ms 768 KB
02_rndhard_38.txt 15 ms 768 KB
02_rndhard_39.txt 15 ms 768 KB
03_rndhardsmall_00.txt 1 ms 256 KB
03_rndhardsmall_01.txt 1 ms 256 KB
03_rndhardsmall_02.txt 98 ms 384 KB
03_rndhardsmall_03.txt 97 ms 256 KB
03_rndhardsmall_04.txt 98 ms 256 KB
03_rndhardsmall_05.txt 97 ms 256 KB
03_rndhardsmall_06.txt 1 ms 256 KB
03_rndhardsmall_07.txt 1 ms 256 KB
03_rndhardsmall_08.txt 1 ms 256 KB
03_rndhardsmall_09.txt 1 ms 256 KB