Submission #3045113


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>
#define REP(i, n) for(i=0; i<n; i++)
#define REPR(i, n) for(i=n; i>=0; i--)
#define FOR(i, m, n) for(i=m; i<n; i++)
#define max(a, b) ((a)>(b) ? (a):(b))
#define min(a, b) ((a)<(b) ? (a):(b))
#define INF 10000000000
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
typedef pair<double, double> doup;

ll H, W;
char G[500][500];
bool reached[500][500]={0};

void dfs(ll x, ll y) {
    if(x<0 || H<=x || y<0 || W<=y || G[x][y]=='#') return;
    if(reached[x][y]) return;
    
    reached[x][y]=true;
    dfs(x-1, y);
    dfs(x+1, y);
    dfs(x, y-1);
    dfs(x, y+1);
}

int main(void) {
    scanf("%lld %lld", &H, &W);
    ll i, j;
    ll sx=0, sy=0;
    ll gx=0, gy=0;
    char newl;
    
    for(i=0; i<H; i++) {
        for(j=0; j<W; j++) {
            scanf("%c", &G[i][j]);

            if(G[i][j]=='s') {
                sx=i; sy=j;
                continue;
            }
            if(G[i][j]=='g') {
                gx=i; gy=j;
                continue;
            }
        }
        scanf("%c", &newl);
    }
    
    dfs(sx, sy);
    if(reached[gx][gy]) printf("Yes\n");
    else printf("No\n");
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:41: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:49:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
             scanf("%c", &G[i][j]);
                                  ^
./Main.cpp:60:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%c", &newl);
                           ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 2
WA × 3
AC × 71
WA × 12
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 WA 1 ms 256 KB
00_sample_04.txt AC 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 AC 19 ms 6912 KB
01_rnd_02.txt AC 16 ms 2688 KB
01_rnd_03.txt AC 20 ms 8192 KB
01_rnd_04.txt AC 19 ms 6528 KB
01_rnd_05.txt AC 10 ms 512 KB
01_rnd_06.txt AC 16 ms 2304 KB
01_rnd_07.txt AC 17 ms 3328 KB
01_rnd_08.txt AC 10 ms 512 KB
01_rnd_09.txt AC 10 ms 512 KB
01_rnd_10.txt WA 14 ms 1024 KB
01_rnd_11.txt AC 10 ms 512 KB
01_rnd_12.txt AC 18 ms 5376 KB
01_rnd_13.txt AC 18 ms 4992 KB
01_rnd_14.txt AC 10 ms 512 KB
01_rnd_15.txt AC 15 ms 1664 KB
01_rnd_16.txt AC 10 ms 512 KB
01_rnd_17.txt AC 15 ms 1280 KB
01_rnd_18.txt AC 10 ms 512 KB
01_rnd_19.txt AC 19 ms 7936 KB
02_rndhard_00.txt AC 10 ms 512 KB
02_rndhard_01.txt AC 11 ms 512 KB
02_rndhard_02.txt AC 11 ms 768 KB
02_rndhard_03.txt AC 11 ms 640 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 640 KB
02_rndhard_09.txt AC 11 ms 640 KB
02_rndhard_10.txt AC 11 ms 768 KB
02_rndhard_11.txt AC 11 ms 768 KB
02_rndhard_12.txt AC 10 ms 512 KB
02_rndhard_13.txt AC 10 ms 512 KB
02_rndhard_14.txt AC 11 ms 768 KB
02_rndhard_15.txt AC 11 ms 768 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 640 KB
02_rndhard_23.txt AC 11 ms 512 KB
02_rndhard_24.txt AC 12 ms 896 KB
02_rndhard_25.txt AC 12 ms 896 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 768 KB
02_rndhard_29.txt AC 10 ms 768 KB
02_rndhard_30.txt AC 10 ms 512 KB
02_rndhard_31.txt AC 10 ms 512 KB
02_rndhard_32.txt AC 11 ms 640 KB
02_rndhard_33.txt AC 10 ms 640 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 WA 1 ms 256 KB
03_rndhardsmall_07.txt WA 1 ms 256 KB
03_rndhardsmall_08.txt AC 1 ms 256 KB
03_rndhardsmall_09.txt AC 1 ms 256 KB