# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
672636 | blue | Game (IOI14_game) | C++17 | 1 ms | 212 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;
using vi = vector<int>;
int n;
struct dsu
{
vi par;
vi st;
dsu()
{
par = vi(1500, -1);
st = vi(1500, 1);
for(int i = 0; i < 1500; i++)
par[i] = i;
}
int root(int u)
{
if(par[u] == u)
return u;
else
return (par[u] = root(par[u]));
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |