Submission #1697921


Source Code Expand

#include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <tuple>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#define REP(i, n) for(LL i = 0;i < n;i++)
#define REPR(i, n) for(LL i = n;i >= 0;i--)
#define FOR(i, m, n) for(LL i = m;i < n;i++)
#define FORR(i, m, n) for(LL i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()
#define INF 999999999
#define MOD 1000000007
using namespace std;
typedef long long LL;
//typedef LL int;
typedef pair<int, int> P;
typedef pair<LL, LL> LP;
typedef pair<int, P> PP;
typedef pair<LL, LP> LPP;
int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};

#define MAX_W 501
#define MAX_H 501

int w, h;
char maze[MAX_W][MAX_H];
bool reached[MAX_W][MAX_H];
P startp, endp; 

void search(int x, int y){
    if(x < 0 || w <= x || y < 0 || h <= y || maze[x][y] == '#') return;

    if(reached[x][y]) return;
    
    reached[x][y] = true;

    search(x + 1, y);
    search(x - 1, y);
    search(x, y + 1);
    search(x, y - 1);
}

int main(){
    cin >> w >> h;
    
    REP(i, h){
        REP(j, w){
            cin >> maze[j][i];
            if(maze[j][i] == 's'){
                startp.first = j;
                startp.second = i;
            }
            if(maze[j][i] == 'g'){
                endp.first = j;
                endp.second = i;
            }
        }
    }

    search(startp.first, startp.second);

    if(reached[endp.first][endp.second]){
        cout << "Yes" << endl;
    }else{
        cout << "No" << endl;
    }

    cout << startp.first << ", " << startp.second << endl;

    cout << endp.first << ", " << endp.second << endl;

    cout << reached[endp.first][endp.second] << endl;
}

Submission Info

Submission Time
Task A - 深さ優先探索
User wheson
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1912 Byte
Status WA
Exec Time 26 ms
Memory 10240 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
WA × 5
WA × 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 WA 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 WA 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 WA 1 ms 256 KB
00_sample_03.txt WA 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 WA 15 ms 512 KB
01_rnd_01.txt WA 25 ms 8960 KB
01_rnd_02.txt WA 22 ms 3840 KB
01_rnd_03.txt WA 24 ms 6144 KB
01_rnd_04.txt WA 25 ms 8320 KB
01_rnd_05.txt WA 15 ms 512 KB
01_rnd_06.txt WA 21 ms 2688 KB
01_rnd_07.txt WA 22 ms 4224 KB
01_rnd_08.txt WA 15 ms 512 KB
01_rnd_09.txt WA 15 ms 512 KB
01_rnd_10.txt WA 18 ms 1152 KB
01_rnd_11.txt WA 15 ms 512 KB
01_rnd_12.txt WA 24 ms 6656 KB
01_rnd_13.txt WA 24 ms 6528 KB
01_rnd_14.txt WA 15 ms 512 KB
01_rnd_15.txt WA 20 ms 2048 KB
01_rnd_16.txt WA 15 ms 512 KB
01_rnd_17.txt WA 20 ms 1408 KB
01_rnd_18.txt WA 15 ms 512 KB
01_rnd_19.txt WA 26 ms 10240 KB
02_rndhard_00.txt WA 15 ms 512 KB
02_rndhard_01.txt WA 15 ms 512 KB
02_rndhard_02.txt WA 16 ms 768 KB
02_rndhard_03.txt WA 16 ms 768 KB
02_rndhard_04.txt WA 15 ms 512 KB
02_rndhard_05.txt WA 15 ms 512 KB
02_rndhard_06.txt WA 15 ms 512 KB
02_rndhard_07.txt WA 15 ms 512 KB
02_rndhard_08.txt WA 15 ms 640 KB
02_rndhard_09.txt WA 15 ms 640 KB
02_rndhard_10.txt WA 15 ms 640 KB
02_rndhard_11.txt WA 15 ms 640 KB
02_rndhard_12.txt WA 15 ms 512 KB
02_rndhard_13.txt WA 15 ms 512 KB
02_rndhard_14.txt WA 15 ms 512 KB
02_rndhard_15.txt WA 15 ms 512 KB
02_rndhard_16.txt WA 15 ms 512 KB
02_rndhard_17.txt WA 15 ms 512 KB
02_rndhard_18.txt WA 15 ms 512 KB
02_rndhard_19.txt WA 15 ms 512 KB
02_rndhard_20.txt WA 15 ms 512 KB
02_rndhard_21.txt WA 15 ms 512 KB
02_rndhard_22.txt WA 15 ms 640 KB
02_rndhard_23.txt WA 15 ms 512 KB
02_rndhard_24.txt WA 15 ms 512 KB
02_rndhard_25.txt WA 15 ms 512 KB
02_rndhard_26.txt WA 15 ms 512 KB
02_rndhard_27.txt WA 15 ms 512 KB
02_rndhard_28.txt WA 15 ms 512 KB
02_rndhard_29.txt WA 15 ms 512 KB
02_rndhard_30.txt WA 15 ms 512 KB
02_rndhard_31.txt WA 15 ms 512 KB
02_rndhard_32.txt WA 15 ms 512 KB
02_rndhard_33.txt WA 15 ms 512 KB
02_rndhard_34.txt WA 15 ms 512 KB
02_rndhard_35.txt WA 15 ms 512 KB
02_rndhard_36.txt WA 15 ms 512 KB
02_rndhard_37.txt WA 15 ms 512 KB
02_rndhard_38.txt WA 15 ms 512 KB
02_rndhard_39.txt WA 15 ms 512 KB
03_rndhardsmall_00.txt WA 1 ms 256 KB
03_rndhardsmall_01.txt WA 1 ms 256 KB
03_rndhardsmall_02.txt WA 1 ms 256 KB
03_rndhardsmall_03.txt WA 1 ms 256 KB
03_rndhardsmall_04.txt WA 1 ms 256 KB
03_rndhardsmall_05.txt WA 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 WA 1 ms 256 KB
03_rndhardsmall_09.txt WA 1 ms 256 KB