제출 #288644

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
288644		LordOfIran	어르신 집배원 (BOI14_postmen)	C++17	55 / 100	698 ms	55160 KiB

postmen

//                             In The Name Of Allah                                           
#include <bits/stdc++.h>
#define	ss second
#define ff first
#define use_fast ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define se(n) cout << setprecision(n) << fixed
#define pb push_back
//#define ll long long
#define ld long double
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std; 
const int N = 5e5 + 100, OO = 1e9 + 7, K = 1e7 + 4, T = 22, M = 1e9 + 7, P = 6151, SQ = 1300, lg = 22;
typedef pair <int, int> pii;
bool mark[N];
int num[N], ET[N], nw[N], ht[N], nxt = 0;
vector <pii> v[N];

inline void dfs(int x) {
	for(; nw[x] < (int)v[x].size(); nw[x]++) {
		pii p = v[x][nw[x]];
		if(mark[p.ss])
			continue;
		mark[p.ss] = true;
		dfs(p.ff);
		ET[nxt++] = x;
	}
}

int32_t main() {
	use_fast;
	int n, m;
	cin >> n >> m;
	for(int i = 0; i < m; i++) {
		int x, y;
		cin >> x >> y;
		v[x].pb({y, i});
		v[y].pb({x, i});
	}
	dfs(1);
	int sz = -1;
//	for(int i = 0; i < nxt; i++)
//		cout << ET[i] << " ";
//	return 0;
	for(int i = 0; i < nxt; i++) {
		int u = ET[i];
		if(num[u]) {
			cout << u;
			while(ht[sz] != u) 	
				cout << " " << ht[sz], num[ht[sz]]--, sz--;
			cout << endl;
		}
		else 
			ht[++sz] = u, num[u]++;
	}
	for(int i = 0; i <= sz; i++)
		cout << ht[i] << " ";
	cout << endl;
	return 0;
}

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