130352025-01-05 11:25:54PallanekPéterElágazás nélküli úton levő települések (50 pont)cpp17Wrong answer 6/5028ms1336 KiB
#include<bits/stdc++.h>
using namespace std;

vector<int> ans;
vector<vector<int>> graf;
vector<int> seen;

void DFS(int u){
    seen[u]=1;
    if (graf[u].size()<3){
        for(int v:graf[u]){
            if (seen[v]==0){ans.push_back(v+1);DFS(v);}
        }
    }
    return;
}

int main(){
    int n,m; cin >> n >> m;
    graf.resize(n);
    seen.resize(n,0);
    for (int i=0;i<m;i++){
        int u,v; cin >> u >> v;
        graf[u-1].push_back(v-1);
        graf[v-1].push_back(u-1);
    }
    for (int i=0;i<n;i++){
        if (graf[i].size()==1){
            DFS(i);
        }
    }
    cout << ans.size() << "\n";
    for (int i:ans){cout << i << " ";}
}
SubtaskSumTestVerdictTimeMemory
base6/50
1Accepted0/01ms508 KiB
2Wrong answer0/028ms1336 KiB
3Wrong answer0/21ms320 KiB
4Accepted2/21ms320 KiB
5Accepted2/21ms320 KiB
6Wrong answer0/21ms320 KiB
7Wrong answer0/21ms320 KiB
8Wrong answer0/23ms320 KiB
9Wrong answer0/24ms568 KiB
10Wrong answer0/27ms568 KiB
11Accepted2/214ms820 KiB
12Wrong answer0/214ms840 KiB
13Wrong answer0/32ms320 KiB
14Wrong answer0/33ms492 KiB
15Wrong answer0/34ms568 KiB
16Wrong answer0/34ms568 KiB
17Wrong answer0/312ms928 KiB
18Wrong answer0/313ms844 KiB
19Wrong answer0/316ms972 KiB
20Wrong answer0/327ms1236 KiB
21Wrong answer0/327ms1216 KiB
22Wrong answer0/327ms1292 KiB