162552025-04-16 17:30:53algoproKét csoportcpp17Time limit exceeded 15/100400ms20288 KiB
// UUID: 301cd251-2ca3-4e64-9742-b17dfad3fad6
#include <bits/stdc++.h>
using namespace std;

int main() {
	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/01ms316 KiB
2Time limit exceeded0/0400ms11456 KiB
3Accepted3/31ms508 KiB
4Accepted3/31ms316 KiB
5Accepted3/31ms316 KiB
6Accepted3/31ms508 KiB
7Accepted3/31ms316 KiB
8Time limit exceeded0/2400ms11340 KiB
9Time limit exceeded0/3377ms7608 KiB
10Time limit exceeded0/3384ms7608 KiB
11Time limit exceeded0/3381ms11192 KiB
12Time limit exceeded0/3389ms8380 KiB
13Time limit exceeded0/3384ms8124 KiB
14Time limit exceeded0/3381ms10908 KiB
15Time limit exceeded0/6386ms11060 KiB
16Time limit exceeded0/7388ms11316 KiB
17Time limit exceeded0/7384ms13752 KiB
18Time limit exceeded0/6386ms15408 KiB
19Time limit exceeded0/6381ms15412 KiB
20Time limit exceeded0/6377ms16960 KiB
21Time limit exceeded0/6386ms20288 KiB
22Time limit exceeded0/7391ms20288 KiB
23Time limit exceeded0/7388ms17728 KiB
24Time limit exceeded0/7381ms17728 KiB