Submission #1165018

#TimeUsernameProblemLanguageResultExecution timeMemory
1165018MighilonSenior Postmen (BOI14_postmen)C++20
100 / 100
216 ms68616 KiB
#include <bits/stdc++.h> using namespace std; #ifdef DEBUG #include "../Library/debug.h" #else #define dbg(x...) #endif typedef long long ll; typedef long double ld; typedef pair<int, int> pi; typedef pair<ll, ll> pl; typedef vector<int> vi; typedef vector<bool> vb; typedef vector<ll> vl; typedef vector<pi> vpi; typedef vector<pl> vpl; #define FOR(i, a, b) for (int i = (a); i < (b); ++i) #define F0R(i, a) for (int i = 0; i < (a); ++i) #define FORd(i, a, b) for (int i = (b) - 1; i >= (a); --i) #define F0Rd(i, a) for (int i = (a) - 1; i >= 0; --i) #define trav(a, x) for (auto& a : x) #define f first #define s second #define pb push_back #define sz(x) (int)(x).size() #define all(x) x.begin(), x.end() const char nl = '\n'; const int INF = 1e9; const int MOD = 1e9 + 7; void solve(){ int n,m; cin>>n>>m; vector<vi> adj(n); vi e(m); vb vis(m); F0R(i,m){ int a,b; cin>>a>>b; a--,b--; e[i]=a^b; adj[a].pb(i); adj[b].pb(i); } vi path; function<void(int)> euler=[&](int v)->void{ while(!adj[v].empty()){ int id=adj[v].back(); adj[v].pop_back(); if(vis[id])continue; vis[id]=true; euler(e[id]^v); } path.pb(v); }; vb v_(n); ll ans=0; F0R(j,n){ euler(j); dbg(path) vi tmp; trav(i,path){ tmp.pb(i); if(v_[i]){ cout<<tmp.back()+1<<" "; tmp.pop_back(); while(!tmp.empty()&&tmp.back()!=i){ cout<<tmp.back()+1<<" "; v_[tmp.back()]=false; tmp.pop_back(); } cout<<nl; assert(!tmp.empty()); assert(tmp.back()==i); } else{ v_[i]=true; } } while(!tmp.empty()){ v_[tmp.back()]=false; tmp.pop_back(); } path.clear(); } } int32_t main(){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int TC = 1; // cin >> TC; while(TC--){ solve(); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...