Submission #760837

#	Time	Username	Problem	Language	Result	Execution time	Memory
760837		a_aguilo	Potemkin cycle (CEOI15_indcyc)	C++14	10 / 100	1081 ms	4600 KiB

indcyc

#include<bits/stdc++.h>

using namespace std;

vector<vector<int>> AdjMatrix;
vector<int> component;
int numNodes, numEdges, N, R;

void outputCompt(int node, int prev, int start){
	cout << node+1 << " ";
	for(int other: component){
		if(other == node) continue;
		if(other == start) continue;
		if(other == prev) continue;
		if(AdjMatrix[node][other] == 0) {
			//cout << node << "-> " << other << endl;
			outputCompt(other, node, start);
			return;
		}
	}
}

int main(){
	int a, b;
	cin >> N >> R;
	AdjMatrix = vector<vector<int>> (N, vector<int>(N, 1));
	int sol = -1;
	int first = -1;
	for(int i = 0; i < R; ++i){
		cin >> a >> b;
		a--; b--;
		AdjMatrix[a][b] = AdjMatrix[b][a] = 0;
	}
	for(int mask = 1; (mask < (1 << N)) and (sol == -1); ++mask){
		numEdges = 0;
		numNodes = __builtin_popcount(mask);
		if(numNodes > 3){
			bool possible = true;
			for(int i = 0; i < N; ++i){
				if(mask & (1 << i)){
					int cnt = 0;
					for(int j = 0; j < N; ++j){
						if(i == j) continue;
						//cout << mask << " " << i <<" " << j << endl;
						if(mask & (1 << j))cnt+= AdjMatrix[i][j];
					}
					if(cnt != numNodes-3) possible = false;
				}
			}
			if(possible) sol = mask;
		}
	}
	if(sol == -1) cout << sol << endl;
	else{
		//cout << sol << endl;
		for(int i = 0; i < N; ++i){
			if(sol & (1 << i)) {
				component.push_back(i);
				//cout << i << endl;
				first = i;
			}
		}
		outputCompt(first, -1, first);
		cout << endl;
	}
	return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 10 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10