제출 #1009072

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1009072		erering	낙하산 고리들 (IOI12_rings)	C++17	20 / 100	4088 ms	41040 KiB

rings

#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define ll long long
const long long inf=1e18;
const int MOD=998244353;
const int N=1e6+5;
vector<int> adj[N];
int n;
bool vis[N];
struct info{
    int one;
    int mx;
};
info dfs(int node,int par,int kr){
    vis[node]=1;
    info rt; rt.one=0; rt.mx=0;
    int bad=0;
    for(auto i:adj[node]){
        if(i!=kr)bad++;
        if(vis[i])continue;
        info s=dfs(i,node,kr);
        rt.one+=s.one;
        rt.mx=max(rt.mx,s.mx);
    }
    if(bad==1)rt.one+=1;
    rt.mx=max(rt.mx,bad);
    return rt;
}
void Init(int N){
    n=N;
}
void Link(int A, int B){
    A++; B++;
    adj[A].pb(B);
    adj[B].pb(A);
}
int CountCritical(){
    for(int i=1;i<=n;i++)vis[i]=0;
    int ans=0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++)vis[j]=0;
        vis[i]=1;
        bool flag=1;
        for(int j=1;j<=n;j++){
            if(!vis[j]){
                info yes=dfs(j,0,i);
                if(yes.mx==0)continue;
                if(yes.mx>=3 || yes.one!=2)flag=0;
            }
        }
        if(flag){
            ans++;
        }
    }
    return ans;
}

• Subtask 1: 20 / 20
• Subtask 2: 0 / 17
• Subtask 3: 0 / 18
• Subtask 4: 0 / 14
• Subtask 5: 0 / 31