# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
596019 | proma | Parachute rings (IOI12_rings) | C++17 | 4099 ms | 30776 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;
int n, cnt = 0;
vector <int> deg;
vector <vector <int>> g;
void Init(int N_) {
n = N_;
deg.resize(n, 0);
g.resize(n);
}
void Link(int A, int B) {
deg[A] ++;
deg[B] ++;
g[A].push_back(B);
g[B].push_back(A);
if (deg[A] == 3) cnt ++;
if (deg[B] == 3) cnt ++;
}
int CountCritical() {
int res = 0;
for (int v = 0; v < n; v ++) {
int cur = 0;
deg[v] = 0;
for (auto i: g[v]) {
deg[i] --;
}
int flag = 1;
for (int i = 0; i < n; i ++) {
if (deg[i] > 2) flag = 0;
}
res += flag;
deg[v] = g[v].size();
for (auto i: g[v]) {
deg[i] ++;
}
}
return res;
}
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... |