Submission #1055613

#	Time	Username	Problem	Language	Result	Execution time	Memory
1055613		makanhulia	Senior Postmen (BOI14_postmen)	C++17	100 / 100	417 ms	57192 KiB

postmen

#include<bits/stdc++.h>
using namespace std;
#define int long long 

vector<pair<int,int> >adj[500002];
int sz[500002];
bool edge[500002];
bool node[500002];
stack<int>ans;

void dfs(int q){
    if(node[q]==true){
        while(!ans.empty()){
            int tmp=ans.top();
            if(tmp==q){
                cout<<q<<endl;
                break;
            }
            else{
                cout<<tmp<<" ";
                node[tmp]=false;
                ans.pop();
            }
        }
    }  
    else{
        ans.push(q);
    } 
    node[q]=true;

    while(!adj[q].empty()&&edge[adj[q].back().second]==true){
        adj[q].pop_back();
    }
    if(!adj[q].empty()){
        edge[adj[q].back().second]=true;
        sz[q]--;
        int has=adj[q].back().first;
        sz[has]--;
        adj[q].pop_back();
        dfs(has);
    }

}


signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n,m;
    cin>>n>>m;
    int cnt=1;
    for(int q=1;q<=m;q++){
        int u,v;
        cin>>u>>v;
        sz[u]++;
        sz[v]++;
        adj[u].push_back({v,cnt});
        adj[v].push_back({u,cnt});
        cnt++;
    }

    for(int q=1;q<=n;q++){
        if(sz[q]>0){
            dfs(q);
        }
    }
    
}

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