oj.uz

답안 #28093

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
28093 2017-07-15T10:29:31 Z Shocking Hot(#1201, khsoo01) 도시와 비트코인 (FXCUP2_city) C++14
1 / 1
 13 ms 2384 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

city.cpp: In function 'int main()':
city.cpp:15:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&m,&n);
                     ^
city.cpp:18:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d",&a[i][j]);
                        ^

Subtask #1
1.0 / 1.0

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