# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
74356 | 2018-08-31T11:02:02 Z | khsoo01 | 도시와 비트코인 (FXCUP2_city) | C++11 | 17 ms | 2292 KB |
#include<bits/stdc++.h> using namespace std; const int N = 305; int n, m, a[N][N]; void dfs (int X, int Y) { if(!a[X][Y]) return; a[X][Y] = 0; dfs(X+1, Y); dfs(X, Y+1); } int main() { scanf("%d%d",&m,&n); for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++) { scanf("%d",&a[i][j]); } } dfs(1, 1); puts(a[n][m]?"No":"Yes"); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 3 ms | 376 KB | Output is correct |
3 | Correct | 3 ms | 404 KB | Output is correct |
4 | Correct | 2 ms | 488 KB | Output is correct |
5 | Correct | 3 ms | 644 KB | Output is correct |
6 | Correct | 2 ms | 644 KB | Output is correct |
7 | Correct | 2 ms | 644 KB | Output is correct |
8 | Correct | 2 ms | 644 KB | Output is correct |
9 | Correct | 3 ms | 704 KB | Output is correct |
10 | Correct | 2 ms | 704 KB | Output is correct |
11 | Correct | 4 ms | 748 KB | Output is correct |
12 | Correct | 5 ms | 988 KB | Output is correct |
13 | Correct | 6 ms | 988 KB | Output is correct |
14 | Correct | 6 ms | 1240 KB | Output is correct |
15 | Correct | 8 ms | 1376 KB | Output is correct |
16 | Correct | 10 ms | 1384 KB | Output is correct |
17 | Correct | 13 ms | 1764 KB | Output is correct |
18 | Correct | 10 ms | 1932 KB | Output is correct |
19 | Correct | 17 ms | 2112 KB | Output is correct |
20 | Correct | 12 ms | 2292 KB | Output is correct |