Submission #6049332


Source Code Expand

Copy
#include <iostream>
#include <algorithm>
#include <functional>
#include <string>
#include <climits>
#include <vector>
#include <numeric>
#include <complex>
#include <map>
#include <bitset>
#include <stack>
#include <queue>
#include <set>
using namespace std;
    
#define __int64 long long
#define long __int64
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
const int Vec = 4;
const int Vecy[Vec] = {0,-1,0,1};
const int Vecx[Vec] = {1,0,-1,0};
const int Modd = 1000000007;


char c[501][501];

queue<pair<int, int>> que;

int main(){
    int h,w;
    cin >> h >> w;

    rep(iy,h){
        rep(ix, w){
            cin >> c[iy][ix];
            if(c[iy][ix] == 's'){
                que.push(make_pair(ix, iy));
            }
        }
    }

    while(!que.empty()){
        auto loc = que.front();
        que.pop();

        for(int veci=0; veci<Vec; veci++){
            int cx = loc.first + Vecx[veci];
            int cy = loc.second + Vecy[veci];

            if(cx < 0 || cx >= w || cy < 0 || cy >= h) continue;
            if(c[cy][cx] == 'g'){
                cout << "Yes" << endl;
                return 0;
            }
            if(c[cy][cx] == '.'){
                c[cy][cx] = '#';
                que.push(make_pair(cx, cy));
            }
        }
    }

    cout << "No" << endl;
    return 0;
}

Submission Info

Submission Time
Task A - 深さ優先探索
User b158b
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1402 Byte
Status
Exec Time 18 ms
Memory 512 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 100 / 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 512 KB
01_rnd_01.txt 16 ms 512 KB
01_rnd_02.txt 16 ms 512 KB
01_rnd_03.txt 17 ms 512 KB
01_rnd_04.txt 16 ms 512 KB
01_rnd_05.txt 15 ms 512 KB
01_rnd_06.txt 18 ms 512 KB
01_rnd_07.txt 17 ms 512 KB
01_rnd_08.txt 15 ms 512 KB
01_rnd_09.txt 15 ms 512 KB
01_rnd_10.txt 18 ms 512 KB
01_rnd_11.txt 15 ms 512 KB
01_rnd_12.txt 18 ms 512 KB
01_rnd_13.txt 15 ms 512 KB
01_rnd_14.txt 14 ms 512 KB
01_rnd_15.txt 18 ms 512 KB
01_rnd_16.txt 15 ms 512 KB
01_rnd_17.txt 18 ms 512 KB
01_rnd_18.txt 15 ms 512 KB
01_rnd_19.txt 17 ms 512 KB
02_rndhard_00.txt 15 ms 512 KB
02_rndhard_01.txt 14 ms 512 KB
02_rndhard_02.txt 15 ms 512 KB
02_rndhard_03.txt 17 ms 512 KB
02_rndhard_04.txt 15 ms 512 KB
02_rndhard_05.txt 15 ms 512 KB
02_rndhard_06.txt 15 ms 512 KB
02_rndhard_07.txt 15 ms 512 KB
02_rndhard_08.txt 15 ms 512 KB
02_rndhard_09.txt 15 ms 512 KB
02_rndhard_10.txt 15 ms 512 KB
02_rndhard_11.txt 15 ms 512 KB
02_rndhard_12.txt 15 ms 512 KB
02_rndhard_13.txt 15 ms 512 KB
02_rndhard_14.txt 15 ms 512 KB
02_rndhard_15.txt 15 ms 512 KB
02_rndhard_16.txt 15 ms 512 KB
02_rndhard_17.txt 15 ms 512 KB
02_rndhard_18.txt 15 ms 512 KB
02_rndhard_19.txt 15 ms 512 KB
02_rndhard_20.txt 15 ms 512 KB
02_rndhard_21.txt 15 ms 512 KB
02_rndhard_22.txt 15 ms 512 KB
02_rndhard_23.txt 15 ms 512 KB
02_rndhard_24.txt 15 ms 512 KB
02_rndhard_25.txt 15 ms 512 KB
02_rndhard_26.txt 15 ms 512 KB
02_rndhard_27.txt 15 ms 512 KB
02_rndhard_28.txt 15 ms 512 KB
02_rndhard_29.txt 15 ms 512 KB
02_rndhard_30.txt 15 ms 512 KB
02_rndhard_31.txt 15 ms 512 KB
02_rndhard_32.txt 15 ms 512 KB
02_rndhard_33.txt 15 ms 512 KB
02_rndhard_34.txt 15 ms 512 KB
02_rndhard_35.txt 15 ms 512 KB
02_rndhard_36.txt 15 ms 512 KB
02_rndhard_37.txt 14 ms 512 KB
02_rndhard_38.txt 15 ms 512 KB
02_rndhard_39.txt 15 ms 512 KB
03_rndhardsmall_00.txt 1 ms 256 KB
03_rndhardsmall_01.txt 1 ms 256 KB
03_rndhardsmall_02.txt 1 ms 256 KB
03_rndhardsmall_03.txt 1 ms 256 KB
03_rndhardsmall_04.txt 1 ms 256 KB
03_rndhardsmall_05.txt 1 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