Submission #290910

# Submission time Handle Problem Language Result Execution time Memory
290910 2020-09-04T14:32:39 Z davi_bart Game (IOI14_game) C++17
100 / 100
824 ms 16248 KB
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define ld long double
bool p[1600][1600];
unordered_map<int,int> arc[170];
int rad,N;
int hasEdge(int u, int v) {
    int ga=u/rad,gb=v/rad;
    if(ga==gb){
      p[u][v]=0;
      p[v][u]=0;
      vector<bool> vis(rad+2,0);
      queue<int> q;
      q.push(u);

      while(!q.empty()){
        int pos=q.front();
        q.pop();
        if(pos/rad!=ga)continue;
        if(vis[pos%rad])continue;
        vis[pos%rad]=1;

        for(int i=rad*ga;i<rad*(ga+1);i++){
          if(i>=N)break;
          if(p[pos][i])q.push(i);
        }
        /*auto y=p[pos].lower_bound(rad*ga);
        if(y==p[pos].end())continue;
        while((*y)>=rad*ga && (*y)<rad*(ga+1)){
          q.push(*y);
          y++;
          if(y==p[pos].end())break;
        }*/
      }
      bool ok=1;
      for(int i=0;i<rad;i++){
        if(ga*rad+i>=N)break;
        if(vis[i]==0){
          ok=0;
          break;
        }
      }
      if(ok==0){
        p[u][v]=1;
        p[v][u]=1;
        return 1;
      }
      return 0;
    }
    p[u][v]=0;
    p[v][u]=0;
    arc[ga][gb]--;
    arc[gb][ga]--;
    bool ok=0;
    if(arc[ga][gb]>0)ok=1;
    else{
      arc[ga].erase(gb);
      arc[gb].erase(ga);
    }
    vector<bool> vis(N/rad+2,0);
    queue<int> q;
    q.push(ga);
    while(!q.empty() && ok==0){
      int pos=q.front();
      q.pop();
      if(pos==gb){
        ok=1;
        break;
      }
      if(vis[pos])continue;
      vis[pos]=1;
      for(auto &[k,_]:arc[pos]){
        if(k==gb){
          ok=1;
          break;
        }
        if(vis[k]==0)q.push(k);
      }
    }
    if(ok==0){
      p[u][v]=1;
      p[v][u]=1;
      arc[ga][gb]=1;
      arc[gb][ga]=1;
      return 1;
    }
    return 0;
}
void initialize(int n){
  rad=min(15,n);
  N=n;
  for(int i=0;i<n;i++){
    for(int j=0;j<n;j++){
      p[i][j]=1;
      arc[i/rad][j/rad]++;
    }
  }
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 0 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 3 ms 512 KB Output is correct
35 Correct 4 ms 512 KB Output is correct
36 Correct 3 ms 512 KB Output is correct
37 Correct 3 ms 512 KB Output is correct
38 Correct 3 ms 512 KB Output is correct
39 Correct 3 ms 512 KB Output is correct
40 Correct 3 ms 512 KB Output is correct
41 Correct 4 ms 536 KB Output is correct
42 Correct 4 ms 512 KB Output is correct
43 Correct 3 ms 512 KB Output is correct
44 Correct 3 ms 512 KB Output is correct
45 Correct 4 ms 512 KB Output is correct
46 Correct 3 ms 512 KB Output is correct
47 Correct 4 ms 512 KB Output is correct
48 Correct 3 ms 512 KB Output is correct
49 Correct 4 ms 512 KB Output is correct
50 Correct 4 ms 512 KB Output is correct
51 Correct 3 ms 512 KB Output is correct
52 Correct 3 ms 512 KB Output is correct
53 Correct 4 ms 512 KB Output is correct
54 Correct 3 ms 512 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 1 ms 512 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 0 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 3 ms 512 KB Output is correct
35 Correct 3 ms 512 KB Output is correct
36 Correct 5 ms 512 KB Output is correct
37 Correct 3 ms 512 KB Output is correct
38 Correct 4 ms 640 KB Output is correct
39 Correct 4 ms 512 KB Output is correct
40 Correct 4 ms 512 KB Output is correct
41 Correct 4 ms 512 KB Output is correct
42 Correct 4 ms 512 KB Output is correct
43 Correct 3 ms 512 KB Output is correct
44 Correct 3 ms 512 KB Output is correct
45 Correct 3 ms 512 KB Output is correct
46 Correct 3 ms 512 KB Output is correct
47 Correct 3 ms 512 KB Output is correct
48 Correct 3 ms 512 KB Output is correct
49 Correct 3 ms 512 KB Output is correct
50 Correct 3 ms 512 KB Output is correct
51 Correct 3 ms 512 KB Output is correct
52 Correct 4 ms 512 KB Output is correct
53 Correct 3 ms 512 KB Output is correct
54 Correct 3 ms 512 KB Output is correct
55 Correct 89 ms 1912 KB Output is correct
56 Correct 89 ms 1912 KB Output is correct
57 Correct 89 ms 1916 KB Output is correct
58 Correct 89 ms 1912 KB Output is correct
59 Correct 94 ms 2004 KB Output is correct
60 Correct 92 ms 2168 KB Output is correct
61 Correct 93 ms 1916 KB Output is correct
62 Correct 89 ms 1920 KB Output is correct
63 Correct 91 ms 1912 KB Output is correct
64 Correct 90 ms 2040 KB Output is correct
65 Correct 89 ms 1912 KB Output is correct
66 Correct 91 ms 2040 KB Output is correct
67 Correct 92 ms 2012 KB Output is correct
68 Correct 92 ms 1912 KB Output is correct
69 Correct 89 ms 1912 KB Output is correct
70 Correct 94 ms 2036 KB Output is correct
71 Correct 89 ms 1912 KB Output is correct
72 Correct 90 ms 2000 KB Output is correct
73 Correct 89 ms 1912 KB Output is correct
74 Correct 98 ms 1912 KB Output is correct
75 Correct 95 ms 1912 KB Output is correct
76 Correct 204 ms 3448 KB Output is correct
77 Correct 210 ms 3448 KB Output is correct
78 Correct 226 ms 3448 KB Output is correct
79 Correct 217 ms 3464 KB Output is correct
80 Correct 213 ms 3452 KB Output is correct
81 Correct 204 ms 3580 KB Output is correct
82 Correct 227 ms 3448 KB Output is correct
83 Correct 201 ms 3448 KB Output is correct
84 Correct 202 ms 3448 KB Output is correct
85 Correct 443 ms 6136 KB Output is correct
86 Correct 406 ms 9336 KB Output is correct
87 Correct 409 ms 9208 KB Output is correct
88 Correct 403 ms 9208 KB Output is correct
89 Correct 416 ms 9464 KB Output is correct
90 Correct 428 ms 9336 KB Output is correct
91 Correct 423 ms 9220 KB Output is correct
92 Correct 417 ms 9208 KB Output is correct
93 Correct 419 ms 9208 KB Output is correct
94 Correct 824 ms 16248 KB Output is correct
95 Correct 814 ms 16120 KB Output is correct
96 Correct 816 ms 16120 KB Output is correct
97 Correct 805 ms 16120 KB Output is correct
98 Correct 804 ms 16120 KB Output is correct
99 Correct 811 ms 16120 KB Output is correct
100 Correct 806 ms 16120 KB Output is correct