# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1168029 | Seungni | Game (IOI14_game) | C++20 | 327 ms | 21920 KiB |
#include <bits/stdc++.h>
#include "game.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int N;
int par[3005];
int cnt[3005][3005];
int find(int a)
{
if (par[a] == a) return par[a];
else return par[a] = find(par[a]);
}
void merge(int a, int b)
{
a = find(a), b = find(b);
if (a == b) return;
cnt[a][b] = 0, cnt[b][a] = 0;
set <int> v;
for (int i = 0; i < N; i++)
{
int t = find(i);
v.insert(t);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |