# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1145294 | nathan4690 | ICC (CEOI16_icc) | C++20 | 19 ms | 584 KiB |
// ceoi16p1 - ICC
#include <bits/stdc++.h>
#include "icc.h"
using namespace std;
struct DSU{
int n;
vector<int> p,sz;
DSU(){};
DSU(int n): n(n), p(n+1, 0), sz(n+1, 1){
for(int i=1;i<=n;i++) p[i] = i;
}
int find_set(int u){
return (u == p[u] ? u : p[u] = find_set(p[u]));
}
void union_set(int u, int v){
u = find_set(u);
v = find_set(v);
if(u == v) return;
if(sz[u] < sz[v]) swap(u, v);
p[v] = u;
sz[u] += sz[v];
}
};
void run(int N){
DSU dsu = DSU(N);
mt19937 rng(128379878);
for(int eee=1;eee<N;eee++){
int sza, szb, a[N], b[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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |