Submission #596001

#TimeUsernameProblemLanguageResultExecution timeMemory
596001promaParachute rings (IOI12_rings)C++17
0 / 100
822 ms58948 KiB
#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; if (deg[v] > 2) cur ++; for (auto i: g[v]) { if (deg[i] == 3) cur ++; } if (cur == cnt) res ++; } return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...