63722023-11-26 10:06:56horvathabelUtazási irodacpp17Runtime error 12/45307ms126304 KiB
#include <bits/stdc++.h>
using namespace std;
int n,k;
vector<int> g[100001];
int cnt=0;
vector<bool> seen;
void dfs(int x,int k,vector<int> ans){
    ans.push_back(x);
    cnt++;
    seen[x]=true;
    if (cnt==k){
        for (int z:ans) cout<<z<<" ";
        return ;
    }
    for (int edge:g[x]){
        if (!seen[edge]) dfs(edge,k,ans);
    }

}
int main()
{
    cin>>n>>k;
    seen.resize(n+1,false);
    for (int i=1; i<n;i++){
        int a,b;
        cin>>a>>b;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    for (int i=1; i<=n;i++) sort(g[i].begin(), g[i].end());
    dfs(1,k,{});
    seen.clear();
    seen.resize(n+1,false);
    if(cnt<k){
        int z=k/cnt;
        if (k%cnt==0) z--;
        cnt*=z;
        z++;
        dfs(z,k,{});
    }
}
SubtaskSumTestVerdictTimeMemory
base12/45
1Accepted0/04ms6456 KiB
2Accepted0/017ms7584 KiB
3Accepted2/24ms7016 KiB
4Accepted2/24ms7228 KiB
5Accepted1/14ms7536 KiB
6Accepted2/27ms7720 KiB
7Accepted2/26ms7936 KiB
8Accepted1/112ms17760 KiB
9Runtime error0/27ms9928 KiB
10Runtime error0/27ms10208 KiB
11Runtime error0/18ms10456 KiB
12Runtime error0/27ms10440 KiB
13Runtime error0/28ms10736 KiB
14Runtime error0/28ms11004 KiB
15Runtime error0/28ms10980 KiB
16Runtime error0/28ms11252 KiB
17Runtime error0/38ms11392 KiB
18Runtime error0/28ms11432 KiB
19Accepted2/2307ms70712 KiB
20Runtime error0/28ms12544 KiB
21Runtime error0/38ms12820 KiB
22Runtime error0/38ms12804 KiB
23Runtime error0/38ms12820 KiB
24Runtime error0/1160ms126304 KiB
25Runtime error0/1151ms126276 KiB