제출 #755475

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
755475		irmuun	어르신 집배원 (BOI14_postmen)	C++17	55 / 100	577 ms	103780 KiB

postmen

#include<bits/stdc++.h>

using namespace std;
 
#define pb push_back
#define ll long long
#define ff first
#define ss second
#define all(s) s.begin(),s.end()

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int n,m;
    cin>>n>>m;
    set<int>adj[n+1];
    vector<int>used(n+1,0);
    for(int i=1;i<=m;i++){
        int u,v;
        cin>>u>>v;
        adj[u].insert(v);
        adj[v].insert(u);
    }
    int ord[2*m+1];
    int cur=0;
    function <void(int)> dfs=[&](int x){
        cur++;
        ord[cur]=x;
        if(adj[x].size()==0){
            return;
        }
        int y=*adj[x].begin();
        adj[x].erase(y);
        adj[y].erase(x);
        dfs(y);
    };
    for(int i=1;i<=n;i++){
        if(adj[i].size()>0){
            dfs(i);
        }
    }
    stack<int>v;
    for(int i=1;i<=cur;i++){
        if(used[ord[i]]==0){
            used[ord[i]]=1;
            v.push(ord[i]);
        }
        else{
            int x=ord[i];
            cout<<x<<' ';
            while(!v.empty()){
                int y=v.top();
                if(x!=y){
                    cout<<y<<' ';
                    v.pop();
                    used[y]=0;
                }
                else{
                    break;
                }
            }
            cout<<"\n";
        }
    }
}

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