# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
28098 | 2017-07-15T10:36:06 Z | tlwpdus 팬클럽 회장(#1197, kdh9949) | 도시와 비트코인 (FXCUP2_city) | C++14 | 0 ms | 2728 KB |
#include <bits/stdc++.h> using namespace std; int n, m, a[301][301], can[301][301]; int main(){ scanf("%d%d", &n, &m); 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
# | 결과 | 실행 시간 | 메모리 | 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 | Incorrect | 0 ms | 2728 KB | Output isn't correct |
11 | Halted | 0 ms | 0 KB | - |