162572025-04-16 17:31:30algoproKét csoportcpp17Time limit exceeded 15/100402ms26300 KiB
// UUID: e7b5f841-2c9b-4a08-a963-e05cd4e56be4
#include <bits/stdc++.h>
#include <ios>
using namespace std;

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int n; cin>>n;
	vector<vector<int>> ellensegek(n+1);
	vector<int> hany(n+1);
	vector<bool> csop(n+1);
	for(int i=1; i<=n; ++i)
	{
		int x;
		while((cin >> x) && x)
		{
			ellensegek[i].push_back(x);
			hany[i]++;
		}
	}
	queue<int> rosszak;
	for(int i=1; i<=n; ++i) if(hany[i]>1) rosszak.push(i);
	while(!rosszak.empty())
	{
		int v=rosszak.front();
		rosszak.pop();
		for(int x:ellensegek[v])
		{
			if(csop[x]!=csop[v]) {hany[x]++, hany[v]++;}
			else {hany[x]--, hany[v]--;}
			if(hany[x]>1) rosszak.push(x);
		}
		csop[v]=!csop[v];
	}
	cout<<count(csop.begin(), csop.end(), 1)<<endl;
	for(int i=1; i<=n; ++i) if(csop[i]) cout<<i<<' ';
}
SubtaskSumTestVerdictTimeMemory
base15/100
1Accepted0/01ms500 KiB
2Time limit exceeded0/0377ms12216 KiB
3Accepted3/31ms316 KiB
4Accepted3/31ms316 KiB
5Accepted3/31ms316 KiB
6Accepted3/31ms316 KiB
7Accepted3/31ms316 KiB
8Time limit exceeded0/2379ms11192 KiB
9Time limit exceeded0/3400ms8280 KiB
10Time limit exceeded0/3400ms8336 KiB
11Time limit exceeded0/3384ms11700 KiB
12Time limit exceeded0/3379ms8632 KiB
13Time limit exceeded0/3400ms8876 KiB
14Time limit exceeded0/3400ms12156 KiB
15Time limit exceeded0/6384ms12216 KiB
16Time limit exceeded0/7386ms12472 KiB
17Time limit exceeded0/7382ms15884 KiB
18Time limit exceeded0/6384ms17460 KiB
19Time limit exceeded0/6384ms17464 KiB
20Time limit exceeded0/6381ms20816 KiB
21Time limit exceeded0/6400ms23096 KiB
22Time limit exceeded0/7402ms23736 KiB
23Time limit exceeded0/7388ms26300 KiB
24Time limit exceeded0/7386ms26296 KiB