제출 #960656

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
960656		noyancanturk	어르신 집배원 (BOI14_postmen)	C++17	0 / 100	3 ms	4956 KiB

postmen

#ifndef Local
    #pragma GCC optimize("O3,unroll-loops")
#endif
    
#include "bits/stdc++.h"
using namespace std;
    
#define int int64_t
#define pb push_back
    
const int lim=2e5+100;
const int mod=998244353;
//const int mod=(1ll<<61)-1;
 
using pii=pair<int,int>;

vector<pii>v[lim];
bool vis[lim];
vector<int>path;

void dfs(int node){
    while(v[node].size()){
        pii now=v[node].back();
        v[node].pop_back();
        if(vis[now.second])continue;
        vis[now.second]=1;
        dfs(now.first);
    }
    path.pb(node);
}

inline void solve(){
    int n,m;
    cin>>n>>m;
    for(int i=0;i<m;i++){
        int x,y;
        cin>>x>>y;
        v[x].pb({y,i});
        v[y].pb({x,i});
    }
    int left=m;
    int now=1;
    while(0<left){
        if(size(v[now])){
            dfs(now);
            path.pop_back();
            for(int i:path){
                cout<<i<<" ";
            }
            cout<<"\n";
            left-=path.size();
            path.clear();
        }else{
            now++;
        }
    }
}
    
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
#ifdef Local  
    freopen(".in","r",stdin);
    freopen(".out","w",stdout);
#endif
    int t=1;
    //cin>>t;
    while (t--)
    {
        solve();
    }
}

• Subtask 1: 0 / 38
• Subtask 2: 0 / 17
• Subtask 3: 0 / 45