168112025-05-13 17:38:47algoproKét csoportcpp17Wrong answer 15/100358ms8500 KiB
// UUID: a51971c3-821a-4c19-a963-2e62296ae8c4
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;
	cin >> n;
	vector<array<int, 4>> opps(n);
	vector<int> numOpps(n);
	for(int i=0;i<n;i++){
		for(int j=0;j<4;j++){
			cin >> opps[i][j];
			opps[i][j]--;
			if(opps[i][j]==-1){
				numOpps[i]=j;
				break;
			}
		}
	}
	vector<int> group(n);
	for(int i=0;i<n;i++){
		int oppCnt=0;
		for(int j=0;j<numOpps[i];j++){
			oppCnt+=(group[opps[i][j]]==group[i]);
		}
		if(1<oppCnt) group[i]=1-group[i];
	}
	int ans=0;
	for(bool x : group) ans+=x;
	cout << ans << '\n';
	for(int i=0;i<n;i++) if(1==group[i]) cout << i+1 << ' ';
}
SubtaskSumTestVerdictTimeMemory
base15/100
1Accepted0/01ms316 KiB
2Wrong answer0/090ms2880 KiB
3Accepted3/31ms316 KiB
4Accepted3/31ms316 KiB
5Accepted3/31ms316 KiB
6Accepted3/31ms316 KiB
7Accepted3/31ms316 KiB
8Wrong answer0/21ms316 KiB
9Wrong answer0/32ms316 KiB
10Wrong answer0/32ms420 KiB
11Wrong answer0/32ms316 KiB
12Wrong answer0/38ms488 KiB
13Wrong answer0/39ms608 KiB
14Wrong answer0/310ms608 KiB
15Wrong answer0/690ms2884 KiB
16Wrong answer0/7103ms2884 KiB
17Wrong answer0/7114ms2876 KiB
18Wrong answer0/6186ms5428 KiB
19Wrong answer0/6214ms5684 KiB
20Wrong answer0/6237ms5864 KiB
21Wrong answer0/6280ms8244 KiB
22Time limit exceeded0/7323ms8328 KiB
23Time limit exceeded0/7358ms8500 KiB
24Time limit exceeded0/7358ms8500 KiB