# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1051482 | abczz | Parachute rings (IOI12_rings) | C++17 | 1411 ms | 187932 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 <iostream>
#include <map>
#include <vector>
#define ll long long
using namespace std;
map <ll, ll> mp;
vector <ll> adj[1000000], V;
ll n, x, y, tot, P[1000000], cyc[1000000], deg[1000000];
ll dsu(ll u) {
if (P[u] == u) return u;
else return P[u] = dsu(P[u]);
}
void Init(int N_) {
n = N_;
tot = 0;
mp.clear();
for (int i=0; i<n; ++i) {
adj[i].clear();
P[i] = i;
++mp[i];
}
}
bool dfs(ll u, ll p, ll x) {
bool res = 0;
for (auto v : adj[u]) {
if (v != p) {
if (v != x && V.empty()) res |= dfs(v, u, x);
# | 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... |