This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "game.h"
#include<bits/stdc++.h>
using namespace std;
int br[1501][1501];
vector<int> dsu(1501);
int k;
int calc(int a) {
while(dsu[a] != a) {
a = dsu[a];
}
return a;
}
void initialize(int n) {
k = n;
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) {
br[i][j] = 1;
}
}
for(int i = 0; i < n; i++) {
dsu[i] = i;
}
}
int hasEdge(int u, int v) {
int a = calc(u),b = calc(v);
if(br[a][b] == 1) {
br[a][b] = 0;
br[b][a] = 0;
dsu[b] = a;
for(int i = 0; i < k; i++) {
br[a][i] = br[a][i]+br[b][i];
br[i][a] = br[a][i];
}
return 1;
}
else {
br[a][b]--;
br[b][a]--;
return 0;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |