oj.uz

Submission #338705

# Submission time Handle Problem Language Result Execution time Memory
338705 2020-12-23T17:41:23 Z ryansee Village (BOI20_village) C++14
100 / 100
 194 ms 96176 KB 
#include "bits/stdc++.h"
using namespace std;

#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());    //can be used by calling rng() or shuffle(A, A+n, rng)
inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusivesss
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }

using ll=long long; 
using ld=long double;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>; 

long long LLINF = 1e18;
int INF = 1e9+1e6;
#define MAXN (100006)
ll n;
vector<int> v[MAXN];
pair<ll, vector<ll>> solve1() {
	ll ans = 0;
	vector<ll> A(n+1, -1), at(n+1, 0);
	FOR(i,1,n)at[i]=i;
	function<void(ll,ll)>dfs=[&](ll x,ll p) {
		for(auto i:v[x]) if(i^p) {
			dfs(i, x);
			if(at[i] == i) {
				swap(at[i], at[x]), ans += 2;
			}
		}
	};
	dfs(1,1);
	if(at[1]==1) for(auto i:v[1]) { ans+=2, swap(at[1],at[i]); break; }
	FOR(i,1,n)A[at[i]]=i;
	A.erase(A.begin());
	return {ans, A};
}
deque<int> *ppl[MAXN];
pair<ll, vector<ll>> solve2() {
	ll ans = 0;
	vector<ll> A(n+1), at(n+1);
	FOR(i,1,n) at[i] = i;
	auto match=[&](ll x,ll y){
		swap(at[x], at[y]);
	};
	function<ll(ll,ll)>dfs=[&](ll x,ll p){
		ll sz = 1;
		for(auto i:v[x]) if(i^p) {
			sz += dfs(i, x);
		}
		ppl[x] = new deque<int>;
		for(auto i:v[x]) if(i^p) {
			if(ppl[x]->size() < ppl[i]->size()) ppl[x] = ppl[i];
		}
		for(auto i:v[x]) if(i^p&&ppl[x]!=ppl[i]) {
			for(auto j:*ppl[i]) {
				match(ppl[x]->front(), j);
				ppl[x]->eb(ppl[x]->front());
				ppl[x]->pop_front();
				ppl[x]->eb(j);
			}
		}
		ans += ppl[x]->size() * 2;
		if(ppl[x]->size()){
			match(ppl[x]->front(), x);
			ppl[x]->eb(ppl[x]->front());
			ppl[x]->pop_front();
		}
		ppl[x]->eb(x);
		while(ppl[x]->size() > (n-sz)) ppl[x]->pop_back();
		return sz;
	};
	dfs(1,1);
	FOR(i,1,n) A[at[i]]=i;
	A.erase(A.begin());
	return {ans, A};
}
int main() {
	FAST
	cin>>n;
	FOR(i,2,n){
		ll a,b;
		cin>>a>>b;
		v[a].eb(b), v[b].eb(a);
	}
	auto mi = solve1();
	auto mx = solve2();
	cout<<mi.f<<' '<<mx.f<<'\n';
	for(auto i:mi.s) cout<<i<<' '; cout<<'\n';
	for(auto i:mx.s) cout<<i<<' '; cout<<'\n';
}

Compilation message

Village.cpp: In lambda function:
Village.cpp:81:24: warning: comparison of integer expressions of different signedness: 'std::deque<int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   81 |   while(ppl[x]->size() > (n-sz)) ppl[x]->pop_back();
      |         ~~~~~~~~~~~~~~~^~~~~~~~
Village.cpp: In function 'int main()':
Village.cpp:100:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  100 |  for(auto i:mi.s) cout<<i<<' '; cout<<'\n';
      |  ^~~
Village.cpp:100:33: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  100 |  for(auto i:mi.s) cout<<i<<' '; cout<<'\n';
      |                                 ^~~~
Village.cpp:101:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  101 |  for(auto i:mx.s) cout<<i<<' '; cout<<'\n';
      |  ^~~
Village.cpp:101:33: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  101 |  for(auto i:mx.s) cout<<i<<' '; cout<<'\n';
      |                                 ^~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 2 ms 2668 KB Output is correct
5 Correct 2 ms 2668 KB Output is correct
6 Correct 2 ms 2668 KB Output is correct
7 Correct 2 ms 2688 KB Output is correct
8 Correct 2 ms 2668 KB Output is correct
9 Correct 2 ms 2668 KB Output is correct
10 Correct 2 ms 2668 KB Output is correct
11 Correct 2 ms 2668 KB Output is correct
12 Correct 3 ms 2796 KB Output is correct
13 Correct 2 ms 2668 KB Output is correct
14 Correct 2 ms 2668 KB Output is correct
15 Correct 2 ms 2668 KB Output is correct
16 Correct 2 ms 2688 KB Output is correct
17 Correct 2 ms 2668 KB Output is correct

