| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 162115 | ioane | Game (IOI14_game) | C++14 | 0 ms | 0 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 "grader.h"
#include<bits/stdc++.h>
#define LL int
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define I insert
#define Max(a,b) ((b<a)?a:b)
#define Min(a,b) ((a<b)?a:b)
const LL N = 1503, mod = 1000000007;
using namespace std;
LL n, m, i, j, k, l, r, t, ans;
LL fix[N], a[N][N];
vector < LL > g[N];
void initialize ( LL nn ){
n = nn;
for ( LL i = 0; i < n; ++i ){
fix[i] = i;
g[i].PB(i);
}
}
LL hasEdge ( LL u, LL v ){
LL x = fix[u];
LL y = fix[v];