Submission #396018

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
396018	2021-04-29T11:18:29 Z	juggernaut	Fun Tour (APIO20_fun)	C++14	100 / 100	324 ms	25860 KB

#include "fun.h"
#include<bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pi;
typedef vector<pi> vpi;
#define pb emplace_back
#define mp make_pair
#define f first
#define s second
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
const int MAXN= 100100;

vi res;
vpi V[MAXN]; // pair(distance, node). Length is 0 for all nodes except neighbours of centroid
int pd[MAXN]; // distance from centroid
int mid3[MAXN]; // exclude the centroid + neighbours
int belg[MAXN]; // which subtree a node belongs to

std::vector<int> createFunTour(int N, int Q) {
  int rt=0;
  vpi T;
  for(int i=1;i<N;++i){
  	T.pb(mp(attractionsBehind(0,i),i));
  }
  sort(ALL(T));reverse(ALL(T));
  while(T.size()&&T.back().f<=N/2)T.pop_back();

  int cent=rt;
  if(SZ(T)==0)cent=rt;
  else{
  	cent=T.back().s;
  }
  belg[cent]=-1;
  vi adj;
  for(int i=0;i<N;++i){
  	int d=hoursRequired(cent,i);
  	pd[i]=d;
  	if(d==1){
  		adj.pb(i);
  		mid3[i]=1;
  	}
  }
  mid3[cent]=1;
  assert(SZ(adj)<=3);
  for(int i=0;i<N;++i)if(!mid3[i]){
  	int done=0;
  	for(auto x:adj)if(x!=adj.back()){
  		int k=hoursRequired(x,i);
  		if(k==pd[i]-1){
  			V[x].pb(mp(pd[i],i));
  			done=1;
  			break;
  		}
  	}
  	if(!done)V[adj.back()].pb(mp(pd[i],i));
  }
  for(auto i:adj){
  	V[i].pb(mp(pd[i],i));
  	sort(ALL(V[i]));
  }
  for(auto i:adj)for(auto j:V[i]){
  	belg[j.s]=i;
  }
  int blk=-1;
  int LFT=N;

  while(SZ(res) < N){
  	int skip=0;
  	int biggst=adj[0];
  	for(auto i:adj)if(SZ(V[i]) > SZ(V[biggst]))biggst=i;
  	int rst=LFT-SZ(V[biggst]);
  	int tx=SZ(V[biggst]);
  	if(tx==rst)skip=1;

  	if(skip){ // Dominant case
  		int MAJ=adj[0];
  		for(auto i:adj)if(SZ(V[i]) > SZ(V[MAJ]))MAJ=i;

  		if(blk!=MAJ){
  			pi t=mp(-1,-1);
  			for(auto i:adj)if(i!=blk){
  				if(SZ(V[i])){
  					pi x=V[i].back();
  					t=max(t,x);
  				}
  			}
  			if(t.s!=MAJ && t.f!=-1 && SZ(res) && pd[res.back()] < t.f){
          // Swap over to other, taller small branch
  			  res.pb(t.s);
  				V[belg[t.s]].pop_back();
  				blk=-1;
  			}
  		}
  		vpi rest;
  		for(auto i:adj)if(i!=MAJ){
  			for(auto k:V[i])rest.pb(k);
  		}
  		rest.pb(-1,cent);
  		sort(ALL(rest));

  		while(SZ(res)<N){
  			if(blk==MAJ){
  				blk=-1;
  				res.pb(rest.back().s);
  				rest.pop_back();
  			}else{
  				res.pb(V[MAJ].back().s);
  				V[MAJ].pop_back();
  				blk=MAJ;
  			}
  		}
  		return res;
  	}
  	else{ // Greedily go to bigest branch that is not currently visited
  		int furtbst=-1;
  		int t=-1;
  		int tp=-1;
  		for(auto i:adj)if(SZ(V[i])){
  			if(i==blk)continue;
  			int k=V[i].back().s;
  			int cd=V[i].back().f;
  			if(cd>=furtbst){
  				furtbst=cd;
  				t=k;
  				tp=i;
  			}
  		}
  		if(t==-1){
  			res.pb(cent);
  			assert(SZ(res)==N);
  			return res;
  		}

  		blk=tp;
  		res.pb(t);
  		V[tp].pop_back();
  	}
  	--LFT;
  }

  return res;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	2636 KB	Output is correct
2	Correct	2 ms	2656 KB	Output is correct
3	Correct	2 ms	2640 KB	Output is correct
4	Correct	2 ms	2636 KB	Output is correct
5	Correct	2 ms	2636 KB	Output is correct
6	Correct	2 ms	2636 KB	Output is correct
7	Correct	2 ms	2636 KB	Output is correct
8	Correct	2 ms	2652 KB	Output is correct
9	Correct	2 ms	2636 KB	Output is correct
10	Correct	2 ms	2636 KB	Output is correct
11	Correct	2 ms	2636 KB	Output is correct
12	Correct	2 ms	2636 KB	Output is correct
13	Correct	2 ms	2636 KB	Output is correct
14	Correct	2 ms	2636 KB	Output is correct
15	Correct	2 ms	2636 KB	Output is correct
16	Correct	2 ms	2636 KB	Output is correct
17	Correct	2 ms	2640 KB	Output is correct
18	Correct	2 ms	2636 KB	Output is correct
19	Correct	3 ms	2636 KB	Output is correct
20	Correct	3 ms	2636 KB	Output is correct

Subtask #2
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	2636 KB	Output is correct
2	Correct	2 ms	2656 KB	Output is correct
3	Correct	2 ms	2640 KB	Output is correct
4	Correct	2 ms	2636 KB	Output is correct
5	Correct	2 ms	2636 KB	Output is correct
6	Correct	2 ms	2636 KB	Output is correct
7	Correct	2 ms	2636 KB	Output is correct
8	Correct	2 ms	2652 KB	Output is correct
9	Correct	2 ms	2636 KB	Output is correct
10	Correct	2 ms	2636 KB	Output is correct
11	Correct	2 ms	2636 KB	Output is correct
12	Correct	2 ms	2636 KB	Output is correct
13	Correct	2 ms	2636 KB	Output is correct
14	Correct	2 ms	2636 KB	Output is correct
15	Correct	2 ms	2636 KB	Output is correct
16	Correct	2 ms	2636 KB	Output is correct
17	Correct	2 ms	2640 KB	Output is correct
18	Correct	2 ms	2636 KB	Output is correct
19	Correct	3 ms	2636 KB	Output is correct
20	Correct	3 ms	2636 KB	Output is correct
21	Correct	2 ms	2636 KB	Output is correct
22	Correct	2 ms	2652 KB	Output is correct
23	Correct	2 ms	2636 KB	Output is correct
24	Correct	2 ms	2652 KB	Output is correct
25	Correct	2 ms	2636 KB	Output is correct
26	Correct	2 ms	2636 KB	Output is correct
27	Correct	2 ms	2636 KB	Output is correct
28	Correct	2 ms	2636 KB	Output is correct
29	Correct	3 ms	2652 KB	Output is correct
30	Correct	2 ms	2636 KB	Output is correct
31	Correct	2 ms	2636 KB	Output is correct
32	Correct	3 ms	2636 KB	Output is correct
33	Correct	2 ms	2636 KB	Output is correct
34	Correct	2 ms	2636 KB	Output is correct
35	Correct	3 ms	2636 KB	Output is correct
36	Correct	2 ms	2636 KB	Output is correct
37	Correct	2 ms	2636 KB	Output is correct
38	Correct	3 ms	2636 KB	Output is correct
39	Correct	2 ms	2636 KB	Output is correct
40	Correct	2 ms	2636 KB	Output is correct
41	Correct	2 ms	2636 KB	Output is correct

Subtask #3
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	2656 KB	Output is correct
2	Correct	2 ms	2640 KB	Output is correct
3	Correct	2 ms	2636 KB	Output is correct
4	Correct	2 ms	2636 KB	Output is correct
5	Correct	2 ms	2636 KB	Output is correct
6	Correct	2 ms	2636 KB	Output is correct
7	Correct	2 ms	2652 KB	Output is correct
8	Correct	2 ms	2636 KB	Output is correct
9	Correct	2 ms	2636 KB	Output is correct
10	Correct	2 ms	2652 KB	Output is correct
11	Correct	2 ms	2636 KB	Output is correct
12	Correct	2 ms	2652 KB	Output is correct
13	Correct	2 ms	2636 KB	Output is correct
14	Correct	2 ms	2636 KB	Output is correct
15	Correct	2 ms	2636 KB	Output is correct
16	Correct	2 ms	2636 KB	Output is correct
17	Correct	3 ms	2636 KB	Output is correct
18	Correct	153 ms	20592 KB	Output is correct
19	Correct	3 ms	2764 KB	Output is correct
20	Correct	4 ms	2924 KB	Output is correct
21	Correct	7 ms	3148 KB	Output is correct
22	Correct	9 ms	3788 KB	Output is correct
23	Correct	17 ms	4940 KB	Output is correct
24	Correct	25 ms	5700 KB	Output is correct
25	Correct	87 ms	12880 KB	Output is correct

Subtask #4
19.0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	2656 KB	Output is correct
2	Correct	2 ms	2640 KB	Output is correct
3	Correct	2 ms	2636 KB	Output is correct
4	Correct	2 ms	2636 KB	Output is correct
5	Correct	2 ms	2636 KB	Output is correct
6	Correct	2 ms	2636 KB	Output is correct
7	Correct	2 ms	2636 KB	Output is correct
8	Correct	3 ms	2652 KB	Output is correct
9	Correct	2 ms	2636 KB	Output is correct
10	Correct	2 ms	2636 KB	Output is correct
11	Correct	3 ms	2636 KB	Output is correct
12	Correct	2 ms	2636 KB	Output is correct
13	Correct	3 ms	2784 KB	Output is correct
14	Correct	13 ms	4308 KB	Output is correct
15	Correct	153 ms	19996 KB	Output is correct
16	Correct	164 ms	20284 KB	Output is correct
17	Correct	34 ms	6820 KB	Output is correct
18	Correct	82 ms	10912 KB	Output is correct
19	Correct	117 ms	16240 KB	Output is correct
20	Correct	7 ms	3256 KB	Output is correct

Subtask #5
34.0 / 34.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	2636 KB	Output is correct
2	Correct	2 ms	2656 KB	Output is correct
3	Correct	2 ms	2640 KB	Output is correct
4	Correct	2 ms	2636 KB	Output is correct
5	Correct	2 ms	2636 KB	Output is correct
6	Correct	2 ms	2636 KB	Output is correct
7	Correct	2 ms	2636 KB	Output is correct
8	Correct	2 ms	2652 KB	Output is correct
9	Correct	2 ms	2636 KB	Output is correct
10	Correct	2 ms	2636 KB	Output is correct
11	Correct	2 ms	2636 KB	Output is correct
12	Correct	2 ms	2636 KB	Output is correct
13	Correct	2 ms	2636 KB	Output is correct
14	Correct	2 ms	2636 KB	Output is correct
15	Correct	2 ms	2636 KB	Output is correct
16	Correct	2 ms	2636 KB	Output is correct
17	Correct	2 ms	2640 KB	Output is correct
18	Correct	2 ms	2636 KB	Output is correct
19	Correct	3 ms	2636 KB	Output is correct
20	Correct	3 ms	2636 KB	Output is correct
21	Correct	2 ms	2636 KB	Output is correct
22	Correct	2 ms	2652 KB	Output is correct
23	Correct	2 ms	2636 KB	Output is correct
24	Correct	2 ms	2652 KB	Output is correct
25	Correct	2 ms	2636 KB	Output is correct
26	Correct	2 ms	2636 KB	Output is correct
27	Correct	2 ms	2636 KB	Output is correct
28	Correct	2 ms	2636 KB	Output is correct
29	Correct	3 ms	2652 KB	Output is correct
30	Correct	2 ms	2636 KB	Output is correct
31	Correct	2 ms	2636 KB	Output is correct
32	Correct	3 ms	2636 KB	Output is correct
33	Correct	2 ms	2636 KB	Output is correct
34	Correct	2 ms	2636 KB	Output is correct
35	Correct	3 ms	2636 KB	Output is correct
36	Correct	2 ms	2636 KB	Output is correct
37	Correct	2 ms	2636 KB	Output is correct
38	Correct	3 ms	2636 KB	Output is correct
39	Correct	2 ms	2636 KB	Output is correct
40	Correct	2 ms	2636 KB	Output is correct
41	Correct	2 ms	2636 KB	Output is correct
42	Correct	2 ms	2636 KB	Output is correct
43	Correct	3 ms	2636 KB	Output is correct
44	Correct	153 ms	20592 KB	Output is correct
45	Correct	3 ms	2764 KB	Output is correct
46	Correct	4 ms	2924 KB	Output is correct
47	Correct	7 ms	3148 KB	Output is correct
48	Correct	9 ms	3788 KB	Output is correct
49	Correct	17 ms	4940 KB	Output is correct
50	Correct	25 ms	5700 KB	Output is correct
51	Correct	87 ms	12880 KB	Output is correct
52	Correct	3 ms	2784 KB	Output is correct
53	Correct	13 ms	4308 KB	Output is correct
54	Correct	153 ms	19996 KB	Output is correct
55	Correct	164 ms	20284 KB	Output is correct
56	Correct	34 ms	6820 KB	Output is correct
57	Correct	82 ms	10912 KB	Output is correct
58	Correct	117 ms	16240 KB	Output is correct
59	Correct	7 ms	3256 KB	Output is correct
60	Correct	243 ms	20536 KB	Output is correct
61	Correct	227 ms	22912 KB	Output is correct
62	Correct	220 ms	21176 KB	Output is correct
63	Correct	253 ms	25036 KB	Output is correct
64	Correct	220 ms	24644 KB	Output is correct
65	Correct	260 ms	20324 KB	Output is correct
66	Correct	255 ms	22840 KB	Output is correct
67	Correct	226 ms	24724 KB	Output is correct
68	Correct	277 ms	24300 KB	Output is correct
69	Correct	293 ms	24708 KB	Output is correct
70	Correct	219 ms	20824 KB	Output is correct
71	Correct	236 ms	24492 KB	Output is correct
72	Correct	252 ms	23056 KB	Output is correct
73	Correct	250 ms	23752 KB	Output is correct
74	Correct	292 ms	25388 KB	Output is correct
75	Correct	205 ms	21140 KB	Output is correct
76	Correct	234 ms	25016 KB	Output is correct
77	Correct	241 ms	24984 KB	Output is correct
78	Correct	247 ms	24220 KB	Output is correct
79	Correct	324 ms	25216 KB	Output is correct
80	Correct	287 ms	25860 KB	Output is correct
81	Correct	237 ms	19996 KB	Output is correct
82	Correct	227 ms	20708 KB	Output is correct
83	Correct	233 ms	20428 KB	Output is correct
84	Correct	104 ms	10136 KB	Output is correct

Submission #396018

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 16.0 / 16.0

Subtask #3 21.0 / 21.0

Subtask #4 19.0 / 19.0

Subtask #5 34.0 / 34.0

Subtask #1
10.0 / 10.0

Subtask #2
16.0 / 16.0

Subtask #3
21.0 / 21.0

Subtask #4
19.0 / 19.0

Subtask #5
34.0 / 34.0