Submission #3785361


Source Code Expand

#include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
#include <set>
#include <vector>
#include <map>
#include <list>
#include <stack>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <queue>
#define pr(num) cout << num << endl
#define max(a, b) ((a)>(b) ? (a):(b))
#define min(a, b) ((a)<(b) ? (a):(b))
#define INF 1000000000000000000
#define MOD 1000000007LL
#define MAX 100005
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PA;
typedef map<ll, ll> Map;

char c[550][550];
ll reached[550][550];
ll H, W;
ll sx, sy, gx, gy;
ll dx[]={0, 0, 1, -1};
ll dy[]={1, -1, 0, 0};
ll flag;

void dfs(ll x, ll y) {
    if(reached[x][y]) return;
    
    for(ll i=0; i<4; i++) {
        ll nx=x+dx[i], ny=y+dy[i];

        if(nx<0 || nx>=H) continue;
        if(ny<0 || ny>=W) continue;
        if(c[nx][ny]=='#') continue;
        
        reached[nx][ny]=1;
        dfs(nx, ny);
        
    }
    
    
    
}

int main(void) {
    scanf("%lld %lld", &H, &W);
    ll i, j;
    for(i=0; i<H; i++) {
        for(j=0; j<W; j++) {
            scanf("%c", &c[i][j]);
            if(c[i][j]=='s') {
                sx=i;
                sy=j;
            }else if(c[i][j]=='g') {
                gx=i;
                gy=j;
            }
        }
    }
    
    dfs(sx, sy);
    
    if(reached[gx][gy]) puts("Yes");
    else puts("No");
    
    
}

Submission Info

Submission Time
Task A - 深さ優先探索
User eQe
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1467 Byte
Status WA
Exec Time 11 ms
Memory 512 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:53:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld %lld", &H, &W);
                               ^
./Main.cpp:57:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
             scanf("%c", &c[i][j]);
                                  ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 2
WA × 3
AC × 64
WA × 19
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 1 ms 256 KB
00_min_02.txt WA 1 ms 256 KB
00_min_03.txt WA 1 ms 256 KB
00_min_04.txt WA 1 ms 256 KB
00_min_05.txt AC 1 ms 256 KB
00_min_06.txt WA 1 ms 256 KB
00_min_07.txt WA 1 ms 256 KB
00_min_08.txt WA 1 ms 256 KB
00_sample_01.txt WA 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 WA 1 ms 256 KB
00_sample_05.txt WA 1 ms 256 KB
01_rnd_00.txt AC 10 ms 512 KB
01_rnd_01.txt WA 10 ms 512 KB
01_rnd_02.txt WA 10 ms 512 KB
01_rnd_03.txt WA 10 ms 512 KB
01_rnd_04.txt WA 10 ms 512 KB
01_rnd_05.txt AC 10 ms 512 KB
01_rnd_06.txt WA 10 ms 512 KB
01_rnd_07.txt WA 11 ms 512 KB
01_rnd_08.txt AC 11 ms 512 KB
01_rnd_09.txt AC 10 ms 512 KB
01_rnd_10.txt AC 11 ms 512 KB
01_rnd_11.txt AC 10 ms 512 KB
01_rnd_12.txt WA 10 ms 512 KB
01_rnd_13.txt WA 10 ms 512 KB
01_rnd_14.txt AC 11 ms 512 KB
01_rnd_15.txt WA 11 ms 512 KB
01_rnd_16.txt AC 10 ms 512 KB
01_rnd_17.txt AC 10 ms 512 KB
01_rnd_18.txt AC 11 ms 512 KB
01_rnd_19.txt WA 10 ms 512 KB
02_rndhard_00.txt AC 10 ms 512 KB
02_rndhard_01.txt AC 11 ms 512 KB
02_rndhard_02.txt AC 10 ms 512 KB
02_rndhard_03.txt AC 10 ms 512 KB
02_rndhard_04.txt AC 10 ms 512 KB
02_rndhard_05.txt AC 10 ms 512 KB
02_rndhard_06.txt AC 10 ms 512 KB
02_rndhard_07.txt AC 10 ms 512 KB
02_rndhard_08.txt AC 10 ms 512 KB
02_rndhard_09.txt AC 10 ms 512 KB
02_rndhard_10.txt AC 11 ms 512 KB
02_rndhard_11.txt AC 10 ms 512 KB
02_rndhard_12.txt AC 10 ms 512 KB
02_rndhard_13.txt AC 10 ms 512 KB
02_rndhard_14.txt AC 10 ms 512 KB
02_rndhard_15.txt AC 10 ms 512 KB
02_rndhard_16.txt AC 10 ms 512 KB
02_rndhard_17.txt AC 10 ms 512 KB
02_rndhard_18.txt AC 10 ms 512 KB
02_rndhard_19.txt AC 10 ms 512 KB
02_rndhard_20.txt AC 10 ms 512 KB
02_rndhard_21.txt AC 10 ms 512 KB
02_rndhard_22.txt AC 10 ms 512 KB
02_rndhard_23.txt AC 11 ms 512 KB
02_rndhard_24.txt AC 10 ms 512 KB
02_rndhard_25.txt AC 11 ms 512 KB
02_rndhard_26.txt AC 10 ms 512 KB
02_rndhard_27.txt AC 10 ms 512 KB
02_rndhard_28.txt AC 10 ms 512 KB
02_rndhard_29.txt AC 10 ms 512 KB
02_rndhard_30.txt AC 10 ms 512 KB
02_rndhard_31.txt AC 10 ms 512 KB
02_rndhard_32.txt AC 10 ms 512 KB
02_rndhard_33.txt AC 10 ms 512 KB
02_rndhard_34.txt AC 10 ms 512 KB
02_rndhard_35.txt AC 11 ms 512 KB
02_rndhard_36.txt AC 10 ms 512 KB
02_rndhard_37.txt AC 10 ms 512 KB
02_rndhard_38.txt AC 10 ms 512 KB
02_rndhard_39.txt AC 10 ms 512 KB
03_rndhardsmall_00.txt AC 1 ms 256 KB
03_rndhardsmall_01.txt AC 1 ms 256 KB
03_rndhardsmall_02.txt AC 1 ms 256 KB
03_rndhardsmall_03.txt AC 1 ms 256 KB
03_rndhardsmall_04.txt AC 1 ms 256 KB
03_rndhardsmall_05.txt AC 1 ms 256 KB
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