Submission #7575724


Source Code Expand

#include <climits>
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <numeric>
#include <cassert>
#include <utility>
#include <tuple>

#define dprintf printf
#define debug 1

using namespace std;

int h, w;
char c[500][500];

bool dfs(int x, int y) {
    int d[] = {0, -1, 1};
    if (c[y][x] == 'g') {
        return true;
    }
    c[y][x] = '#';

    for (int dx : d) {
        for (int dy : d) {
            int next_x = x + dx;
            int next_y = y + dy;
            if ((dx == 0 && dy == 0) 
                || next_x < 0 || next_x >= w 
                || next_y < 0 || next_y >= h
                || c[next_y][next_x] == '#') {
                continue;
            }
            bool next = dfs(next_x, next_y);
            if (next) {
                return true;
            }
        }
    }
    return false;
}

int main() {
    pair<int, int> start, goal;
    scanf(" %d %d", &h, &w);
    dprintf("%d %d\n", h, w);
    for (int i = 0; i < h; i++) {
        for (int j = 0; j < w; j++) {
            scanf(" %c", &c[i][j]);
            if (c[i][j] == 's') {
                start = make_pair(i, j);
            } else if (c[i][j] == 'g') {
                goal = make_pair(i, j);
            }
        }
    }

    for (int i = 0; i < h; i++) {
        for (int j = 0; j < w; j++) {
            dprintf("%c ", c[i][j]);
        }
        dprintf("\n");
    }

    printf("%s\n", dfs(start.first, start.second) ? "Yes" : "No");

    return 0;
}

Submission Info

Submission Time
Task A - 深さ優先探索
User abctkys
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1587 Byte
Status WA
Exec Time 36 ms
Memory 15616 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:48:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf(" %d %d", &h, &w);
                            ^
./Main.cpp:52:35: 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
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 24 ms 1024 KB
01_rnd_01.txt WA 31 ms 11264 KB
01_rnd_02.txt WA 29 ms 7424 KB
01_rnd_03.txt WA 32 ms 12160 KB
01_rnd_04.txt WA 36 ms 15616 KB
01_rnd_05.txt WA 27 ms 3200 KB
01_rnd_06.txt WA 29 ms 6656 KB
01_rnd_07.txt WA 30 ms 6784 KB
01_rnd_08.txt WA 24 ms 1024 KB
01_rnd_09.txt WA 24 ms 1024 KB
01_rnd_10.txt WA 26 ms 3072 KB
01_rnd_11.txt WA 24 ms 1024 KB
01_rnd_12.txt WA 33 ms 13312 KB
01_rnd_13.txt WA 31 ms 11264 KB
01_rnd_14.txt WA 24 ms 1664 KB
01_rnd_15.txt WA 35 ms 10496 KB
01_rnd_16.txt WA 24 ms 1024 KB
01_rnd_17.txt WA 25 ms 1920 KB
01_rnd_18.txt WA 24 ms 1024 KB
01_rnd_19.txt WA 25 ms 2560 KB
02_rndhard_00.txt WA 32 ms 8192 KB
02_rndhard_01.txt WA 33 ms 8192 KB
02_rndhard_02.txt WA 26 ms 3840 KB
02_rndhard_03.txt WA 26 ms 3840 KB
02_rndhard_04.txt WA 30 ms 7936 KB
02_rndhard_05.txt WA 30 ms 7936 KB
02_rndhard_06.txt WA 28 ms 4992 KB
02_rndhard_07.txt WA 28 ms 4992 KB
02_rndhard_08.txt WA 25 ms 1664 KB
02_rndhard_09.txt WA 24 ms 1664 KB
02_rndhard_10.txt WA 27 ms 4608 KB
02_rndhard_11.txt WA 27 ms 4608 KB
02_rndhard_12.txt WA 33 ms 8704 KB
02_rndhard_13.txt WA 33 ms 8704 KB
02_rndhard_14.txt WA 24 ms 1024 KB
02_rndhard_15.txt WA 24 ms 1024 KB
02_rndhard_16.txt WA 26 ms 3328 KB
02_rndhard_17.txt WA 26 ms 3328 KB
02_rndhard_18.txt WA 27 ms 3840 KB
02_rndhard_19.txt WA 28 ms 3840 KB
02_rndhard_20.txt WA 31 ms 8448 KB
02_rndhard_21.txt WA 31 ms 8448 KB
02_rndhard_22.txt WA 31 ms 8064 KB
02_rndhard_23.txt WA 31 ms 8064 KB
02_rndhard_24.txt WA 30 ms 7808 KB
02_rndhard_25.txt WA 30 ms 7808 KB
02_rndhard_26.txt WA 25 ms 1792 KB
02_rndhard_27.txt WA 25 ms 1792 KB
02_rndhard_28.txt WA 33 ms 8192 KB
02_rndhard_29.txt WA 33 ms 8192 KB
02_rndhard_30.txt WA 30 ms 6016 KB
02_rndhard_31.txt WA 30 ms 6016 KB
02_rndhard_32.txt WA 34 ms 8832 KB
02_rndhard_33.txt WA 33 ms 8832 KB
02_rndhard_34.txt WA 27 ms 4224 KB
02_rndhard_35.txt WA 27 ms 4224 KB
02_rndhard_36.txt WA 24 ms 1280 KB
02_rndhard_37.txt WA 24 ms 1280 KB
02_rndhard_38.txt WA 31 ms 8704 KB
02_rndhard_39.txt WA 31 ms 8704 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