147712025-02-02 11:11:53TakacsAndrasParti (75 pont)cpp17Accepted 75/7587ms6712 KiB
#include <bits/stdc++.h>
using namespace std;
int main() {
    int n; cin >> n;
    vector<int> bf(n+1);
    vector<vector<int>> g(n+1);
    for (int i = 1; i <= n; i++) {
        int a,b; cin >> a >> b;
        bf[a]++;
        bf[b]++;
        g[i].push_back(a);
        g[i].push_back(b);
    }
    bool b = true;
    while (b) {
        b = false;
        for (int i = 1; i <= n; i++) {
            if (g[i].size() > 0 && bf[i] < 2) {
                b = true;
                for (int x : g[i]) bf[x]--;
                g[i].clear();
            }
        }
    }
    vector<int> out;
    for (int i = 1; i <= n; i++) {
        if (bf[i] >= 2) out.push_back(i);
    }
    cout << out.size() << '\n';
    for (int x : out) cout << x << ' ';
    cout << '\n';
}
SubtaskSumTestVerdictTimeMemory
base75/75
1Accepted0/01ms316 KiB
2Accepted0/043ms3636 KiB
3Accepted3/31ms316 KiB
4Accepted3/31ms316 KiB
5Accepted3/31ms548 KiB
6Accepted3/31ms500 KiB
7Accepted3/31ms524 KiB
8Accepted4/41ms508 KiB
9Accepted4/42ms464 KiB
10Accepted4/42ms316 KiB
11Accepted4/42ms316 KiB
12Accepted4/42ms316 KiB
13Accepted4/43ms564 KiB
14Accepted4/44ms656 KiB
15Accepted4/443ms3616 KiB
16Accepted4/452ms4056 KiB
17Accepted4/461ms4812 KiB
18Accepted4/468ms5340 KiB
19Accepted4/479ms6060 KiB
20Accepted4/487ms6712 KiB
21Accepted4/487ms6656 KiB
22Accepted4/41ms316 KiB