# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
24151 | Hiasat | Parachute rings (IOI12_rings) | C++14 | 2757 ms | 118500 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 MX = 1000001;
const int CHAIN = 0;
const int CYCLE = 1;
const int THREE = 2;
const int BIG = 3;
const int BLOCKED = 4;
int dsu[1000001],last[10], E[1000001], freq[1000001][5], sz[1000001], in[1000001], big[1000001][5], vis[1000001], type[1000001], pre[1000001], vsId, N;
vector<int> adj[1000001];
bool block[1000001];
int res = 0,ff2[10];
bool ZERO = 0;
int find(int u) {
return dsu[u] == u ? u : dsu[u] = find(dsu[u]);
}
void Init(int N_) {
N = N_;
for (int i = 0; i < N; ++i) {
dsu[i] = i;
freq[i][0] = 1;
pre[i] = 1;
res += pre[i];
E[i] = 0;
sz[i] = 1;
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... |