# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
476967 |
2021-09-29T12:35:33 Z |
JovanB |
Game (IOI14_game) |
C++17 |
|
1 ms |
332 KB |
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 1500;
struct DSU{
int n;
int par[N+5];
int edg[N+5][N+5];
int outs[N+5];
int sz[N+5];
void init(int _n){
n = _n;
for(int i=1; i<=n; i++){
par[i] = i;
sz[i] = 1;
outs[i] = 0;
for(int j=1; j<=n; j++){
edg[i][j] = 0;
}
}
}
int root(int x){ return (par[x] == x ? x : par[x] = root(par[x])); }
bool povezi(int a, int b){
a = root(a);
b = root(b);
if(a == b) return 1;
if(sz[a] < sz[b]) swap(a, b);
if(outs[a] != sz[a]*(n - sz[a]) - 1 && outs[b] != sz[b]*(n - sz[b]) - 1){
outs[a]++, outs[b]++;
edg[a][b]++, edg[b][a]++;
return 0;
}
outs[a] -= edg[a][b];
outs[b] -= edg[a][b];
for(int i=1; i<=n; i++) edg[a][i] += edg[b][i], edg[i][a] += edg[i][b];
outs[a] += outs[b];
sz[a] += sz[b];
par[b] = a;
return 1;
}
} dsu;
void initialize(int _n) {
dsu.init(_n);
}
int hasEdge(int u, int v) {
return dsu.povezi(u + 1, v + 1);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
304 KB |
Output is correct |
4 |
Incorrect |
1 ms |
308 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
0 ms |
304 KB |
Output is correct |
4 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
0 ms |
332 KB |
Output is correct |
4 |
Incorrect |
0 ms |
332 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |