# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
120841 |
2019-06-25T16:04:07 Z |
Plurm |
Game (IOI14_game) |
C++11 |
|
4 ms |
384 KB |
#include "game.h"
#include <cstring>
int p[1500];
int f(int u){
if(p[u] == -1) return u;
else return p[u] = f(p[u]);
}
void u(int x, int y){
x = f(x);
y = f(y);
if(x == y) return;
p[x] = y;
}
int e;
void initialize(int n) {
memset(p, -1, sizeof(p));
e = n-2;
}
int hasEdge(int u, int v) {
if(f(u) == f(v)){
return 1;
}else if(e > 0){
e--;
::u(u,v);
return 1;
}else{
return 0;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
384 KB |
Output is correct |
2 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
256 KB |
Output is correct |
2 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |