oj.uz

Submission #28133

# Submission time Handle Problem Language Result Execution time Memory
28133 2017-07-15T11:58:27 Z (#1210, xdoju) The City and The Bitcoin (FXCUP2_city) C++11
1 / 1
 9 ms 2024 KB 
#include <cstdio>
#include <queue>
#include <utility>
using namespace std;

bool vs[310][310];
queue<pair<int, int> > q;

int main(){
  int N, M; scanf("%d%d", &M, &N);
  for(int i = 1; i <= N; i++){
    for(int j = 1; j <= M; j++){
      int x; scanf("%d", &x); vs[i][j] = x;
    }
  }

  bool ans = false;
  q.push({1, 1}); vs[1][1] = false;

  while(!q.empty()){
    int x = q.front().first, y = q.front().second; q.pop();

    if(x == N && y == M){ ans = true; break; }

    if(x + 1 <= N && vs[x + 1][y]){
      q.push({x + 1, y}); vs[x + 1][y] = false;
    }
    if(y + 1 <= M && vs[x][y + 1]){
      q.push({x, y + 1}); vs[x][y + 1] = false;
    }
  }

  puts(ans ? "Yes" : "No");
  return 0;
}

Compilation message

city.cpp: In function 'int main()':
city.cpp:10:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int N, M; scanf("%d%d", &M, &N);
                                  ^
city.cpp:13:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
       int x; scanf("%d", &x); vs[i][j] = x;
                             ^

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2024 KB Output is correct
2 Correct 0 ms 2024 KB Output is correct
3 Correct 0 ms 2024 KB Output is correct
4 Correct 0 ms 2024 KB Output is correct
5 Correct 0 ms 2024 KB Output is correct
6 Correct 0 ms 2024 KB Output is correct
7 Correct 0 ms 2024 KB Output is correct
8 Correct 0 ms 2024 KB Output is correct
9 Correct 0 ms 2024 KB Output is correct
10 Correct 0 ms 2024 KB Output is correct
11 Correct 3 ms 2024 KB Output is correct
12 Correct 0 ms 2024 KB Output is correct
13 Correct 3 ms 2024 KB Output is correct
14 Correct 3 ms 2024 KB Output is correct
15 Correct 3 ms 2024 KB Output is correct
16 Correct 6 ms 2024 KB Output is correct
17 Correct 9 ms 2024 KB Output is correct
18 Correct 9 ms 2024 KB Output is correct
19 Correct 6 ms 2024 KB Output is correct
20 Correct 6 ms 2024 KB Output is correct