제출 #477529

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
477529		hhhhaura	Network (BOI15_net)	C++14	0 / 100	0 ms	204 KiB

net

#define wiwihorz
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma loop-opt(on)

#define rep(i, a, b) for(int i = a; i <= b; i++)
#define rrep(i, a, b) for(int i = b; i >= a; i--)
#define all(x) x.begin(), x.end()
#define ceil(a, b) ((a + b - 1) / (b))

#define INF 1000000000000000000
#define MOD 1000000007
#define eps (1e-9)

using namespace std;

#define int long long int
#define lld long double
#define pii pair<int, int>
#define random mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count())

#ifdef wiwihorz
#define print(a...) cerr << "Line " << __LINE__ << ": ", kout("[" + string(#a) + "] = ", a)
void vprint(auto L, auto R) { while(L < R) cerr << *L << " \n"[next(L) == R], ++L; }
void kout() { cerr << endl; }
template<class T1, class ... T2> void kout(T1 a, T2 ... e) { cerr << a << " ", kout(e...); }
#else 
#define print(...) 0
#define vprint(...) 0
#endif 
namespace solver {
	int n, root, timestamp, lg;
	vector<vector<int>> mp, ac;
	vector<int> vis, d, cur;
	vector<pii> ans;
	void init_(int _n) {
		n = _n, root = -1, timestamp = 0;
		lg = 31 - __builtin_clz(n);
		mp.assign(n + 1, vector<int>());
		ac.assign(lg + 1, vector<int>(n + 1, 0));
		vis.assign(n + 1, 0);
		d.assign(n + 1, 0);
	}
	void dfs(int x, int par, int dd) {
		ac[0][x] = par, d[x] = dd;
		vis[x] = ++timestamp;
		int cnt = 0;
		for(auto i : mp[x]) if(i != par) {
			cnt ++, dfs(i, x, dd + 1);
		}
		if(!cnt) cur.push_back(x);
	}
	int LCA(int a, int b) {
		if(d[a] < d[b]) swap(a, b);
		int need = d[a] - d[b];
		rep(i, 0, lg) if((need >> i) & 1)
			a = ac[i][a];
		if(a == b) return a;
		rrep(i, 0, lg) if(ac[i][a] != ac[i][b])
			a = ac[i][a], b = ac[i][b];
		return ac[0][a]; 
	}
	void solve() {
		rep(i, 1, n) if(mp[i].size() > 1) root = i;
		dfs(root, root, 0);
		rep(i, 1, lg) rep(j, 1, n) {
			ac[i][j] = ac[i - 1][ac[i - 1][j]];
		}
		while(cur.size()) {
			vector<int> next;
			int h = cur.size() / 2;
			sort(all(cur), [](int a, int b) {
				return vis[a] < vis[b];
			});
			for(int i = 0; i < h; i ++) {
				int lca = LCA(cur[i], cur[i + h]);
				ans.push_back({cur[i], cur[i + h]});
				if(lca != root) next.push_back(lca);
			}
			if(h & 1) ans.push_back({1, cur.back()});
			cur = next;
		}
		cout << ans.size() << "\n";
		for(auto i : ans) cout << i.first << " " << i.second << "\n";
	}
};
using namespace solver;
signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int n; cin >> n;
	init_(n);
	rep(i, 1, n - 1) {
		int a, b; cin >> a >> b;
		mp[a].push_back(b);
		mp[b].push_back(a);
	}
	solve();
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

net.cpp:4: warning: ignoring '#pragma loop ' [-Wunknown-pragmas]
    4 | #pragma loop-opt(on)
      | 
net.cpp:24:13: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   24 | void vprint(auto L, auto R) { while(L < R) cerr << *L << " \n"[next(L) == R], ++L; }
      |             ^~~~
net.cpp:24:21: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   24 | void vprint(auto L, auto R) { while(L < R) cerr << *L << " \n"[next(L) == R], ++L; }
      |                     ^~~~

• Subtask 1: 0 / 18
• Subtask 2: 0 / 45
• Subtask 3: 0 / 37