# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
587763 | yutabi | Game (IOI14_game) | C++14 | 412 ms | 25184 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 "game.h"
#include <bits/stdc++.h>
using namespace std;
int N;
int par[1500];
int sz[1500];
int cnt[1500][1500];
int find_parent(int node)
{
if(par[node]==node)
{
return node;
}
return find_parent(par[node]);
}
void make_union(int node1,int node2)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |