| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 847575 | 12345678 | 게임 (IOI14_game) | C++17 | 1031 ms | 6240 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;
const int nx=1505;
int N, dsu[nx];
vector<vector<int>> d(nx);
bool q[nx][nx];
int find(int x)
{
if (dsu[x]==x) return x;
return dsu[x]=find(dsu[x]);
}
void initialize(int n) {
for (int i=0; i<n; i++) dsu[i]=i, d[i].push_back(i);
N=n;
}
int hasEdge(int u, int v) {
q[u][v]=q[v][u]=1;
int pu=find(u), pv=find(v);
if (pu==pv) return 0;
int cnt=0;
for (auto x:d[pu]) for (auto y:d[pv]) if (q[x][y]) cnt++;
if (cnt==d[pu].size()*d[pv].size())
{
dsu[pu]=pv;
for (auto x:d[pu]) d[pv].push_back(x);
return 1;
}
else return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
