oj.uz

Submission #338495

# Submission time Handle Problem Language Result Execution time Memory
338495 2020-12-23T09:40:07 Z ryansee Village (BOI20_village) C++14
31 / 100
 700 ms 8812 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};
}
ll re;
bitset<MAXN> done;
spi diam() {
	ll r = 1, mx = 0;
	FOR(i,1,n) if(!done[i]) r=i;
	function<void(ll,ll,ll)>dfs=[&](ll x,ll p,ll d){
		if(d>mx)mx=d,r=x;
		for(auto i:v[x]) if(i^p && !done[i]) dfs(i,x,d+1);
	};
	dfs(r,r,0);
	ll r1=r; mx = 0;
	dfs(r,r,0);
	return {mx,{r1,r}};
}
pair<ll, vector<ll>> solve2() {
	ll ans = 0;
	vector<ll> A(n+1);
	FOR(i,1,n) A[i] = i;
	while(n - re) {
		if(n - re == 3) {
			ans += 4;
			vector<ll> lol;
			FOR(i,1,n) if(!done[i]) lol.eb(i);
			FOR(i,0,2) A[lol[i]]=lol[(i+1)%3];
			break;
		}
		spi x = diam();
		done[x.s.f] = done[x.s.s] = 1;
		re += 2;
		swap(A[x.s.f], A[x.s.s]);
		ans += x.f * 2;
	}
	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 function 'int main()':
Village.cpp:95:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   95 |  for(auto i:mi.s) cout<<i<<' '; cout<<'\n';
      |  ^~~
Village.cpp:95:33: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   95 |  for(auto i:mi.s) cout<<i<<' '; cout<<'\n';
      |                                 ^~~~
Village.cpp:96:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   96 |  for(auto i:mx.s) cout<<i<<' '; cout<<'\n';
      |  ^~~
Village.cpp:96:33: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   96 |  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 2668 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 2668 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 2 ms 2668 KB Output is correct
13 Correct 3 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 2668 KB Output is correct
17 Correct 2 ms 2668 KB Output is correct

Subtask #2
19.0 / 38.0

# Verdict Execution time Memory Grader output
1 Partially correct 3 ms 2668 KB Partially correct
2 Partially correct 4 ms 2668 KB Partially correct
3 Correct 4 ms 2668 KB Output is correct
4 Partially correct 12 ms 2796 KB Partially correct
5 Partially correct 12 ms 2796 KB Partially correct
6 Correct 11 ms 2796 KB Output is correct
7 Correct 16 ms 2924 KB Output is correct
8 Correct 12 ms 2796 KB Output is correct
9 Correct 11 ms 2796 KB Output is correct
10 Correct 12 ms 2796 KB Output is correct
11 Correct 12 ms 2796 KB Output is correct
12 Correct 9 ms 2796 KB Output is correct
13 Correct 9 ms 2796 KB Output is correct
14 Correct 10 ms 2816 KB Output is correct
15 Correct 8 ms 2796 KB Output is correct
16 Correct 11 ms 2796 KB Output is correct
17 Partially correct 10 ms 2796 KB Partially correct
18 Correct 9 ms 2796 KB Output is correct
19 Correct 9 ms 2796 KB Output is correct
20 Correct 10 ms 2796 KB Output is correct
21 Correct 10 ms 2796 KB Output is correct
22 Correct 10 ms 2796 KB Output is correct
23 Correct 10 ms 2796 KB Output is correct
24 Partially correct 10 ms 2796 KB Partially correct
25 Correct 5 ms 2668 KB Output is correct
26 Correct 12 ms 2796 KB Output is correct
27 Correct 5 ms 2668 KB Output is correct
28 Partially correct 11 ms 2796 KB Partially correct
29 Correct 11 ms 2796 KB Output is correct
30 Correct 10 ms 2796 KB Output is correct

Subtask #3
0.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 2668 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 2668 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 2 ms 2668 KB Output is correct
13 Correct 3 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 2668 KB Output is correct
17 Correct 2 ms 2668 KB Output is correct
18 Partially correct 3 ms 2668 KB Partially correct
19 Partially correct 4 ms 2668 KB Partially correct
20 Correct 4 ms 2668 KB Output is correct
21 Partially correct 12 ms 2796 KB Partially correct
22 Partially correct 12 ms 2796 KB Partially correct
23 Correct 11 ms 2796 KB Output is correct
24 Correct 16 ms 2924 KB Output is correct
25 Correct 12 ms 2796 KB Output is correct
26 Correct 11 ms 2796 KB Output is correct
27 Correct 12 ms 2796 KB Output is correct
28 Correct 12 ms 2796 KB Output is correct
29 Correct 9 ms 2796 KB Output is correct
30 Correct 9 ms 2796 KB Output is correct
31 Correct 10 ms 2816 KB Output is correct
32 Correct 8 ms 2796 KB Output is correct
33 Correct 11 ms 2796 KB Output is correct
34 Partially correct 10 ms 2796 KB Partially correct
35 Correct 9 ms 2796 KB Output is correct
36 Correct 9 ms 2796 KB Output is correct
37 Correct 10 ms 2796 KB Output is correct
38 Correct 10 ms 2796 KB Output is correct
39 Correct 10 ms 2796 KB Output is correct
40 Correct 10 ms 2796 KB Output is correct
41 Partially correct 10 ms 2796 KB Partially correct
42 Correct 5 ms 2668 KB Output is correct
43 Correct 12 ms 2796 KB Output is correct
44 Correct 5 ms 2668 KB Output is correct
45 Partially correct 11 ms 2796 KB Partially correct
46 Correct 11 ms 2796 KB Output is correct
47 Correct 10 ms 2796 KB Output is correct
48 Execution timed out 1091 ms 8812 KB Time limit exceeded
49 Halted 0 ms 0 KB -