Submission #119197

#	Time	Username	Problem	Language	Result	Execution time	Memory
119197		ioilolcom	Parachute rings (IOI12_rings)	C++14	0 / 100	4034 ms	97952 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]++;
}

int CountCritical() {
	int ans=0;
	for(int i=0; i<N; i++) {
		int tmp=deg[i];
		int cnt=0;
		deg[i]=0;
		for(int j=0; j<N; j++) {
			if(adj[i].count(j)) {
				deg[j]--;
			}
		}
		for(int j=0; j<N; j++) {
			if(deg[j]>=3) {
				cnt++;
			}
		}
		deg[i]=tmp;
		for(int v:adj[i]) {
			deg[v]++;
		}
		ans+=(!cnt);
	}
	return ans;
}

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