Submission #420561


Source Code Expand

#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <sstream>
#include <map>
#include <set>
#include <vector>
#include <cmath>

using namespace std;



int main(int argc, const char * argv[])
{
    //std::ios::sync_with_stdio(false);
    //scanf("%s",S);
    //scanf("%d",&N);
    //getline(cin, target);
    //cin >> x >> y;
    //ここから

    int H,W;
    cin >> H >> W;
    
    string C[500];
    
    for(int i=0;i<H;i++){
        cin >> C[i];
    }

    char used[500][500];
    bool conti=false;
    
    for(int i=0;i<H;i++){
        for(int j=0;j<W;j++){
            used[i][j]=0;
        }
    }
    
    for(int i=0;i<H;i++){
        for(int j=0;j<W;j++){
            if(C[i][j]=='s'){
                used[i][j]=1;
                conti=true;
                break;
            }
        }
    }

    while(conti){
        conti=false;
    for(int i=0;i<H;i++){
        for(int j=0;j<W;j++){
            if(used[i][j]==1){
                used[i][j]=2;
            
            
            if(C[i-1][j]=='g' && i-1>=0){
                cout << "YES" << endl;
                return 0;
            }else if(C[i-1][j]=='.'&& i-1>=0){
                if(used[i-1][j]!=2){
                    used[i-1][j]=1;
                    conti=true;
                }
            }
            
            
            if(C[i+1][j]=='g'&& i+1<=H){
                cout << "YES" << endl;
                return 0;
            }else if(C[i+1][j]=='.'&& i+1<=H){
                if(used[i+1][j]!=2){
                    used[i+1][j]=1;
                    conti=true;
                }
            }
            
            
            if(C[i][j-1]=='g'&& j-1>=0){
                cout << "YES" << endl;
                return 0;
            }else if(C[i][j-1]=='.'&& j-1>=0){
                if(used[i][j-1]!=2){
                    used[i][j-1]=1;
                    conti=true;
                }
            }
            
            
            if(C[i-1][j+1]=='g'&& j+1<=W){
                cout << "YES" << endl;
                return 0;
            }else if(C[i][j+1]=='.'&& j+1<=W){
                if(used[i][j+1]!=2){
                    used[i][j+1]=1;
                    conti=true;
                }
            }
            }
        }
    }
    }
    
    
    
    cout << "NO" << endl;
    
    //ここまで
    //cout << target << endl;改行含む
    //printf("%f\n",pow(2,ans.size()));

    return 0;
}

Submission Info

