Submission #7575799


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
#define debug 1

using namespace std;

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

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

    for (int di = 0 ; di < 4; di++) {
        int next_x = x + ds[di][0];
        int next_y = y + ds[di][1];
        if (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 1512 Byte
Status WA
Exec Time 21 ms
Memory 12672 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:45: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:49: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
AC × 5
AC × 81
WA × 2
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 AC 1 ms 256 KB
00_min_03.txt AC 1 ms 256 KB
00_min_04.txt AC 1 ms 256 KB
00_min_05.txt AC 1 ms 256 KB
00_min_06.txt AC 1 ms 256 KB
00_min_07.txt AC 1 ms 256 KB
00_min_08.txt AC 1 ms 256 KB
00_sample_01.txt AC 1 ms 256 KB
00_sample_02.txt AC 1 ms 256 KB
00_sample_03.txt AC 1 ms 256 KB
00_sample_04.txt AC 1 ms 256 KB
00_sample_05.txt AC 1 ms 256 KB
01_rnd_00.txt AC 12 ms 512 KB
01_rnd_01.txt AC 17 ms 7808 KB
01_rnd_02.txt AC 15 ms 3328 KB
01_rnd_03.txt AC 18 ms 9600 KB
01_rnd_04.txt AC 17 ms 8320 KB
01_rnd_05.txt AC 12 ms 512 KB
01_rnd_06.txt AC 17 ms 3712 KB
01_rnd_07.txt AC 15 ms 3840 KB
01_rnd_08.txt AC 12 ms 512 KB
01_rnd_09.txt AC 12 ms 512 KB
01_rnd_10.txt AC 15 ms 1152 KB
01_rnd_11.txt AC 12 ms 512 KB
01_rnd_12.txt AC 17 ms 7680 KB
01_rnd_13.txt AC 18 ms 8576 KB
01_rnd_14.txt AC 12 ms 512 KB
01_rnd_15.txt AC 14 ms 2048 KB
01_rnd_16.txt AC 12 ms 512 KB
01_rnd_17.txt AC 16 ms 1280 KB
01_rnd_18.txt AC 12 ms 512 KB
01_rnd_19.txt AC 21 ms 12672 KB
02_rndhard_00.txt AC 12 ms 512 KB
02_rndhard_01.txt AC 12 ms 512 KB
02_rndhard_02.txt AC 12 ms 512 KB
02_rndhard_03.txt AC 12 ms 512 KB
02_rndhard_04.txt WA 12 ms 640 KB
02_rndhard_05.txt AC 14 ms 768 KB
02_rndhard_06.txt AC 13 ms 768 KB
02_rndhard_07.txt AC 13 ms 768 KB
02_rndhard_08.txt AC 12 ms 512 KB
02_rndhard_09.txt AC 12 ms 512 KB
02_rndhard_10.txt AC 12 ms 512 KB
02_rndhard_11.txt AC 12 ms 512 KB
02_rndhard_12.txt AC 12 ms 512 KB
02_rndhard_13.txt AC 12 ms 512 KB
02_rndhard_14.txt AC 12 ms 512 KB
02_rndhard_15.txt AC 12 ms 512 KB
02_rndhard_16.txt AC 12 ms 512 KB
02_rndhard_17.txt AC 12 ms 512 KB
02_rndhard_18.txt AC 12 ms 512 KB
02_rndhard_19.txt AC 12 ms 512 KB
02_rndhard_20.txt AC 12 ms 512 KB
02_rndhard_21.txt AC 12 ms 512 KB
02_rndhard_22.txt AC 12 ms 512 KB
02_rndhard_23.txt AC 12 ms 512 KB
02_rndhard_24.txt AC 12 ms 512 KB
02_rndhard_25.txt AC 12 ms 512 KB
02_rndhard_26.txt AC 12 ms 512 KB
02_rndhard_27.txt AC 12 ms 512 KB
02_rndhard_28.txt AC 12 ms 512 KB
02_rndhard_29.txt AC 12 ms 512 KB
02_rndhard_30.txt AC 12 ms 512 KB
02_rndhard_31.txt AC 12 ms 512 KB
02_rndhard_32.txt AC 12 ms 512 KB
02_rndhard_33.txt AC 12 ms 512 KB
02_rndhard_34.txt AC 12 ms 512 KB
02_rndhard_35.txt AC 12 ms 512 KB
02_rndhard_36.txt AC 12 ms 512 KB
02_rndhard_37.txt AC 12 ms 512 KB
02_rndhard_38.txt AC 12 ms 512 KB
02_rndhard_39.txt AC 12 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 WA 1 ms 256 KB
03_rndhardsmall_05.txt AC 1 ms 256 KB
03_rndhardsmall_06.txt AC 1 ms 256 KB
03_rndhardsmall_07.txt AC 1 ms 256 KB
03_rndhardsmall_08.txt AC 1 ms 256 KB
03_rndhardsmall_09.txt AC 1 ms 256 KB