제출 #39402

#제출 시각아이디문제언어결과실행 시간메모리
39402adamczh1낙하산 고리들 (IOI12_rings)C++14
0 / 100
1209 ms122344 KiB
#include <bits/stdc++.h> using namespace std; int N; int deg[1000000]; void Init(int N_) { N = N_; } set<int> adj[1000000]; set<int> s; void Link(int A, int B) { adj[A].insert(B), adj[B].insert(A); deg[A]++, deg[B]++; if(deg[A]>=2) s.insert(A); if(deg[B]>=2) s.insert(B); } int CountCritical() { int res=0; for(int i=0;i<N;i++){ int ok=1; for(int v:s){ if(i!=v && adj[i].find(v)==adj[i].end()){ ok=0; break; } } res+=ok; } 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...