Submission Time
Task A - 深さ優先探索
User ikeha
Language C++ (GCC 4.9.2)
Score 0
Code Size 2628 Byte
Status WA
Exec Time 363 ms
Memory 1440 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
RE × 5
WA × 55
RE × 28
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 RE 297 ms 924 KB
00_min_02.txt RE 287 ms 920 KB
00_min_03.txt RE 282 ms 920 KB
00_min_04.txt RE 291 ms 736 KB
00_min_05.txt WA 27 ms 828 KB
00_min_06.txt WA 26 ms 800 KB
00_min_07.txt WA 26 ms 920 KB
00_min_08.txt WA 27 ms 804 KB
00_sample_01.txt RE 279 ms 920 KB
00_sample_02.txt RE 301 ms 920 KB
00_sample_03.txt RE 289 ms 812 KB
00_sample_04.txt RE 279 ms 792 KB
00_sample_05.txt RE 288 ms 924 KB
01_rnd_00.txt WA 42 ms 1312 KB
01_rnd_01.txt RE 293 ms 1316 KB
01_rnd_02.txt RE 301 ms 1312 KB
01_rnd_03.txt WA 43 ms 1316 KB
01_rnd_04.txt RE 302 ms 1188 KB
01_rnd_05.txt WA 45 ms 1316 KB
01_rnd_06.txt RE 297 ms 1324 KB
01_rnd_07.txt RE 322 ms 1316 KB
01_rnd_08.txt WA 42 ms 1312 KB
01_rnd_09.txt WA 42 ms 1316 KB
01_rnd_10.txt RE 360 ms 1316 KB
01_rnd_11.txt WA 42 ms 1308 KB
01_rnd_12.txt WA 42 ms 1308 KB
01_rnd_13.txt WA 44 ms 1312 KB
01_rnd_14.txt WA 43 ms 1312 KB
01_rnd_15.txt RE 314 ms 1316 KB
01_rnd_16.txt WA 42 ms 1316 KB
01_rnd_17.txt RE 315 ms 1312 KB
01_rnd_18.txt WA 42 ms 1268 KB
01_rnd_19.txt RE 296 ms 1244 KB
02_rndhard_00.txt WA 77 ms 1248 KB
02_rndhard_01.txt WA 78 ms 1324 KB
02_rndhard_02.txt RE 363 ms 1316 KB
02_rndhard_03.txt RE 360 ms 1320 KB
02_rndhard_04.txt WA 48 ms 1316 KB
02_rndhard_05.txt WA 48 ms 1312 KB
02_rndhard_06.txt WA 60 ms 1308 KB
02_rndhard_07.txt WA 48 ms 1320 KB
02_rndhard_08.txt WA 112 ms 1312 KB
02_rndhard_09.txt WA 112 ms 1440 KB
02_rndhard_10.txt RE 357 ms 1308 KB
02_rndhard_11.txt RE 350 ms 1312 KB
02_rndhard_12.txt WA 92 ms 1316 KB
02_rndhard_13.txt WA 93 ms 1320 KB
02_rndhard_14.txt WA 123 ms 1312 KB
02_rndhard_15.txt WA 123 ms 1316 KB
02_rndhard_16.txt RE 318 ms 1304 KB
02_rndhard_17.txt RE 324 ms 1308 KB
02_rndhard_18.txt WA 60 ms 1308 KB
02_rndhard_19.txt WA 56 ms 1316 KB
02_rndhard_20.txt RE 327 ms 1308 KB
02_rndhard_21.txt RE 332 ms 1312 KB
02_rndhard_22.txt WA 104 ms 1324 KB
02_rndhard_23.txt WA 103 ms 1308 KB
02_rndhard_24.txt WA 70 ms 1244 KB
02_rndhard_25.txt WA 68 ms 1304 KB
02_rndhard_26.txt WA 69 ms 1304 KB
02_rndhard_27.txt WA 55 ms 1308 KB
02_rndhard_28.txt WA 73 ms 1308 KB
02_rndhard_29.txt WA 67 ms 1312 KB
02_rndhard_30.txt WA 44 ms 1304 KB
02_rndhard_31.txt WA 45 ms 1312 KB
02_rndhard_32.txt WA 114 ms 1308 KB
02_rndhard_33.txt WA 103 ms 1312 KB
02_rndhard_34.txt WA 72 ms 1312 KB
02_rndhard_35.txt WA 73 ms 1304 KB
02_rndhard_36.txt WA 65 ms 1264 KB
02_rndhard_37.txt WA 64 ms 1312 KB
02_rndhard_38.txt WA 65 ms 1312 KB
02_rndhard_39.txt WA 64 ms 1312 KB
03_rndhardsmall_00.txt WA 25 ms 916 KB
03_rndhardsmall_01.txt WA 26 ms 904 KB
03_rndhardsmall_02.txt WA 25 ms 732 KB
03_rndhardsmall_03.txt WA 27 ms 912 KB
03_rndhardsmall_04.txt WA 28 ms 800 KB
03_rndhardsmall_05.txt WA 26 ms 920 KB
03_rndhardsmall_06.txt RE 286 ms 924 KB
03_rndhardsmall_07.txt RE 285 ms 920 KB
03_rndhardsmall_08.txt WA 25 ms 916 KB
03_rndhardsmall_09.txt WA 26 ms 744 KB