Submission #39403

#	Time	Username	Problem	Language	Result	Execution time	Memory
39403		adamczh1	낙하산 고리들 (IOI12_rings)	C++14	0 / 100	1137 ms	125836 KiB

rings

#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;
}

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