Submission #961850

#	Time	Username	Problem	Language	Result	Execution time	Memory
961850		NK_	Povjerenstvo (COI22_povjerenstvo)	C++17	0 / 100	233 ms	108840 KiB

Main

// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>

using namespace std;

#define nl '\n'
#define pb push_back
#define sz(x) int(x.size())

template<class T> using V = vector<T>;
using vi = V<int>;

int main() {
	cin.tie(0)->sync_with_stdio(0);
	
	int N, M; cin >> N >> M;

	V<vi> radj(N); vi out(N), dead(N);
	set<int> left; for(int i = 0; i < N; i++) left.insert(i);

	vi q; 
	auto rem = [&](int u) {
		left.erase(u);
		for(auto& v : radj[u]) if (!dead[v]) {
			out[v]--;
			if (out[v] == 0) q.pb(v);
		}
	};

	for(int i = 0; i < M; i++) {
		int u, v; cin >> u >> v; --u, --v;
		radj[v].pb(u); out[u]++;
	}

	for(int i = 0; i < N; i++) if (out[i] == 0) q.pb(i);

	vi ans;
	while(sz(left)) {
		int u; 
		if (sz(q)) { 
			u = q.back(); q.pop_back(); 
		} else u = *begin(left);

		// cout << u << endl;

		assert(!dead[u]);

		dead[u] = 1;
		for(auto& v : radj[u]) dead[v] = 1;

		ans.pb(u);
		for(auto& v : radj[u]) rem(v);
	}

	cout << sz(ans) << nl;
	for(auto& x : ans) cout << x + 1 << " ";
	cout << nl;



	exit(0-0);
}

• Subtask 1: 0 / 13
• Subtask 2: 0 / 21
• Subtask 3: 0 / 33
• Subtask 4: 0 / 33