Submission #891948

#	Time	Username	Problem	Language	Result	Execution time	Memory
891948		HaciyevAlik	Senior Postmen (BOI14_postmen)	C++14	0 / 100	2 ms	4956 KiB

postmen

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mx=2e5+5;
vector<pair<int,int>> g[mx],edges;
bool used[mx];
int n,m;
vector<int> path;
void dfs(int u) {
    while(!g[u].empty()) {
        pair<int,int> cur = g[u].back();
        g[u].pop_back();
        if(used[cur.second]) continue;
        used[cur.second] = true;
        dfs(cur.first);
    }
    path.push_back(u);
}
int main(){
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);    
    cin >> n >> m;
    for(int i=1;i<=m;++i) {
        int u,v; cin >> u >> v;
        edges.push_back({u,v});
        g[u].push_back({v,i});
        g[v].push_back({u,i});
    }
    for(int i=0;i<m;++i) {
        if(!used[i+1]) {
            dfs(edges[i].first);
            for(auto j:path) {
                cout << j << " ";
            }
            path.clear();
            cout << '\n';
        }
    }
    return 0;
}

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