# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
30440 | 2017-07-23T11:01:59 Z | kavun | Game (IOI14_game) | C++14 | 0 ms | 26496 KB |
#include "game.h" #include <bits/stdc++.h> using namespace std; int N, cc[2000], ccsize[2000], asked[2000][2000]; vector <int> ver[2000]; void initialize(int n) { N = n; for(int i = 0; i < n; i++) cc[i] = i, ver[i].push_back(i), ccsize[i]++; } int hasEdge(int u, int v) { if(cc[u] == cc[v]) return 1; if(asked[cc[u]][cc[v]] == ccsize[cc[u]]*ccsize[cc[v]]-1) { ccsize[v] += ccsize[u]; int othercc = cc[u]; for(int i = 0; i < ver[othercc].size(); i++) ver[cc[v]].push_back(ver[othercc][i]),cc[ver[othercc][i]] = cc[v]; return 1; } else { asked[cc[u]][cc[v]]++; asked[cc[v]][cc[u]]++; return 0; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 26496 KB | Output is correct |
2 | Correct | 0 ms | 26496 KB | Output is correct |
3 | Correct | 0 ms | 26496 KB | Output is correct |
4 | Correct | 0 ms | 26496 KB | Output is correct |
5 | Correct | 0 ms | 26496 KB | Output is correct |
6 | Correct | 0 ms | 26496 KB | Output is correct |
7 | Incorrect | 0 ms | 26496 KB | Output isn't correct |
8 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 26496 KB | Output is correct |
2 | Correct | 0 ms | 26496 KB | Output is correct |
3 | Correct | 0 ms | 26496 KB | Output is correct |
4 | Correct | 0 ms | 26496 KB | Output is correct |
5 | Correct | 0 ms | 26496 KB | Output is correct |
6 | Correct | 0 ms | 26496 KB | Output is correct |
7 | Incorrect | 0 ms | 26496 KB | Output isn't correct |
8 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 26496 KB | Output is correct |
2 | Correct | 0 ms | 26496 KB | Output is correct |
3 | Correct | 0 ms | 26496 KB | Output is correct |
4 | Correct | 0 ms | 26496 KB | Output is correct |
5 | Correct | 0 ms | 26496 KB | Output is correct |
6 | Correct | 0 ms | 26496 KB | Output is correct |
7 | Incorrect | 0 ms | 26496 KB | Output isn't correct |
8 | Halted | 0 ms | 0 KB | - |