# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
28176 | 2017-07-15T14:11:10 Z | IE(#1205, kriii) | 도시와 비트코인 (FXCUP2_city) | C++ | 16 ms | 1204 KB |
#include <stdio.h> int M,N; bool g[303][303]; int main() { scanf ("%d %d",&M,&N); for (int i=0;i<N;i++){ for (int j=0;j<M;j++){ int x; scanf ("%d",&x); if (x){ bool v = false; if (i && j) v = g[i-1][j] || g[i][j-1]; else if (i) v = g[i-1][j]; else if (j) v = g[i][j-1]; else v = true; g[i][j] = v; } } } puts(g[N-1][M-1]?"Yes":"No"); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 1204 KB | Output is correct |
2 | Correct | 0 ms | 1204 KB | Output is correct |
3 | Correct | 0 ms | 1204 KB | Output is correct |
4 | Correct | 0 ms | 1204 KB | Output is correct |
5 | Correct | 0 ms | 1204 KB | Output is correct |
6 | Correct | 0 ms | 1204 KB | Output is correct |
7 | Correct | 0 ms | 1204 KB | Output is correct |
8 | Correct | 0 ms | 1204 KB | Output is correct |
9 | Correct | 0 ms | 1204 KB | Output is correct |
10 | Correct | 0 ms | 1204 KB | Output is correct |
11 | Correct | 0 ms | 1204 KB | Output is correct |
12 | Correct | 3 ms | 1204 KB | Output is correct |
13 | Correct | 3 ms | 1204 KB | Output is correct |
14 | Correct | 3 ms | 1204 KB | Output is correct |
15 | Correct | 6 ms | 1204 KB | Output is correct |
16 | Correct | 3 ms | 1204 KB | Output is correct |
17 | Correct | 9 ms | 1204 KB | Output is correct |
18 | Correct | 9 ms | 1204 KB | Output is correct |
19 | Correct | 16 ms | 1204 KB | Output is correct |
20 | Correct | 9 ms | 1204 KB | Output is correct |