Submission #1192728

#TimeUsernameProblemLanguageResultExecution timeMemory
1192728alexddParachute rings (IOI12_rings)C++20
0 / 100
3 ms5188 KiB
#include <bits/stdc++.h> using namespace std; int n,cntrele; vector<int> con[200005]; void Init(int N_) { assert(n==0); n = N_; } void Link(int A, int B) { con[A].push_back(B); con[B].push_back(A); if(con[A].size() == 3) cntrele++; if(con[B].size() == 3) cntrele++; } int CountCritical() { int rez=0; for(int i=0;i<n;i++) { int cnt=0; if(con[i].size() > 2) cnt++; for(int adj:con[i]) if(con[adj].size() > 2) cnt++; if(cnt==cntrele) rez++; } return rez; }
#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...