# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
259370 | Sorting | Parachute rings (IOI12_rings) | C++17 | 2025 ms | 118996 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 <bits/stdc++.h>
using namespace std;
const int k_N = 1e6 + 3;
struct DSU{
int p[k_N], sz[k_N];
int d[k_N];
int cycles_all, mx_all;
int cycle_node;
DSU(){
}
void update_d(int u){
d[u]++;
}
void resize(int n){
cycles_all = 0;
mx_all = 0;
cycle_node = -1;
for(int i = 0; i < n; ++i){
p[i] = i;
sz[i] = 1;
d[i] = 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |