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

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

void DFS(int u){
    seen[u]=1;
    if (graf[u].size()<3){
        for(int v:graf[u]){
            if (seen[v]==0){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);
        }
    }
    for (int i = 0; i < n; i++) {
    if (seen[i] && graf[i].size() != 1) ans.push_back(i+1);
    }

    cout << ans.size() << "\n";
    for (int i:ans){cout << i << " ";}
}
SubtaskSumTestVerdictTimeMemory
base31/50
1Accepted0/01ms320 KiB
2Accepted0/028ms1280 KiB
3Wrong answer0/21ms500 KiB
4Accepted2/21ms500 KiB
5Accepted2/21ms320 KiB
6Wrong answer0/21ms320 KiB
7Accepted2/21ms320 KiB
8Accepted2/22ms320 KiB
9Accepted2/24ms480 KiB
10Accepted2/28ms500 KiB
11Accepted2/214ms740 KiB
12Accepted2/214ms824 KiB
13Accepted3/32ms320 KiB
14Wrong answer0/33ms320 KiB
15Wrong answer0/34ms568 KiB
16Wrong answer0/34ms660 KiB
17Wrong answer0/312ms800 KiB
18Wrong answer0/313ms872 KiB
19Accepted3/317ms916 KiB
20Accepted3/328ms1076 KiB
21Accepted3/328ms1184 KiB
22Accepted3/328ms1100 KiB