Submission #420218


Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>

#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)

using namespace std;
typedef long long ll;

int w,h;
int sx,sy,gx,gy;
int dx[4] = {1,0,-1,0};
int dy[4] = {0,1,0,-1};
vector<string> v;
bool flag;
bool used[505][505];

bool can(int y,int x) {
    if(0 <= y && y < h && 0 <= x && x < w) return true;
    return false;
}

void dfs(int y,int x) {
    if(y == gy && x == gx) {
        flag = true;
        return;
    }
    
    if(used[y][x]) return;
    used[y][x] = true;

    rep(i,4) {
        int ny = y + dy[i];
        int nx = x + dx[i];

        if(can(ny,nx) && !used[ny][nx] && v[ny][nx] != '#') {
            dfs(ny,nx);
        }
    }
}

int main() {
    cin >> h >> w;
    
    v.resize(h);
    rep(i,h) {
        cin >> v[i];

        rep(j,v[i].size()) {
            if(v[i][j] == 's') {
                sy = i;
                sx = j;
            }
            if(v[i][j] == 'g') {
                gy = i;
                gx = j;
            }
        }
    }

    flag = false;
    memset(used,0,sizeof(used));

    dfs(sy,sx);

    if(flag) cout << "Yes" << endl;
    else cout << "No" << endl;

    return 0;
}

Submission Info

Submission Time
Task A - 深さ優先探索
User Ry0u_
Language C++ (GCC 4.9.2)
Score 100
Code Size 1328 Byte
Status AC
Exec Time 87 ms
Memory 20132 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 5
AC × 83
Set Name Test Cases
Sample 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt
All 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 AC 40 ms 1108 KB
00_min_02.txt AC 28 ms 1060 KB
00_min_03.txt AC 28 ms 1056 KB
00_min_04.txt AC 28 ms 1060 KB
00_min_05.txt AC 26 ms 1056 KB
00_min_06.txt AC 27 ms 1056 KB
00_min_07.txt AC 27 ms 1060 KB
00_min_08.txt AC 27 ms 1072 KB
00_sample_01.txt AC 28 ms 1064 KB
00_sample_02.txt AC 27 ms 1056 KB
00_sample_03.txt AC 29 ms 996 KB
00_sample_04.txt AC 29 ms 1060 KB
00_sample_05.txt AC 26 ms 1048 KB
01_rnd_00.txt AC 44 ms 1444 KB
01_rnd_01.txt AC 82 ms 16608 KB
01_rnd_02.txt AC 66 ms 7392 KB
01_rnd_03.txt AC 87 ms 20132 KB
01_rnd_04.txt AC 81 ms 15660 KB
01_rnd_05.txt AC 44 ms 1376 KB
01_rnd_06.txt AC 63 ms 5216 KB
01_rnd_07.txt AC 66 ms 8032 KB
01_rnd_08.txt AC 45 ms 1312 KB
01_rnd_09.txt AC 44 ms 1440 KB
01_rnd_10.txt AC 51 ms 2080 KB
01_rnd_11.txt AC 44 ms 1372 KB
01_rnd_12.txt AC 74 ms 12320 KB
01_rnd_13.txt AC 73 ms 12068 KB
01_rnd_14.txt AC 44 ms 1372 KB
01_rnd_15.txt AC 57 ms 3740 KB
01_rnd_16.txt AC 45 ms 1316 KB
01_rnd_17.txt AC 56 ms 2988 KB
01_rnd_18.txt AC 43 ms 1312 KB
01_rnd_19.txt AC 84 ms 19292 KB
02_rndhard_00.txt AC 44 ms 1376 KB
02_rndhard_01.txt AC 43 ms 1368 KB
02_rndhard_02.txt AC 45 ms 1564 KB
02_rndhard_03.txt AC 45 ms 1564 KB
02_rndhard_04.txt AC 45 ms 1372 KB
02_rndhard_05.txt AC 43 ms 1444 KB
02_rndhard_06.txt AC 47 ms 1432 KB
02_rndhard_07.txt AC 45 ms 1316 KB
02_rndhard_08.txt AC 43 ms 1372 KB
02_rndhard_09.txt AC 43 ms 1372 KB
02_rndhard_10.txt AC 43 ms 1368 KB
02_rndhard_11.txt AC 44 ms 1372 KB
02_rndhard_12.txt AC 44 ms 1372 KB
02_rndhard_13.txt AC 43 ms 1320 KB
02_rndhard_14.txt AC 43 ms 1432 KB
02_rndhard_15.txt AC 43 ms 1372 KB
02_rndhard_16.txt AC 43 ms 1372 KB
02_rndhard_17.txt AC 42 ms 1372 KB
02_rndhard_18.txt AC 43 ms 1320 KB
02_rndhard_19.txt AC 43 ms 1372 KB
02_rndhard_20.txt AC 43 ms 1376 KB
02_rndhard_21.txt AC 44 ms 1372 KB
02_rndhard_22.txt AC 44 ms 1372 KB
02_rndhard_23.txt AC 42 ms 1372 KB
02_rndhard_24.txt AC 43 ms 1372 KB
02_rndhard_25.txt AC 43 ms 1372 KB
02_rndhard_26.txt AC 44 ms 1440 KB
02_rndhard_27.txt AC 44 ms 1320 KB
02_rndhard_28.txt AC 42 ms 1308 KB
02_rndhard_29.txt AC 44 ms 1376 KB
02_rndhard_30.txt AC 43 ms 1316 KB
02_rndhard_31.txt AC 43 ms 1368 KB
02_rndhard_32.txt AC 44 ms 1444 KB
02_rndhard_33.txt AC 43 ms 1372 KB
02_rndhard_34.txt AC 43 ms 1372 KB
02_rndhard_35.txt AC 44 ms 1376 KB
02_rndhard_36.txt AC 44 ms 1448 KB
02_rndhard_37.txt AC 43 ms 1300 KB
02_rndhard_38.txt AC 45 ms 1376 KB
02_rndhard_39.txt AC 45 ms 1376 KB
03_rndhardsmall_00.txt AC 28 ms 1056 KB
03_rndhardsmall_01.txt AC 26 ms 1048 KB
03_rndhardsmall_02.txt AC 26 ms 1056 KB
03_rndhardsmall_03.txt AC 27 ms 1060 KB
03_rndhardsmall_04.txt AC 28 ms 1184 KB
03_rndhardsmall_05.txt AC 27 ms 1044 KB
03_rndhardsmall_06.txt AC 28 ms 992 KB
03_rndhardsmall_07.txt AC 29 ms 1112 KB
03_rndhardsmall_08.txt AC 27 ms 1064 KB
03_rndhardsmall_09.txt AC 29 ms 1052 KB