# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
759415 | DJeniUp | Game (IOI14_game) | C++17 | 1036 ms | 11248 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;
typedef int ll;
typedef pair<ll,ll>pairll;
#define fr first
#define sc second
ll p[1507],f[1507],d[1507][1507];
set<pairll>s;
ll n,m,g;
ll P(ll x){
if(p[x]!=x)p[x]=P(p[x]);
return p[x];
}
void A(ll x,ll y){
if(rand()%2)swap(x,y);
x=P(x);
y=P(y);
p[y]=x;
return ;
}
void initialize(int N) {
n=N;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |