제출 #386245

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
386245		Return_0	Village (BOI20_village)	C++17	100 / 100	127 ms	16236 KiB

Village

#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef pair <ll, ll> pll;

#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
	const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush();
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< x << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()

cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;

template <class A, class B> ostream& operator << (ostream& out, const pair<A, B> &a) {
	return out << '(' << a.first << ", " << a.second << ')';    }
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
	if(a.empty())return out<<"[]";out<< '[' << a[0]; for (int i = 0; ++i < (int)(a.size());)out<< ", " <<a[i];return out<<']';}
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;

cl N = 1e5 + 7;

//

ll n, villager [N], ans1;
vector <ll> adj [N];

void dfs1 (cl &v = 1, cl &pr = 0) {
	for (auto &u : adj[v]) if (u ^ pr)	dfs1(u, v);
	if (villager[v] == v) {
		ans1 += 2;
		if (pr) swap(villager[v], villager[pr]);
		else swap(villager[v], villager[adj[v][0]]);
	}
}

//

ll sz [N], tin [N], rtin [N], T, ans2;

ll plant (cl &v = 1, cl &pr = 1) {
	for (auto &u : adj[v]) if (u ^ pr)	sz[v] += plant(u, v);	++sz[v];
	ans2 += min(sz[v], n - sz[v]) << 1;
	return sz[v];
}

ll find_centroid (cl &n, ll v = 1, ll pr = 1) {
	for (ll i = 0; i < SZ(adj[v]); i++) if (adj[v][i] ^ pr && sz[adj[v][i]] << 1 > n)	pr = v, v = adj[v][i], i = -1;
	return v;
}

void dfs2 (cl &v, cl &pr = 0) {
	tin[v] = T;
	rtin[T++] = v;
	for (auto &u : adj[v])	if (u ^ pr)	dfs2(u, v);
}
//

int main ()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	iota(villager, villager + N, 0);

	cin>> n;
	for (ll i = 1, v, u; i < n; i++) {
		cin>> v >> u;
		adj[v].push_back(u);
		adj[u].push_back(v);
	}

	dfs1();
	dfs2(find_centroid(plant()));

	cout<< ans1 << ' ' << ans2 << '\n';
	output(1, n, villager, 1);
	for (ll i = 1; i <= n; i++)	cout<< rtin[(tin[i] + n / 2) % n] << ' '; cout<< endl;

	cerr<< "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";

	return 0;
}
/*
7
4 2
5 7
3 4
6 3
1 3
4 5

*/

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

Village.cpp: In function 'std::ostream& operator<<(std::ostream&, const std::vector<_Tp>&)':
Village.cpp:44:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   44 |  if(a.empty())return out<<"[]";out<< '[' << a[0]; for (int i = 0; ++i < (int)(a.size());)out<< ", " <<a[i];return out<<']';}
      |  ^~
Village.cpp:44:32: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   44 |  if(a.empty())return out<<"[]";out<< '[' << a[0]; for (int i = 0; ++i < (int)(a.size());)out<< ", " <<a[i];return out<<']';}
      |                                ^~~
Village.cpp: In function 'll plant(const ll&, const ll&)':
Village.cpp:68:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   68 |  for (auto &u : adj[v]) if (u ^ pr) sz[v] += plant(u, v); ++sz[v];
      |  ^~~
Village.cpp:68:59: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   68 |  for (auto &u : adj[v]) if (u ^ pr) sz[v] += plant(u, v); ++sz[v];
      |                                                           ^~
Village.cpp: In function 'int main()':
Village.cpp:103:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  103 |  for (ll i = 1; i <= n; i++) cout<< rtin[(tin[i] + n / 2) % n] << ' '; cout<< endl;
      |  ^~~
Village.cpp:103:72: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  103 |  for (ll i = 1; i <= n; i++) cout<< rtin[(tin[i] + n / 2) % n] << ' '; cout<< endl;
      |                                                                        ^~~~

• Subtask 1: 12 / 12
• Subtask 2: 38 / 38
• Subtask 3: 50 / 50