# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
624585 | moyindavid | Parachute rings (IOI12_rings) | C++17 | 0 ms | 0 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>
int N;
vector<int> v[2000];
int sz[2000]{0};
void Init(int N_) {
N = N_;
}
void Link(int A, int B) {
v[A].push_back(B);
v[B].push_back(A);
//sz[A]++;sz[B]++;
}
int CountCritical() {
int ans=0;
for(int i=0;i<N;i++){
/*cnt=0;
if(sz[i]>2)cnt++;
for(auto u: v[i]){
if(sz[u]==3)cnt++;
}
if(cnt==rem)ans++;*/
for(int j=0;j<N;j++){
if(j==i)continue;
queue<int> q;q.push(j);
bool vis[N]{0}, flag=0;
while(!q.empty()){
int a=q.front();q.pop();
int cnt=0;
for(auto u: v[a]){
if(u==i)continue;
if(vis[u]==1)cnt++;
if(cnt>1 || v[a].size()>3){
flag=true;
break;
}
}
if(flag)break;
}
if(flag){
ans--;
break;
}
}
ans++;
}
return ans;
}