162072025-04-14 17:00:31algoproKét csoportcpp17Wrong answer 35/100300ms20492 KiB
// UUID: dcfbf040-fc3f-4a29-84b6-90e7921c3fa4
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 300'001;

int col[MAXN];
vector<int> g[MAXN];

void dfs(int u) {
    for (int v : g[u]) {
        if (col[v] == -1) {
            col[v] = col[u] ^ 1;
            dfs(v);
        }
    }
}

void solve() {
    int n; cin >> n;
    fill(col, col+MAXN, 0);
    for (int i = 1; i <= n; i++) {
        int x; cin >> x;
        while (x) {
            g[i].emplace_back(x);
            cin >> x;
        }
    }

    for (int it = 0; it < 5; it++) {
        vector<int> ord(n);
        iota(ord.begin(), ord.end(), 1);
        random_shuffle(ord.begin(), ord.end());
        bool good = true;
        for (int i : ord) {
            int cnt = 0;
            for (int j : g[i]) {
                if (col[i] == col[j]) cnt++;
            }
            if (cnt > 1) col[i] ^= 1;
        }
    }

    cout << count(col+1, col+n+1, 0) << "\n";
    for (int i = 1; i <= n; i++) {
        if (col[i] == 0) cout << i << " ";
    }
    cout << "\n";
}

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
    int t = 1;
    // cin >> t;
    while (t--) solve();
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base35/100
1Accepted0/08ms8500 KiB
2Accepted0/092ms12440 KiB
3Accepted3/37ms8500 KiB
4Accepted3/38ms8500 KiB
5Accepted3/38ms8500 KiB
6Accepted3/38ms8504 KiB
7Accepted3/38ms8500 KiB
8Accepted2/27ms8500 KiB
9Accepted3/39ms8576 KiB
10Accepted3/39ms8524 KiB
11Wrong answer0/39ms8500 KiB
12Accepted3/314ms8904 KiB
13Accepted3/317ms9012 KiB
14Wrong answer0/317ms8916 KiB
15Accepted6/693ms12448 KiB
16Wrong answer0/793ms12476 KiB
17Wrong answer0/7100ms12448 KiB
18Wrong answer0/6197ms16404 KiB
19Wrong answer0/6194ms16408 KiB
20Time limit exceeded0/6207ms16196 KiB
21Time limit exceeded0/6300ms20492 KiB
22Time limit exceeded0/7280ms19092 KiB
23Time limit exceeded0/7300ms20020 KiB
24Time limit exceeded0/7287ms19092 KiB