147672025-02-02 10:49:29TakacsAndrasParti (75 pont)cpp17Wrong answer 72/7589ms7864 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 << ' ';
}
SubtaskSumTestVerdictTimeMemory
base72/75
1Accepted0/01ms316 KiB
2Accepted0/043ms4152 KiB
3Accepted3/31ms316 KiB
4Accepted3/31ms316 KiB
5Wrong answer0/31ms316 KiB
6Accepted3/31ms316 KiB
7Accepted3/31ms564 KiB
8Accepted4/41ms316 KiB
9Accepted4/41ms640 KiB
10Accepted4/43ms392 KiB
11Accepted4/42ms316 KiB
12Accepted4/42ms316 KiB
13Accepted4/43ms568 KiB
14Accepted4/44ms632 KiB
15Accepted4/443ms4020 KiB
16Accepted4/452ms4792 KiB
17Accepted4/461ms5684 KiB
18Accepted4/470ms6228 KiB
19Accepted4/479ms7088 KiB
20Accepted4/489ms7864 KiB
21Accepted4/486ms7864 KiB
22Accepted4/41ms316 KiB