# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
28196 | lyzqm123 (#71) | The City and The Bitcoin (FXCUP2_city) | C++98 | 0 ms | 1824 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
int N, M;
int map[301][301];
int go[301][301];
int main() {
scanf("%d%d", &M, &N);
for (int n = 0;n < N;n++)
for (int m = 0;m < M;m++)
scanf("%d", &map[n][m]);
go[0][0] = 1;
for (int n = 0;n < N;n++) {
for (int m = 0;m < M;m++) {
if (go[n][m]) {
if (n + 1 < N && map[n+1][m])
go[n + 1][m] = 1;
if (m + 1 < M && map[n][m+1])
go[n][m + 1] = 1;
}
}
}
for (int n = 0;n < N;n++) {
for (int m = 0;m < M;m++)
printf("%d ", go[n][m]);
printf("\n");
}
if (go[N - 1][M - 1])
printf("YES\n");
else
printf("NO\n");
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |