Submission #420579


Source Code Expand

/*
 * test.cpp
 *
 *  Created on: 2015/05/17
 *      Author: Hiromi Ayase
 */

#include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#define rep(i,n) for (int i=0; i < int(n); i++)
using namespace std;
typedef unsigned long long ll;


void digit(char map[][501], int H, int W) {
    for (int y = 0; y < H + 2; y ++) {
        for (int x = 0; x < W + 2; x ++) {
            cout << map[x][y];
        }
        cout << endl;
    }
}


bool search(char map[][501], int x, int y, int goalX, int goalY) {
    if (map[x][y] == '.') {
        if (x == goalX && y == goalY) {
            return true;
        }
        map[x][y] = '@';

        if (search(map, x + 1, y, goalX, goalY)) {
            return true;
        }
        if (search(map, x - 1, y, goalX, goalY)) {
            return true;

        }
        if (search(map, x, y + 1, goalX, goalY)) {
            return true;
        }
        if (search(map, x, y - 1, goalX, goalY)) {
            return true;
        }
    }
    return false;
}


int main(int argc, char** argv) {
    int H, W;
    cin >> H;
    cin >> W;

    char map[501][501];


    for (int x = 0; x < W + 2; x ++) {
        map[x][H + 1] = '#';
        map[x][0] = '#';
    }

    for (int y = 0; y < H + 2; y ++) {
        map[0][y] = '#';
        map[W + 1][y] = '#';
    }

    int startX, startY, goalX, goalY;

    for (int y = 1; y < H + 1; y ++) {
        for (int x = 1; x < W + 1; x ++) {
            char c;
            cin >> c;
            if (c == 's') {
                map[x][y] = '.';
                startX = x;
                startY = y;
            } else if (c == 'g') {
                map[x][y] = '.';
                goalX = x;
                goalY = y;
            } else {
                map[x][y] = c;
            }
        }
    }

    bool ret = search(map, startX, startY, goalX, goalY);
//    digit(map, H, W);
    if (ret) {
        cout << "Yes" << endl;
    } else {
        cout << "No" << endl;
    }
}

Submission Info

Submission Time
Task A - 深さ優先探索
User hiromi_ayase
Language C++ (GCC 4.9.2)
Score 0
Code Size 2099 Byte
Status RE
Exec Time 379 ms
Memory 10528 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 5
AC × 23
RE × 60
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 27 ms 732 KB
00_min_02.txt AC 24 ms 800 KB
00_min_03.txt AC 25 ms 928 KB
00_min_04.txt AC 24 ms 804 KB
00_min_05.txt AC 24 ms 928 KB
00_min_06.txt AC 24 ms 924 KB
00_min_07.txt AC 24 ms 800 KB
00_min_08.txt AC 26 ms 756 KB
00_sample_01.txt AC 24 ms 804 KB
00_sample_02.txt AC 22 ms 808 KB
00_sample_03.txt AC 25 ms 928 KB
00_sample_04.txt AC 24 ms 804 KB
00_sample_05.txt AC 24 ms 924 KB
01_rnd_00.txt RE 379 ms 924 KB
01_rnd_01.txt RE 310 ms 3880 KB
01_rnd_02.txt RE 312 ms 3236 KB
01_rnd_03.txt RE 322 ms 7840 KB
01_rnd_04.txt RE 320 ms 9892 KB
01_rnd_05.txt RE 360 ms 932 KB
01_rnd_06.txt RE 315 ms 2216 KB
01_rnd_07.txt RE 308 ms 1824 KB
01_rnd_08.txt RE 298 ms 1048 KB
01_rnd_09.txt RE 302 ms 988 KB
01_rnd_10.txt RE 304 ms 1556 KB
01_rnd_11.txt RE 322 ms 928 KB
01_rnd_12.txt RE 317 ms 8400 KB
01_rnd_13.txt RE 322 ms 6876 KB
01_rnd_14.txt RE 297 ms 1048 KB
01_rnd_15.txt RE 305 ms 2724 KB
01_rnd_16.txt RE 294 ms 972 KB
01_rnd_17.txt RE 309 ms 1828 KB
01_rnd_18.txt RE 302 ms 1060 KB
01_rnd_19.txt RE 324 ms 10528 KB
02_rndhard_00.txt RE 299 ms 1056 KB
02_rndhard_01.txt RE 308 ms 928 KB
02_rndhard_02.txt RE 310 ms 1060 KB
02_rndhard_03.txt RE 308 ms 1064 KB
02_rndhard_04.txt RE 312 ms 940 KB
02_rndhard_05.txt RE 313 ms 940 KB
02_rndhard_06.txt RE 298 ms 1048 KB
02_rndhard_07.txt RE 300 ms 1052 KB
02_rndhard_08.txt RE 301 ms 1052 KB
02_rndhard_09.txt RE 296 ms 1056 KB
02_rndhard_10.txt RE 300 ms 1056 KB
02_rndhard_11.txt RE 299 ms 1060 KB
02_rndhard_12.txt RE 301 ms 1064 KB
02_rndhard_13.txt RE 302 ms 1056 KB
02_rndhard_14.txt RE 311 ms 1056 KB
02_rndhard_15.txt RE 303 ms 1040 KB
02_rndhard_16.txt RE 301 ms 936 KB
02_rndhard_17.txt RE 299 ms 1048 KB
02_rndhard_18.txt RE 304 ms 1048 KB
02_rndhard_19.txt RE 302 ms 1056 KB
02_rndhard_20.txt RE 304 ms 1056 KB
02_rndhard_21.txt RE 303 ms 1060 KB
02_rndhard_22.txt RE 305 ms 1060 KB
02_rndhard_23.txt RE 296 ms 1056 KB
02_rndhard_24.txt RE 304 ms 920 KB
02_rndhard_25.txt RE 304 ms 1048 KB
02_rndhard_26.txt RE 304 ms 1060 KB
02_rndhard_27.txt RE 304 ms 1056 KB
02_rndhard_28.txt RE 304 ms 1056 KB
02_rndhard_29.txt RE 304 ms 1052 KB
02_rndhard_30.txt RE 305 ms 936 KB
02_rndhard_31.txt RE 302 ms 928 KB
02_rndhard_32.txt RE 303 ms 1060 KB
02_rndhard_33.txt RE 299 ms 1060 KB
02_rndhard_34.txt RE 299 ms 1056 KB
02_rndhard_35.txt RE 298 ms 1056 KB
02_rndhard_36.txt RE 297 ms 1056 KB
02_rndhard_37.txt RE 304 ms 1052 KB
02_rndhard_38.txt RE 293 ms 1052 KB
02_rndhard_39.txt RE 294 ms 1064 KB
03_rndhardsmall_00.txt AC 24 ms 924 KB
03_rndhardsmall_01.txt AC 24 ms 736 KB
03_rndhardsmall_02.txt AC 24 ms 804 KB
03_rndhardsmall_03.txt AC 25 ms 928 KB
03_rndhardsmall_04.txt AC 24 ms 720 KB
03_rndhardsmall_05.txt AC 24 ms 928 KB
03_rndhardsmall_06.txt AC 25 ms 928 KB
03_rndhardsmall_07.txt AC 24 ms 804 KB
03_rndhardsmall_08.txt AC 24 ms 768 KB
03_rndhardsmall_09.txt AC 25 ms 772 KB