# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
28100 | 2017-07-15T10:36:53 Z | tlwpdus 팬클럽 회장(#1197, kdh9949) | The City and The Bitcoin (FXCUP2_city) | C++14 | 13 ms | 2728 KB |
#include <bits/stdc++.h> using namespace std; int n, m, a[301][301], can[301][301]; 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); } } can[1][1] = 1; for(int i = 1; i <= n; i++){ for(int j = 1 + (i == 1); j <= m; j++){ if(a[i][j]) can[i][j] = can[i][j - 1] || can[i - 1][j]; } } puts(can[n][m] ? "Yes" : "No"); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2728 KB | Output is correct |
2 | Correct | 0 ms | 2728 KB | Output is correct |
3 | Correct | 0 ms | 2728 KB | Output is correct |
4 | Correct | 0 ms | 2728 KB | Output is correct |
5 | Correct | 0 ms | 2728 KB | Output is correct |
6 | Correct | 0 ms | 2728 KB | Output is correct |
7 | Correct | 0 ms | 2728 KB | Output is correct |
8 | Correct | 0 ms | 2728 KB | Output is correct |
9 | Correct | 0 ms | 2728 KB | Output is correct |
10 | Correct | 0 ms | 2728 KB | Output is correct |
11 | Correct | 0 ms | 2728 KB | Output is correct |
12 | Correct | 3 ms | 2728 KB | Output is correct |
13 | Correct | 3 ms | 2728 KB | Output is correct |
14 | Correct | 3 ms | 2728 KB | Output is correct |
15 | Correct | 3 ms | 2728 KB | Output is correct |
16 | Correct | 6 ms | 2728 KB | Output is correct |
17 | Correct | 9 ms | 2728 KB | Output is correct |
18 | Correct | 13 ms | 2728 KB | Output is correct |
19 | Correct | 9 ms | 2728 KB | Output is correct |
20 | Correct | 9 ms | 2728 KB | Output is correct |