Submission #2523321


Source Code Expand

#include <bits/stdc++.h>

typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define pb push_back
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};

#define FOR(i, a, b) for (int i = (a); i<(b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)


int h, w;
char c[600][600];
queue<tuple<int, int, int> > q;

bool used[600][600][3];

int main() {
    scanf("%d%d", &h, &w);
    for (int i = 0; i < h; i++)
        scanf("%s", c[i]);

    int si, sj, gi, gj;
    for (int i = 0; i < h; i++) {
        for (int j = 0; j < w; j++) {
            if (c[i][j] == 's') {
                si = i; sj = j;
            }
            if (c[i][j] == 'g') {
                gi = i; gj = j;
            }
        }
    }

    rep(i, h)rep(j, w)rep(k, 3) {
        used[i][j][k] = false;
    }
    used[si][sj][0] = true;//can go 0 break;

    for (int k = 0; k < 4; k++) {
        int i = si + dx[k];
        int j = sj + dy[k];
        if (0 <= i && i < h && 0 <= j && j < w) {
            int k = (c[i][j] == '#' ? 1 : 0);
            used[i][j][k] = true;
            q.push(make_tuple(i, j, k));

        }
    }
    //cout << q.size() << endl;
    while (!q.empty()) {
        int i, j, t;
        tie(i, j, t) = q.front(); q.pop();

        rep(k, 4) {
            int ni = i + dx[k];
            int nj = j + dy[k];
            if(0 <= ni && ni < h && 0 <= nj && nj < w) {
                int nt = (c[ni][nj] == '#' ?  t+1 : t);
                if (nt > 2 || used[ni][nj][nt])
                    continue;
                q.push(make_tuple(ni, nj, nt));
                used[ni][nj][nt] = true;
            }
        }
    }
    if(used[gi][gj][0] || used[gi][gj][1] || used[gi][gj][2])
        printf("YES\n");
    else
        printf("NO\n");


    return 0;
}
















Submission Info

Submission Time
Task C - 器物損壊!高橋君
User suakii
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1892 Byte
Status AC
Exec Time 28 ms
Memory 1408 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:21:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &h, &w);
                          ^
./Main.cpp:23:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%s", c[i]);
                          ^

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 83
Set Name Test Cases
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 3 ms 1408 KB
01_rnd_01.txt AC 21 ms 1408 KB
01_rnd_02.txt AC 27 ms 1408 KB
01_rnd_03.txt AC 19 ms 1408 KB
01_rnd_04.txt AC 21 ms 1408 KB
01_rnd_05.txt AC 3 ms 1408 KB
01_rnd_06.txt AC 28 ms 1408 KB
01_rnd_07.txt AC 26 ms 1408 KB
01_rnd_08.txt AC 3 ms 1408 KB
01_rnd_09.txt AC 3 ms 1408 KB
01_rnd_10.txt AC 27 ms 1408 KB
01_rnd_11.txt AC 3 ms 1408 KB
01_rnd_12.txt AC 23 ms 1408 KB
01_rnd_13.txt AC 24 ms 1408 KB
01_rnd_14.txt AC 4 ms 1408 KB
01_rnd_15.txt AC 28 ms 1408 KB
01_rnd_16.txt AC 3 ms 1408 KB
01_rnd_17.txt AC 28 ms 1408 KB
01_rnd_18.txt AC 3 ms 1408 KB
01_rnd_19.txt AC 19 ms 1408 KB
02_rndhard_00.txt AC 5 ms 1408 KB
02_rndhard_01.txt AC 4 ms 1408 KB
02_rndhard_02.txt AC 15 ms 1408 KB
02_rndhard_03.txt AC 13 ms 1408 KB
02_rndhard_04.txt AC 8 ms 1408 KB
02_rndhard_05.txt AC 7 ms 1408 KB
02_rndhard_06.txt AC 9 ms 1408 KB
02_rndhard_07.txt AC 4 ms 1408 KB
02_rndhard_08.txt AC 7 ms 1408 KB
02_rndhard_09.txt AC 6 ms 1408 KB
02_rndhard_10.txt AC 7 ms 1408 KB
02_rndhard_11.txt AC 6 ms 1408 KB
02_rndhard_12.txt AC 5 ms 1408 KB
02_rndhard_13.txt AC 5 ms 1408 KB
02_rndhard_14.txt AC 7 ms 1408 KB
02_rndhard_15.txt AC 6 ms 1408 KB
02_rndhard_16.txt AC 11 ms 1408 KB
02_rndhard_17.txt AC 8 ms 1408 KB
02_rndhard_18.txt AC 5 ms 1408 KB
02_rndhard_19.txt AC 4 ms 1408 KB
02_rndhard_20.txt AC 6 ms 1408 KB
02_rndhard_21.txt AC 5 ms 1408 KB
02_rndhard_22.txt AC 6 ms 1408 KB
02_rndhard_23.txt AC 5 ms 1408 KB
02_rndhard_24.txt AC 10 ms 1408 KB
02_rndhard_25.txt AC 5 ms 1408 KB
02_rndhard_26.txt AC 5 ms 1408 KB
02_rndhard_27.txt AC 3 ms 1408 KB
02_rndhard_28.txt AC 4 ms 1408 KB
02_rndhard_29.txt AC 4 ms 1408 KB
02_rndhard_30.txt AC 3 ms 1408 KB
02_rndhard_31.txt AC 3 ms 1408 KB
02_rndhard_32.txt AC 9 ms 1408 KB
02_rndhard_33.txt AC 6 ms 1408 KB
02_rndhard_34.txt AC 7 ms 1408 KB
02_rndhard_35.txt AC 7 ms 1408 KB
02_rndhard_36.txt AC 6 ms 1408 KB
02_rndhard_37.txt AC 6 ms 1408 KB
02_rndhard_38.txt AC 7 ms 1408 KB
02_rndhard_39.txt AC 6 ms 1408 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 AC 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