247802026-02-15 02:02:47999Elágazás nélküli úton levő települések (50 pont)cpp17Wrong answer 31/5014ms1924 KiB
// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
/*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
*/
using namespace std;
#define int long long

int strtonum(string s){
    int x=0;
    while(s[0]=='0'&&s.size()>1)s=s.substr(1,s.size()-1);
    for(int i = 0; i<=s.size()-1;i++){
        x+=s[i]-'0';
        if(i<s.size()-1)x*=2;
    }
    return x;
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n,m;cin>>n>>m;
    vector<vector<int>> v(n);
    vector<int> fok(n);
    for(int i = 0;i<m;i++){
        int a,b;cin>>a>>b;
        a--;b--;
        v[a].push_back(b);
        v[b].push_back(a);
        fok[a]++;fok[b]++;
    }
    int cnt=0;
    queue<int> q;
    vector<int> vis(n),ans;
    for(int i = 0;i<n;i++){
        if(fok[i]==1){
            cnt++;
            vis[i]=1;
            q.push(i);
        }
    }
    while(!q.empty()){
        int a=q.front();
        q.pop();
        for(int u : v[a]){
            if(!vis[u]&&v[a].size()<=2){
                vis[u]=1;
                q.push(u);
                ans.push_back(u);
            }
        }
    }
    if(cnt+ans.size()==n){
        cout<<n<<endl;
        for(int i = 1;i<=n;i++)cout<<i<<' ';
        return 0;
    }
    sort(ans.begin(),ans.end());
    cout<<ans.size()<<endl;
    for(int i : ans)cout<<i+1<<' ';
}

SubtaskSumTestVerdictTimeMemory
base31/50
1Accepted0/01ms316 KiB
2Accepted0/014ms1844 KiB
3Accepted2/21ms316 KiB
4Wrong answer0/21ms508 KiB
5Accepted2/21ms316 KiB
6Wrong answer0/21ms400 KiB
7Accepted2/21ms316 KiB
8Accepted2/22ms364 KiB
9Accepted2/23ms564 KiB
10Accepted2/24ms820 KiB
11Accepted2/27ms1104 KiB
12Accepted2/28ms1076 KiB
13Accepted3/32ms316 KiB
14Wrong answer0/33ms564 KiB
15Wrong answer0/33ms564 KiB
16Wrong answer0/33ms820 KiB
17Wrong answer0/36ms1036 KiB
18Wrong answer0/37ms1200 KiB
19Accepted3/38ms1444 KiB
20Accepted3/313ms1924 KiB
21Accepted3/314ms1812 KiB
22Accepted3/314ms1828 KiB