# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1030927 |
2024-07-22T12:23:17 Z |
tolbi |
Game (IOI14_game) |
C++17 |
|
4 ms |
9308 KB |
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
int par[1500],sz[1500],say[1500][1500];
int find(int node){
if (par[node]==node) return node;
return par[node]=find(par[node]);
}
int n;
void initialize(int n) {
::n=n;
iota(par,par+n,0);
fill(sz,sz+n,1);
memset(say,0,sizeof(say));
}
int hasEdge(int u, int v) {
if (find(u)==find(v)) return 0;
u=find(u);
v=find(v);
if (say[u][v]!=sz[u]*sz[v]-1 && say[v][u]!=sz[u]*sz[v]-1){
say[u][v]++,say[v][u]++;
return 0;
}
//mergelemeye karar verdiysem
if (sz[u]<sz[v]) swap(u,v);
for (int i = 0; i < n; i++){
say[u][find(i)]+=say[v][i];
}
sz[u]+=sz[v];
sz[v]=0;
par[v]=u;
return 1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
9052 KB |
Output is correct |
2 |
Correct |
4 ms |
9052 KB |
Output is correct |
3 |
Correct |
3 ms |
9052 KB |
Output is correct |
4 |
Correct |
4 ms |
9052 KB |
Output is correct |
5 |
Correct |
3 ms |
9052 KB |
Output is correct |
6 |
Correct |
3 ms |
9052 KB |
Output is correct |
7 |
Correct |
3 ms |
9052 KB |
Output is correct |
8 |
Correct |
4 ms |
9160 KB |
Output is correct |
9 |
Correct |
3 ms |
9052 KB |
Output is correct |
10 |
Correct |
3 ms |
9052 KB |
Output is correct |
11 |
Correct |
4 ms |
9052 KB |
Output is correct |
12 |
Correct |
3 ms |
9052 KB |
Output is correct |
13 |
Correct |
3 ms |
9052 KB |
Output is correct |
14 |
Correct |
3 ms |
9052 KB |
Output is correct |
15 |
Correct |
4 ms |
9048 KB |
Output is correct |
16 |
Correct |
3 ms |
9052 KB |
Output is correct |
17 |
Correct |
3 ms |
9124 KB |
Output is correct |
18 |
Correct |
4 ms |
9052 KB |
Output is correct |
19 |
Correct |
4 ms |
9228 KB |
Output is correct |
20 |
Correct |
3 ms |
9048 KB |
Output is correct |
21 |
Correct |
4 ms |
9052 KB |
Output is correct |
22 |
Correct |
3 ms |
9308 KB |
Output is correct |
23 |
Correct |
4 ms |
9264 KB |
Output is correct |
24 |
Correct |
3 ms |
9016 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
9052 KB |
Output is correct |
2 |
Correct |
3 ms |
9052 KB |
Output is correct |
3 |
Correct |
4 ms |
9104 KB |
Output is correct |
4 |
Correct |
3 ms |
9052 KB |
Output is correct |
5 |
Correct |
4 ms |
9052 KB |
Output is correct |
6 |
Correct |
4 ms |
9052 KB |
Output is correct |
7 |
Correct |
3 ms |
9052 KB |
Output is correct |
8 |
Correct |
4 ms |
9052 KB |
Output is correct |
9 |
Correct |
3 ms |
9052 KB |
Output is correct |
10 |
Correct |
3 ms |
9152 KB |
Output is correct |
11 |
Correct |
4 ms |
9052 KB |
Output is correct |
12 |
Correct |
3 ms |
9052 KB |
Output is correct |
13 |
Correct |
4 ms |
9152 KB |
Output is correct |
14 |
Correct |
4 ms |
9052 KB |
Output is correct |
15 |
Correct |
4 ms |
9052 KB |
Output is correct |
16 |
Correct |
4 ms |
9244 KB |
Output is correct |
17 |
Correct |
4 ms |
9048 KB |
Output is correct |
18 |
Correct |
4 ms |
9052 KB |
Output is correct |
19 |
Correct |
3 ms |
9152 KB |
Output is correct |
20 |
Correct |
3 ms |
9052 KB |
Output is correct |
21 |
Correct |
4 ms |
9264 KB |
Output is correct |
22 |
Correct |
3 ms |
9052 KB |
Output is correct |
23 |
Correct |
3 ms |
9052 KB |
Output is correct |
24 |
Correct |
4 ms |
9052 KB |
Output is correct |
25 |
Incorrect |
4 ms |
9140 KB |
Output isn't correct |
26 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
9052 KB |
Output is correct |
2 |
Correct |
4 ms |
9052 KB |
Output is correct |
3 |
Correct |
4 ms |
9052 KB |
Output is correct |
4 |
Correct |
3 ms |
9084 KB |
Output is correct |
5 |
Correct |
3 ms |
9052 KB |
Output is correct |
6 |
Correct |
3 ms |
9052 KB |
Output is correct |
7 |
Correct |
3 ms |
9052 KB |
Output is correct |
8 |
Correct |
4 ms |
9052 KB |
Output is correct |
9 |
Correct |
4 ms |
9052 KB |
Output is correct |
10 |
Correct |
4 ms |
9052 KB |
Output is correct |
11 |
Correct |
3 ms |
9056 KB |
Output is correct |
12 |
Correct |
4 ms |
9052 KB |
Output is correct |
13 |
Correct |
4 ms |
9052 KB |
Output is correct |
14 |
Correct |
3 ms |
9052 KB |
Output is correct |
15 |
Correct |
3 ms |
9052 KB |
Output is correct |
16 |
Correct |
4 ms |
9052 KB |
Output is correct |
17 |
Correct |
3 ms |
9068 KB |
Output is correct |
18 |
Correct |
3 ms |
9052 KB |
Output is correct |
19 |
Correct |
4 ms |
9052 KB |
Output is correct |
20 |
Correct |
3 ms |
9052 KB |
Output is correct |
21 |
Correct |
4 ms |
9052 KB |
Output is correct |
22 |
Correct |
3 ms |
9052 KB |
Output is correct |
23 |
Correct |
4 ms |
9052 KB |
Output is correct |
24 |
Correct |
3 ms |
9052 KB |
Output is correct |
25 |
Incorrect |
4 ms |
9052 KB |
Output isn't correct |
26 |
Halted |
0 ms |
0 KB |
- |