6944 | 2023. 12. 21 07:46:02 | MagyarKendeSZLG | Elágazás nélküli úton levő települések (50 pont) | cpp17 | Elfogadva 50/50 | 14ms | 5528 KiB |
#include <iostream>
#include <vector>
#include <set>
using namespace std;
#define speed cin.tie(0); ios::sync_with_stdio(0)
vector<vector<int>> neighborS;
set<int> result;
void dfs(int node, int parent) {
for (int neighbor : neighborS[node]) {
if (neighbor == parent) continue;
result.insert(neighbor);
if (neighborS[neighbor].size() > 2) continue;
dfs(neighbor, node);
}
}
int main() {
speed;
int N, M;
cin >> N >> M;
neighborS.resize(N + 1);
while (M--) {
int U, V;
cin >> U >> V;
neighborS[U].push_back(V);
neighborS[V].push_back(U);
}
for (int i = 1; i <= N; i++) {
if (neighborS[i].size() == 1) { // zsakfalu
dfs(i, 0);
}
}
cout << result.size() << '\n';
for (int node : result) cout << node << ' ';
}
Részfeladat | Összpont | Teszt | Verdikt | Idő | Memória | ||
---|---|---|---|---|---|---|---|
base | 50/50 | ||||||
1 | Elfogadva | 0/0 | 3ms | 1888 KiB | |||
2 | Elfogadva | 0/0 | 14ms | 3932 KiB | |||
3 | Elfogadva | 2/2 | 3ms | 2168 KiB | |||
4 | Elfogadva | 2/2 | 3ms | 2296 KiB | |||
5 | Elfogadva | 2/2 | 3ms | 2504 KiB | |||
6 | Elfogadva | 2/2 | 3ms | 2716 KiB | |||
7 | Elfogadva | 2/2 | 3ms | 3084 KiB | |||
8 | Elfogadva | 2/2 | 4ms | 3160 KiB | |||
9 | Elfogadva | 2/2 | 4ms | 3512 KiB | |||
10 | Elfogadva | 2/2 | 6ms | 3812 KiB | |||
11 | Elfogadva | 2/2 | 8ms | 4204 KiB | |||
12 | Elfogadva | 2/2 | 8ms | 4388 KiB | |||
13 | Elfogadva | 3/3 | 3ms | 3460 KiB | |||
14 | Elfogadva | 3/3 | 4ms | 3656 KiB | |||
15 | Elfogadva | 3/3 | 4ms | 3720 KiB | |||
16 | Elfogadva | 3/3 | 4ms | 4112 KiB | |||
17 | Elfogadva | 3/3 | 8ms | 4380 KiB | |||
18 | Elfogadva | 3/3 | 8ms | 4412 KiB | |||
19 | Elfogadva | 3/3 | 9ms | 4732 KiB | |||
20 | Elfogadva | 3/3 | 14ms | 5264 KiB | |||
21 | Elfogadva | 3/3 | 14ms | 5528 KiB | |||
22 | Elfogadva | 3/3 | 14ms | 5528 KiB |