Submission #1162766

#	Time	Username	Problem	Language	Result	Execution time	Memory
1162766		Nonoze	Senior Postmen (BOI14_postmen)	C++20	55 / 100	605 ms	178724 KiB

postmen

/*
*	Author: Nonoze
*	Created: Thursday 06/03/2025
*/
#include <bits/stdc++.h>
using namespace std;

#ifndef DEBUG
	#define dbg(...)
#endif

// #define cout cerr << "OUT: "
#define endl '\n'
#define endlfl '\n' << flush
#define quit(x) return (void)(cout << x << endl)

template<typename T> void read(T& x) { cin >> x;}
template<typename T1, typename T2> void read(pair<T1, T2>& p) { read(p.first), read(p.second);}
template<typename T> void read(vector<T>& v) { for (auto& x : v) read(x); }
template<typename T1, typename T2> void read(T1& x, T2& y) { read(x), read(y); }
template<typename T1, typename T2, typename T3> void read(T1& x, T2& y, T3& z) { read(x), read(y), read(z); }
template<typename T1, typename T2, typename T3, typename T4> void read(T1& x, T2& y, T3& z, T4& zz) { read(x), read(y), read(z), read(zz); }
template<typename T> void print(vector<T>& v) { for (auto& x : v) cout << x << ' '; cout << endl; }

#define sz(x) (int)(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define make_unique(v) sort(all(v)), v.erase(unique(all(v)), (v).end())
#define pb push_back
#define mp(a, b) make_pair(a, b)
#define fi first
#define se second
#define cmin(a, b) a = min(a, b)
#define cmax(a, b) a = max(a, b)
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define QYES quit("YES")
#define QNO quit("NO")

#define int long long
#define double long double
const int inf = numeric_limits<int>::max() / 4;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9+7, LOG=20;



void solve();

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int tt=1;
	// cin >> tt;
	while(tt--) solve();
	return 0;
}




int n, k, m, q;
vector<unordered_set<int>> adj;
vector<vector<int>> ans;
vector<bool> already;

void dfs(int u) {
	if (already[u]) {
		already[u]=0;
		vector<int> vec; vec.pb(u);
		while (ans.back().back()!=u) {
			vec.pb(ans.back().back()), already[ans.back().back()]=0;
			ans.back().pop_back();
		}
		ans.back().pop_back();
		dbg(vec);
		if (ans.back().empty()) ans.pop_back(), ans.pb(vec);
		else ans.pb(vec), swap(ans.back(), ans[sz(ans)-2]), dfs(u);
		return;
	}
	already[u]=1, ans.back().pb(u);
	int v=*adj[u].begin(); adj[u].erase(v), adj[v].erase(u);
	dfs(v);
}


void solve() {
	read(n, m);
	adj.clear(), adj.resize(n);
	for (int i=0; i<m; i++) {
		int u, v; read(u, v); u--, v--;
		adj[u].insert(v), adj[v].insert(u);
	}
	already.resize(n, 0);
	for (int i=0; i<n; i++) {
		while (!adj[i].empty()) {
			ans.pb({});
			dbg(adj);
			dfs(i);
		}
	}
	for (auto &u: ans) {
		for (auto &v: u) cout << v+1 << ' ';
		cout << endl;
	}
}

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