Submission #680090

#	Time	Username	Problem	Language	Result	Execution time	Memory
680090		GusterGoose27	Potemkin cycle (CEOI15_indcyc)	C++11	40 / 100	178 ms	2052 KiB

indcyc

#include <bits/stdc++.h>

using namespace std;
typedef pair<int, int> pii;

const int MAXN = 1000;
int n, m;
vector<int> edges[MAXN];
int adj[MAXN];
bool vis[MAXN];

bool make_ans(int s, int cur, int msk = 0, int num = 1) {
	msk |= (1 << cur);
	for (int nxt: edges[cur]) {
		if ((1 << nxt) & msk) continue;
		if ((adj[nxt] & msk) == (1 << cur)) {
			if (make_ans(s, nxt, msk, num+1)) {
				cout << (1+cur);
				if (cur != s) cout << ' ';
				return 1;
			}
		}
		else if ((adj[nxt] & msk) == ((1 << cur) | (1 << s))) {
			if (num >= 3) {
				cout << (1+nxt) << ' ' << (1+cur) << ' ';
				return 1;
			}
		}
	}
	return 0;
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(NULL);
	cin >> n >> m;
	for (int i = 0; i < m; i++) {
		int x, y; cin >> x >> y;
		x--; y--;
		edges[x].push_back(y);
		edges[y].push_back(x);
		adj[x] |= (1 << y);
		adj[y] |= (1 << x);
	}
	for (int i = 0; i < n; i++) {
		if (make_ans(i, i)) return 0;
	}
	cout << "no\n";
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 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