# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1160875 | JahonaliX | Game (IOI14_game) | C++20 | 1096 ms | 2232 KiB |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
struct dsu {
int n;
vector<int> p, c;
dsu() {}
dsu(int m) {
n = m;
p.assign(n, 0);
c.assign(n, 1);
iota(p.begin(), p.end(), 0);
}
int find(int x) {
if (x == p[x]) return x;
return p[x] = find(p[x]);
}
void merge(int a, int b) {
p[b] = a;
c[a] += c[b];
}
};
int n;
dsu d;
vector<vector<bool>> vis;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |