2506 | 2023. 01. 14 19:59:15 | JMMirko | Parti (75 pont) | cpp17 | Accepted 75/75 | 75ms | 6996 KiB |
// Source: https://usaco.guide/general/io
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int,int> > v;
vector<int> ve(n);
queue<int> q;
for(int i=0;i<n;i++){
int a,b;
cin >> a >> b;
v.push_back(make_pair(a-1,b-1));
ve[a-1]++;
ve[b-1]++;
}
for(int i=0;i<n;i++){
if(ve[i]<2)q.push(i);
}
while(!q.empty()){
int a=q.front();
q.pop();
ve[v[a].first]--;
ve[v[a].second]--;
if(ve[v[a].first]==1)q.push(v[a].first);
if(ve[v[a].second]==1)q.push(v[a].second);
}
//for(int x:ve)cout << x << " ";
//cout << endl;
vector<int>vec;
for(int i=0;i<n;i++){
if(ve[i]>1)vec.push_back(i);
}
cout << vec.size() << endl;
for(int x:vec)cout << x+1 << ' ';
cout << endl;
}
Subtask | Sum | Test | Verdict | Time | Memory | ||
---|---|---|---|---|---|---|---|
base | 75/75 | ||||||
1 | Accepted | 0/0 | 3ms | 1812 KiB | |||
2 | Accepted | 0/0 | 37ms | 3756 KiB | |||
3 | Accepted | 3/3 | 2ms | 2260 KiB | |||
4 | Accepted | 3/3 | 2ms | 2460 KiB | |||
5 | Accepted | 3/3 | 2ms | 2540 KiB | |||
6 | Accepted | 3/3 | 2ms | 2620 KiB | |||
7 | Accepted | 3/3 | 2ms | 2692 KiB | |||
8 | Accepted | 4/4 | 2ms | 2832 KiB | |||
9 | Accepted | 4/4 | 3ms | 3044 KiB | |||
10 | Accepted | 4/4 | 3ms | 3132 KiB | |||
11 | Accepted | 4/4 | 3ms | 3228 KiB | |||
12 | Accepted | 4/4 | 3ms | 3232 KiB | |||
13 | Accepted | 4/4 | 4ms | 3268 KiB | |||
14 | Accepted | 4/4 | 4ms | 3528 KiB | |||
15 | Accepted | 4/4 | 37ms | 4852 KiB | |||
16 | Accepted | 4/4 | 45ms | 5428 KiB | |||
17 | Accepted | 4/4 | 52ms | 6420 KiB | |||
18 | Accepted | 4/4 | 59ms | 6456 KiB | |||
19 | Accepted | 4/4 | 68ms | 6944 KiB | |||
20 | Accepted | 4/4 | 75ms | 6984 KiB | |||
21 | Accepted | 4/4 | 75ms | 6996 KiB | |||
22 | Accepted | 4/4 | 2ms | 3944 KiB |