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;
const int lim = 1505;
int n, p[lim], sz[lim], cnt[lim][lim];
int find_set(int n){
return n == p[n] ? n : p[n] = find_set(p[n]);
}
void merge(int a, int b){
if(sz[a = find_set(a)] < sz[b = find_set(b)]){
swap(a, b);
}
sz[p[b] = a] += sz[b];
for(int i = 0; i < n; i++){
cnt[a][i] += cnt[b][i];
cnt[i][a] += cnt[b][i];
}
}
void initialize(int N){
iota(p, p + (n = N), 0);
fill(sz, sz + n, 1);
memset(cnt, 0, sizeof(cnt));
}
int hasEdge(int u, int v){
if(sz[u = find_set(u)] * sz[v = find_set(v)] - 1 == cnt[u][v]){
merge(u, v);
return 1;
}
cnt[u][v]++;
cnt[v][u]++;
return 0;
}
Compilation message (stderr)
game.cpp: In function 'int hasEdge(int, int)':
game.cpp:25:32: warning: operation on 'v' may be undefined [-Wsequence-point]
25 | if(sz[u = find_set(u)] * sz[v = find_set(v)] - 1 == cnt[u][v]){
| ~~^~~~~~~~~~~~~
game.cpp:25:32: warning: operation on 'v' may be undefined [-Wsequence-point]
game.cpp:25:10: warning: operation on 'u' may be undefined [-Wsequence-point]
25 | if(sz[u = find_set(u)] * sz[v = find_set(v)] - 1 == cnt[u][v]){
| ~~^~~~~~~~~~~~~
game.cpp:25:10: warning: operation on 'u' may be undefined [-Wsequence-point]
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |