Submission #464941

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
464941	2021-08-14 14:13:37	MKutayBozkurt	Game (eJOI20_game)	C++14	0 / 100	3 ms	344 KiB

game

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
 
int n, m;
vector<vector<int>> v;
vector<vector<int>> vis;
 
 
int bfs(pair<int, int> p) {
  queue<pair<int, pair<int, int>>> q;
  q.push({p.first, {p.second, 0}});
  vector<vector<int>> vis2(2 * n + 1, vector<int>(2 * m + 1));
  while (q.size()) {
    int x = q.front().first;
    int y = q.front().second.first;
    int z = q.front().second.second;
    q.pop();
    if (x < 0 || y < 0 || x >= 2 * n + 1 || y >= 2 * m + 1 || vis2[x][y] || v[x][y]) continue;
    vis2[x][y] = 1;
    q.push({x - 1, {y, z + 1}});
    q.push({x + 1, {y, z + 1}});
    q.push({x, {y - 1, z + 1}});
    q.push({x, {y + 1, z + 1}});
  }
  int ans = 0;
  for (int i = 0; i < 2 * n + 1; i++) {
    for (int j = 0; j < 2 * m + 1; j++) {
      ans += vis2[i][j];
      vis[i][j] |= vis2[i][j];
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 20
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 20