oj.uz

답안 #386245

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
386245 2021-04-06T08:09:01 Z Return_0 Village (BOI20_village) C++17
100 / 100
 127 ms 16236 KB 
#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

*/

Compilation message

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.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3436 KB Output is correct
2 Correct 3 ms 3436 KB Output is correct
3 Correct 3 ms 3436 KB Output is correct
4 Correct 3 ms 3436 KB Output is correct
5 Correct 3 ms 3436 KB Output is correct
6 Correct 3 ms 3436 KB Output is correct
7 Correct 3 ms 3436 KB Output is correct
8 Correct 3 ms 3584 KB Output is correct
9 Correct 3 ms 3436 KB Output is correct
10 Correct 3 ms 3436 KB Output is correct
11 Correct 3 ms 3436 KB Output is correct
12 Correct 3 ms 3436 KB Output is correct
13 Correct 3 ms 3436 KB Output is correct
14 Correct 3 ms 3436 KB Output is correct
15 Correct 3 ms 3436 KB Output is correct
16 Correct 3 ms 3436 KB Output is correct
17 Correct 3 ms 3436 KB Output is correct

Subtask #2
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3564 KB Output is correct
2 Correct 3 ms 3564 KB Output is correct
3 Correct 4 ms 3564 KB Output is correct
4 Correct 4 ms 3564 KB Output is correct
5 Correct 4 ms 3564 KB Output is correct
6 Correct 4 ms 3564 KB Output is correct
7 Correct 4 ms 3564 KB Output is correct
8 Correct 4 ms 3564 KB Output is correct
9 Correct 4 ms 3564 KB Output is correct
10 Correct 4 ms 3564 KB Output is correct
11 Correct 4 ms 3692 KB Output is correct
12 Correct 5 ms 3564 KB Output is correct
13 Correct 4 ms 3564 KB Output is correct
14 Correct 4 ms 3564 KB Output is correct
15 Correct 4 ms 3564 KB Output is correct
16 Correct 4 ms 3564 KB Output is correct
17 Correct 4 ms 3564 KB Output is correct
18 Correct 4 ms 3564 KB Output is correct
19 Correct 4 ms 3564 KB Output is correct
20 Correct 4 ms 3564 KB Output is correct
21 Correct 4 ms 3564 KB Output is correct
22 Correct 4 ms 3564 KB Output is correct
23 Correct 4 ms 3584 KB Output is correct
24 Correct 4 ms 3564 KB Output is correct
25 Correct 3 ms 3564 KB Output is correct
26 Correct 4 ms 3564 KB Output is correct
27 Correct 3 ms 3564 KB Output is correct
28 Correct 4 ms 3564 KB Output is correct
29 Correct 4 ms 3584 KB Output is correct
30 Correct 4 ms 3564 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3436 KB Output is correct
2 Correct 3 ms 3436 KB Output is correct
3 Correct 3 ms 3436 KB Output is correct
4 Correct 3 ms 3436 KB Output is correct
5 Correct 3 ms 3436 KB Output is correct
6 Correct 3 ms 3436 KB Output is correct
7 Correct 3 ms 3436 KB Output is correct
8 Correct 3 ms 3584 KB Output is correct
9 Correct 3 ms 3436 KB Output is correct
10 Correct 3 ms 3436 KB Output is correct
11 Correct 3 ms 3436 KB Output is correct
12 Correct 3 ms 3436 KB Output is correct
13 Correct 3 ms 3436 KB Output is correct
14 Correct 3 ms 3436 KB Output is correct
15 Correct 3 ms 3436 KB Output is correct
16 Correct 3 ms 3436 KB Output is correct
17 Correct 3 ms 3436 KB Output is correct
18 Correct 3 ms 3564 KB Output is correct
19 Correct 3 ms 3564 KB Output is correct
20 Correct 4 ms 3564 KB Output is correct
21 Correct 4 ms 3564 KB Output is correct
22 Correct 4 ms 3564 KB Output is correct
23 Correct 4 ms 3564 KB Output is correct
24 Correct 4 ms 3564 KB Output is correct
25 Correct 4 ms 3564 KB Output is correct
26 Correct 4 ms 3564 KB Output is correct
27 Correct 4 ms 3564 KB Output is correct
28 Correct 4 ms 3692 KB Output is correct
29 Correct 5 ms 3564 KB Output is correct
30 Correct 4 ms 3564 KB Output is correct
31 Correct 4 ms 3564 KB Output is correct
32 Correct 4 ms 3564 KB Output is correct
33 Correct 4 ms 3564 KB Output is correct
34 Correct 4 ms 3564 KB Output is correct
35 Correct 4 ms 3564 KB Output is correct
36 Correct 4 ms 3564 KB Output is correct
37 Correct 4 ms 3564 KB Output is correct
38 Correct 4 ms 3564 KB Output is correct
39 Correct 4 ms 3564 KB Output is correct
40 Correct 4 ms 3584 KB Output is correct
41 Correct 4 ms 3564 KB Output is correct
42 Correct 3 ms 3564 KB Output is correct
43 Correct 4 ms 3564 KB Output is correct
44 Correct 3 ms 3564 KB Output is correct
45 Correct 4 ms 3564 KB Output is correct
46 Correct 4 ms 3584 KB Output is correct
47 Correct 4 ms 3564 KB Output is correct
48 Correct 89 ms 10988 KB Output is correct
49 Correct 95 ms 11628 KB Output is correct
50 Correct 92 ms 11628 KB Output is correct
51 Correct 70 ms 9196 KB Output is correct
52 Correct 101 ms 10860 KB Output is correct
53 Correct 80 ms 9964 KB Output is correct
54 Correct 45 ms 9580 KB Output is correct
55 Correct 127 ms 16236 KB Output is correct
56 Correct 108 ms 13548 KB Output is correct
57 Correct 125 ms 12524 KB Output is correct
58 Correct 108 ms 11628 KB Output is correct
59 Correct 99 ms 11004 KB Output is correct
60 Correct 63 ms 10976 KB Output is correct
61 Correct 69 ms 10972 KB Output is correct
62 Correct 79 ms 11116 KB Output is correct
63 Correct 72 ms 10732 KB Output is correct
64 Correct 85 ms 11244 KB Output is correct
65 Correct 80 ms 11244 KB Output is correct
66 Correct 73 ms 10732 KB Output is correct
67 Correct 50 ms 9192 KB Output is correct
68 Correct 74 ms 10092 KB Output is correct
69 Correct 83 ms 11372 KB Output is correct
70 Correct 101 ms 10860 KB Output is correct
71 Correct 50 ms 8940 KB Output is correct
72 Correct 57 ms 9708 KB Output is correct
73 Correct 91 ms 11500 KB Output is correct
74 Correct 72 ms 10652 KB Output is correct
75 Correct 125 ms 11244 KB Output is correct
76 Correct 99 ms 10732 KB Output is correct
77 Correct 96 ms 11116 KB Output is correct
78 Correct 64 ms 8556 KB Output is correct
79 Correct 61 ms 9324 KB Output is correct
80 Correct 120 ms 11244 KB Output is correct
81 Correct 96 ms 11308 KB Output is correct
82 Correct 84 ms 10936 KB Output is correct