oj.uz

답안 #28108

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
28108 2017-07-15T10:53:27 Z EyeOfSol(#1198, tlwpdus) 도시와 비트코인 (FXCUP2_city) C++11
1 / 1
 16 ms 2768 KB 
#include <bits/stdc++.h>

using namespace std;

int mat[310][310];
int dyn[310][310];

int main() {
    int n, m;

    scanf("%d%d",&n,&m);
    swap(n,m);
    int i, j;
    for (i=0;i<n;i++) for (j=0;j<m;j++) scanf("%d",&mat[i][j]);
    dyn[n-1][m-1] = 1;
    for (i=n-1;i>=0;i--) {
		for (j=m-1;j>=0;j--) {
			if (i==n-1&&j==m-1) continue;
			dyn[i][j] = (mat[i][j])&&(dyn[i+1][j]||dyn[i][j+1]);
		}
    }
    if (dyn[0][0]) printf("Yes\n");
    else printf("No\n");

    return 0;
}

Compilation message

city.cpp: In function 'int main()':
city.cpp:11:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&m);
                        ^
city.cpp:14:63: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (i=0;i<n;i++) for (j=0;j<m;j++) scanf("%d",&mat[i][j]);
                                                               ^

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2768 KB Output is correct
2 Correct 0 ms 2768 KB Output is correct
3 Correct 0 ms 2768 KB Output is correct
4 Correct 0 ms 2768 KB Output is correct
5 Correct 0 ms 2768 KB Output is correct
6 Correct 0 ms 2768 KB Output is correct
7 Correct 0 ms 2768 KB Output is correct
8 Correct 0 ms 2768 KB Output is correct
9 Correct 0 ms 2768 KB Output is correct
10 Correct 0 ms 2768 KB Output is correct
11 Correct 3 ms 2768 KB Output is correct
12 Correct 3 ms 2768 KB Output is correct
13 Correct 3 ms 2768 KB Output is correct
14 Correct 6 ms 2768 KB Output is correct
15 Correct 9 ms 2768 KB Output is correct
16 Correct 6 ms 2768 KB Output is correct
17 Correct 6 ms 2768 KB Output is correct
18 Correct 16 ms 2768 KB Output is correct
19 Correct 9 ms 2768 KB Output is correct
20 Correct 16 ms 2768 KB Output is correct