Submission #119201

#	Time	Username	Problem	Language	Result	Execution time	Memory
119201		ioilolcom	Parachute rings (IOI12_rings)	C++14	0 / 100	4014 ms	98020 KiB

rings

#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
typedef long long int ll;
int N;
const int M=1e6+7;
set<int> adj[M];
int deg[M];
void Init(int N_) {
	N = N_;
}

void Link(int A, int B) {
	adj[A].insert(B);
	adj[B].insert(A);
	deg[A]++;
	deg[B]++;
}
bool is(int x){
	for(int v:adj[x]) {
		deg[v]--;
	}
	for(int v=0; v<N; v++) {
		if(v==x) {
			continue;
		}
		if(deg[v]>2) {
			return 0;
		}
	}
	for(int v:adj[x]) {
		deg[v]++;
	}
	return 1;
}
int CountCritical() {
	int ans=0;
	for(int x=0; x<N; x++) ans+=is(x);
	return ans;
}

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