164562025-05-01 12:03:48peti1234Két csoportcpp17Accepted 100/100214ms21160 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);

    int n;
    cin>>n;
    vector<vector<int>> g(n+1);
    vector<int> c(n+1,1);
    queue<int> q;
    for (int i=1;i<=n;i++) {
        int a;
        while (true){
            cin>>a;
            if (!a) break;
            g[i].push_back(a);
        }
        if (g[i].size()>1) q.push(i);
    }
    while (!q.empty()){
        int v=q.front();
        q.pop();
        int cnt=0;
        for (int i : g[v]) cnt+=(c[v]==c[i]);
        if (cnt<2) continue;

        c[v]=3-c[v];
        
        for (int to : g[v]){
            cnt=0;
            for (int i : g[to]) cnt+=(c[v]==c[i]);
            if (cnt>1) q.push(to);
        }
    }
    vector<int> ans;
    for (int i=1;i<=n;i++) if (c[i]==1) ans.push_back(i);
    cout<<ans.size()<<"\n";
    for (int i : ans) cout<<i<<" ";
}
SubtaskSumTestVerdictTimeMemory
base100/100
1Accepted0/01ms316 KiB
2Accepted0/057ms7144 KiB
3Accepted3/31ms316 KiB
4Accepted3/31ms316 KiB
5Accepted3/31ms316 KiB
6Accepted3/31ms316 KiB
7Accepted3/31ms316 KiB
8Accepted2/21ms316 KiB
9Accepted3/32ms500 KiB
10Accepted3/31ms512 KiB
11Accepted3/32ms316 KiB
12Accepted3/36ms1076 KiB
13Accepted3/37ms1076 KiB
14Accepted3/37ms964 KiB
15Accepted6/659ms7184 KiB
16Accepted7/761ms7240 KiB
17Accepted7/767ms7360 KiB
18Accepted6/6115ms14168 KiB
19Accepted6/6130ms14164 KiB
20Accepted6/6135ms14036 KiB
21Accepted6/6184ms20944 KiB
22Accepted7/7196ms21160 KiB
23Accepted7/7206ms20904 KiB
24Accepted7/7214ms20908 KiB