# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1009017 | Rifal | Parachute rings (IOI12_rings) | C++14 | 4024 ms | 47208 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>
//#include "rings.h"
using namespace std;
const int N = 1e6 + 5;
int n;
int cnt = 0;
vector<int> v[N];
int deg[N], nod;
int sum = 0;
bool vis[N], cy;
void dfs(int s, int p) {
vis[s] = 1;
for(auto i : v[s]) {
if(i != p && i != nod) {
if(vis[i] == 1) {
cy = false;
}
else {
dfs(i,s);
}
}
}
}
void Init(int N_) {
n = N_;
}
void Link(int A, int B) {
deg[A]++; deg[B]++;
if(deg[A] > 2) cnt++;
# | 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... |