Subtask #2
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2924 KB Output is correct
2 Correct 3 ms 3052 KB Output is correct
3 Correct 3 ms 3052 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 3564 KB Output is correct
8 Correct 3 ms 3436 KB Output is correct
9 Correct 3 ms 3436 KB Output is correct
10 Correct 3 ms 3564 KB Output is correct
11 Correct 3 ms 3584 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 3456 KB Output is correct
18 Correct 3 ms 3376 KB Output is correct
19 Correct 3 ms 3436 KB Output is correct
20 Correct 3 ms 3436 KB Output is correct
21 Correct 3 ms 3436 KB Output is correct
22 Correct 3 ms 3436 KB Output is correct
23 Correct 3 ms 3436 KB Output is correct
24 Correct 4 ms 3436 KB Output is correct
25 Correct 3 ms 3052 KB Output is correct
26 Correct 3 ms 3436 KB Output is correct
27 Correct 3 ms 3052 KB Output is correct
28 Correct 3 ms 3436 KB Output is correct
29 Correct 3 ms 3436 KB Output is correct
30 Correct 3 ms 3436 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 2 ms 2668 KB Output is correct
5 Correct 2 ms 2668 KB Output is correct
6 Correct 2 ms 2668 KB Output is correct
7 Correct 2 ms 2688 KB Output is correct
8 Correct 2 ms 2668 KB Output is correct
9 Correct 2 ms 2668 KB Output is correct
10 Correct 2 ms 2668 KB Output is correct
11 Correct 2 ms 2668 KB Output is correct
12 Correct 3 ms 2796 KB Output is correct
13 Correct 2 ms 2668 KB Output is correct
14 Correct 2 ms 2668 KB Output is correct
15 Correct 2 ms 2668 KB Output is correct
16 Correct 2 ms 2688 KB Output is correct
17 Correct 2 ms 2668 KB Output is correct
18 Correct 3 ms 2924 KB Output is correct
19 Correct 3 ms 3052 KB Output is correct
20 Correct 3 ms 3052 KB Output is correct
21 Correct 3 ms 3436 KB Output is correct
22 Correct 3 ms 3436 KB Output is correct
23 Correct 3 ms 3436 KB Output is correct
24 Correct 3 ms 3564 KB Output is correct
25 Correct 3 ms 3436 KB Output is correct
26 Correct 3 ms 3436 KB Output is correct
27 Correct 3 ms 3564 KB Output is correct
28 Correct 3 ms 3584 KB Output is correct
29 Correct 3 ms 3436 KB Output is correct
30 Correct 3 ms 3436 KB Output is correct
31 Correct 3 ms 3436 KB Output is correct
32 Correct 3 ms 3436 KB Output is correct
33 Correct 3 ms 3436 KB Output is correct
34 Correct 3 ms 3456 KB Output is correct
35 Correct 3 ms 3376 KB Output is correct
36 Correct 3 ms 3436 KB Output is correct
37 Correct 3 ms 3436 KB Output is correct
38 Correct 3 ms 3436 KB Output is correct
39 Correct 3 ms 3436 KB Output is correct
40 Correct 3 ms 3436 KB Output is correct
41 Correct 4 ms 3436 KB Output is correct
42 Correct 3 ms 3052 KB Output is correct
43 Correct 3 ms 3436 KB Output is correct
44 Correct 3 ms 3052 KB Output is correct
45 Correct 3 ms 3436 KB Output is correct
46 Correct 3 ms 3436 KB Output is correct
47 Correct 3 ms 3436 KB Output is correct
48 Correct 155 ms 73948 KB Output is correct
49 Correct 162 ms 82124 KB Output is correct
50 Correct 164 ms 81996 KB Output is correct
51 Correct 121 ms 64428 KB Output is correct
52 Correct 159 ms 80996 KB Output is correct
53 Correct 171 ms 73212 KB Output is correct
54 Correct 101 ms 48860 KB Output is correct
55 Correct 194 ms 96176 KB Output is correct
56 Correct 187 ms 88268 KB Output is correct
57 Correct 178 ms 85092 KB Output is correct
58 Correct 180 ms 83660 KB Output is correct
59 Correct 164 ms 81796 KB Output is correct
60 Correct 130 ms 81880 KB Output is correct
61 Correct 136 ms 81740 KB Output is correct
62 Correct 150 ms 82380 KB Output is correct
63 Correct 137 ms 77244 KB Output is correct
64 Correct 163 ms 82252 KB Output is correct
65 Correct 151 ms 82636 KB Output is correct
66 Correct 137 ms 77228 KB Output is correct
67 Correct 102 ms 61284 KB Output is correct
68 Correct 127 ms 70204 KB Output is correct
69 Correct 141 ms 82124 KB Output is correct
70 Correct 167 ms 77356 KB Output is correct
71 Correct 99 ms 58020 KB Output is correct
72 Correct 115 ms 65428 KB Output is correct
73 Correct 142 ms 82124 KB Output is correct
74 Correct 130 ms 75380 KB Output is correct
75 Correct 169 ms 82764 KB Output is correct
76 Correct 167 ms 82656 KB Output is correct
77 Correct 143 ms 78040 KB Output is correct
78 Correct 113 ms 55636 KB Output is correct
79 Correct 116 ms 64556 KB Output is correct
80 Correct 183 ms 82808 KB Output is correct
81 Correct 147 ms 77740 KB Output is correct
82 Correct 143 ms 81756 KB Output is correct