# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
344821 | 79brue | Game (IOI14_game) | C++14 | 2 ms | 512 KiB |
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 <bits/stdc++.h>
#include "game.h"
using namespace std;
typedef long long ll;
int n;
int par[1502];
int cnt[1502];
int sum[1502];
int queryCount;
int find(int x){
if(x==par[x]) return x;
return par[x] = find(par[x]);
}
void merge(int x, int y){
sum[find(x)] -= y, sum[find(y)] -= x;
x = find(x), y = find(y);
cnt[x]--, cnt[y]--;
par[x] = y;
sum[y] += sum[x];
cnt[y] += cnt[x];
sum[x] = cnt[x] = 0;
}
void initialize(int N){
n = N;
for(int i=0; i<n; i++) par[i] = i;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |