Submission #624588

#	Time	Username	Problem	Language	Result	Execution time	Memory
624588		moyindavid	낙하산 고리들 (IOI12_rings)	C++17	0 / 100	1 ms	596 KiB

rings

#include <bits/stdc++.h>
using namespace std;

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++){
        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;

}

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