# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
50109 | top34051 | Parachute rings (IOI12_rings) | C++17 | 4030 ms | 94848 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 maxn = 1e6 + 5;
int n;
vector<int> way[maxn];
vector<int> deg[10];
int cut[maxn];
int sz, cy, vis[maxn];
stack<int> st;
int ok[maxn];
void Init(int _n) {
n = _n;
}
void cycle(int u, int last, int ban) {
if(vis[u]) {
while(!st.empty()) {
int v = st.top(); st.pop();
sz++;
if(v==u) break;
}
cy++;
return ;
}
vis[u] = 1; st.push(u);
for(auto v : way[u]) {
if(v!=ban && v!=last && vis[v]<2) {
# | 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... |