Submission #1084311

#	Time	Username	Problem	Language	Result	Execution time	Memory
1084311		teesla	Senior Postmen (BOI14_postmen)	C++17	55 / 100	505 ms	82728 KiB

postmen

#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> ii;

vector<vector<ii>> adj;
stack<int> res;
vector<int> vis, edge;

int dfs(int x){

    vis[x] = 1;

    while(!adj[x].empty()){
        auto [viz, idx] = adj[x].back();
        adj[x].pop_back();
        if(edge[idx]) continue;
        edge[idx] = 1;

        if(vis[viz]){
            res.push(x);
            vis[x] = 0;
            return viz;
        }
        int k = dfs(viz);
        if(k == x){
            res.push(x);
            while(!res.empty()){
                if(res.top() != x) cout << ' ';
                cout << res.top();
                res.pop();
            }
            cout << endl;
        }
        else{
            res.push(x);
            vis[x] = 0;
            return k;
        }
    }

    vis[x] = 0;
    return 0;
}

int main(){
    int n,m; cin >> n >> m;
    
    adj.resize(n+2);
    vis.assign(n+2, 0);
    edge.assign(m+2,0);

    for(int i=0; i<m; i++){
        int a,b; cin >> a >> b;
        adj[a].push_back({b,i});
        adj[b].push_back({a,i});
    }

    for(int i=1; i<=n; i++){
        if(!adj[i].empty()) dfs(i);
    }
}

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