Submission #966541

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
966541	2024-04-20T03:14:14 Z	Darren0724	Fun Tour (APIO20_fun)	C++17	100 / 100	202 ms	22756 KB

#include "fun.h"
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define all(x) x.begin(),x.end()
const int N=100005;
int cntid=0;
const int INF=1e9;
vector<int> ans;
priority_queue<pair<int,int>> pq[4];
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
vector<int> createFunTour(int n, int q) {
	ans.clear();
	int c1=0;
	int need=(n+1)/2;
	int mn=INF;
	for(int i=0;i<n-1;i++){
		int t=attractionsBehind(0, i);
		if(t>=need&&t<mn){
			mn=t;
			c1=i;
		}
	}
	vector<int> r;
	vector<int> dis0(N,0);
	for(int i=0;i<n;i++){
		dis0[i]=hoursRequired(c1,i);
		if(dis0[i]==1){
			r.push_back(i);
		}
	}
	int rsz=r.size()-1;
	assert(rsz<=2);
	vector<vector<int>> dis(rsz,vector<int>(N));
	vector<int> vis(N);
	for(int i=0;i<rsz;i++){
		for(int j=0;j<n;j++){
			dis[i][j]=hoursRequired(r[i],j);
		}
	}
	for(int i=0;i<n;i++){
		if(i==c1)continue;
		int p=-1;
		for(int j=0;j<rsz;j++){
			if(dis[j][i]<dis0[i]){
				p=j;break;
			}
		}
		if(p==-1)p=rsz;
		pq[p].push({dis0[i],i});
	}
	cntid=4;
	int last=0;
	int left=n-1;int mer=0;
	for(int i=1;i<n;i++){
		array<int,3> p={-1,-1,-1};
		for(int j=0;j<cntid;j++){
			if(j==last||pq[j].size()==0)continue;
			p=max(p,array<int,3>{pq[j].top().first,(int)pq[j].size(),j});
		}
		pair<int,int> mx={-1,-1};
		for(int j=0;j<cntid;j++){
			mx=max(mx,{(int)pq[j].size(),j});
		}
		if(mer==0&&(left-mx.first)<mx.first){
			mer=1;
			if(last!=mx.S&&(!pq[last].empty()&&!pq[3-last-mx.S].empty())&&pq[last].top().F<pq[3-last-mx.S].top().first){
				last=3-last-mx.second;
				ans.push_back(pq[last].top().second);
				pq[last].pop();	
				i++;
			}
			if(last==mx.S)last=(last+1)%3;
			while(!pq[last].empty()){
				pq[3-last-mx.S].push(pq[last].top());
				pq[last].pop();
			}
			//assert(last!=mx.second);
				p[2]=mx.second;
		}

		last=(p[2]==-1?last:p[2]);
		//assert(last!=-1&&pq[last].size()>0);
		auto [dis1,idx]=pq[last].top();
		pq[last].pop();
		ans.push_back(idx);
		left--;
	}
	ans.push_back(c1);
	// for(int j:ans){
	// 	cout<<j<<' ';
	// }
	// cout<<endl;
  	return ans;
}
/*
46 100000
0 1
1 2
2 3
3 4
4 5
5 6
6 7
7 8
8 9
9 10
10 11
11 12
12 13
13 14
14 15
0 16
16 17 
17 18
18 19
19 20
20 21
21 22
22 23
23 24
24 25
25 26
26 27
27 28
28 29
29 30
0 31
31 32
31 33
32 34
32 35
33 36
33 37
34 38
34 39
35 40
35 41
36 42 
36 43
37 44
37 45
*/

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2004 KB	Output is correct
2	Correct	1 ms	1116 KB	Output is correct
3	Correct	1 ms	1492 KB	Output is correct
4	Correct	1 ms	1628 KB	Output is correct
5	Correct	1 ms	2004 KB	Output is correct
6	Correct	1 ms	2000 KB	Output is correct
7	Correct	1 ms	1492 KB	Output is correct
8	Correct	1 ms	2004 KB	Output is correct
9	Correct	1 ms	1912 KB	Output is correct
10	Correct	1 ms	1492 KB	Output is correct
11	Correct	1 ms	2004 KB	Output is correct
12	Correct	1 ms	2004 KB	Output is correct
13	Correct	1 ms	1492 KB	Output is correct
14	Correct	1 ms	1960 KB	Output is correct
15	Correct	1 ms	1624 KB	Output is correct
16	Correct	1 ms	1956 KB	Output is correct
17	Correct	2 ms	2004 KB	Output is correct
18	Correct	1 ms	2000 KB	Output is correct
19	Correct	1 ms	2004 KB	Output is correct
20	Correct	1 ms	1492 KB	Output is correct

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	1116 KB	Output is correct
2	Correct	1 ms	1492 KB	Output is correct
3	Correct	1 ms	1628 KB	Output is correct
4	Correct	1 ms	2004 KB	Output is correct
5	Correct	1 ms	2000 KB	Output is correct
6	Correct	1 ms	1492 KB	Output is correct
7	Correct	1 ms	2004 KB	Output is correct
8	Correct	1 ms	1912 KB	Output is correct
9	Correct	1 ms	2000 KB	Output is correct
10	Correct	1 ms	2004 KB	Output is correct
11	Correct	1 ms	1492 KB	Output is correct
12	Correct	1 ms	2000 KB	Output is correct
13	Correct	1 ms	2000 KB	Output is correct
14	Correct	1 ms	2004 KB	Output is correct
15	Correct	1 ms	2004 KB	Output is correct
16	Correct	2 ms	2200 KB	Output is correct
17	Correct	1 ms	1628 KB	Output is correct
18	Correct	101 ms	16984 KB	Output is correct
19	Correct	1 ms	2256 KB	Output is correct
20	Correct	2 ms	2260 KB	Output is correct
21	Correct	3 ms	2260 KB	Output is correct
22	Correct	7 ms	2772 KB	Output is correct
23	Correct	13 ms	3792 KB	Output is correct
24	Correct	14 ms	4560 KB	Output is correct
25	Correct	59 ms	10692 KB	Output is correct

Subtask #4
19.0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	1116 KB	Output is correct
2	Correct	1 ms	1492 KB	Output is correct
3	Correct	1 ms	1492 KB	Output is correct
4	Correct	1 ms	2004 KB	Output is correct
5	Correct	1 ms	2004 KB	Output is correct
6	Correct	1 ms	1492 KB	Output is correct
7	Correct	2 ms	2004 KB	Output is correct
8	Correct	1 ms	2004 KB	Output is correct
9	Correct	1 ms	1628 KB	Output is correct
10	Correct	1 ms	2004 KB	Output is correct
11	Correct	1 ms	2004 KB	Output is correct
12	Correct	1 ms	2004 KB	Output is correct
13	Correct	2 ms	2004 KB	Output is correct
14	Correct	9 ms	3284 KB	Output is correct
15	Correct	107 ms	16468 KB	Output is correct
16	Correct	115 ms	16456 KB	Output is correct
17	Correct	20 ms	5328 KB	Output is correct
18	Correct	48 ms	8608 KB	Output is correct
19	Correct	87 ms	13564 KB	Output is correct
20	Correct	5 ms	2512 KB	Output is correct

Subtask #5
34.0 / 34.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2004 KB	Output is correct
2	Correct	1 ms	1116 KB	Output is correct
3	Correct	1 ms	1492 KB	Output is correct
4	Correct	1 ms	1628 KB	Output is correct
5	Correct	1 ms	2004 KB	Output is correct
6	Correct	1 ms	2000 KB	Output is correct
7	Correct	1 ms	1492 KB	Output is correct
8	Correct	1 ms	2004 KB	Output is correct
9	Correct	1 ms	1912 KB	Output is correct
10	Correct	1 ms	1492 KB	Output is correct
11	Correct	1 ms	2004 KB	Output is correct
12	Correct	1 ms	2004 KB	Output is correct
13	Correct	1 ms	1492 KB	Output is correct
14	Correct	1 ms	1960 KB	Output is correct
15	Correct	1 ms	1624 KB	Output is correct
16	Correct	1 ms	1956 KB	Output is correct
17	Correct	2 ms	2004 KB	Output is correct
18	Correct	1 ms	2000 KB	Output is correct
19	Correct	1 ms	2004 KB	Output is correct
20	Correct	1 ms	1492 KB	Output is correct
21	Correct	1 ms	2000 KB	Output is correct
22	Correct	1 ms	2004 KB	Output is correct
23	Correct	1 ms	1492 KB	Output is correct
24	Correct	1 ms	2000 KB	Output is correct
25	Correct	1 ms	2000 KB	Output is correct
26	Correct	1 ms	2004 KB	Output is correct
27	Correct	1 ms	2004 KB	Output is correct
28	Correct	2 ms	2004 KB	Output is correct
29	Correct	1 ms	2004 KB	Output is correct
30	Correct	1 ms	1628 KB	Output is correct
31	Correct	1 ms	2004 KB	Output is correct
32	Correct	1 ms	2004 KB	Output is correct
33	Correct	1 ms	2004 KB	Output is correct
34	Correct	1 ms	1624 KB	Output is correct
35	Correct	1 ms	2004 KB	Output is correct
36	Correct	1 ms	2004 KB	Output is correct
37	Correct	1 ms	2004 KB	Output is correct
38	Correct	1 ms	2004 KB	Output is correct
39	Correct	1 ms	2004 KB	Output is correct
40	Correct	1 ms	2004 KB	Output is correct
41	Correct	1 ms	1628 KB	Output is correct
42	Correct	2 ms	2200 KB	Output is correct
43	Correct	1 ms	1628 KB	Output is correct
44	Correct	101 ms	16984 KB	Output is correct
45	Correct	1 ms	2256 KB	Output is correct
46	Correct	2 ms	2260 KB	Output is correct
47	Correct	3 ms	2260 KB	Output is correct
48	Correct	7 ms	2772 KB	Output is correct
49	Correct	13 ms	3792 KB	Output is correct
50	Correct	14 ms	4560 KB	Output is correct
51	Correct	59 ms	10692 KB	Output is correct
52	Correct	2 ms	2004 KB	Output is correct
53	Correct	9 ms	3284 KB	Output is correct
54	Correct	107 ms	16468 KB	Output is correct
55	Correct	115 ms	16456 KB	Output is correct
56	Correct	20 ms	5328 KB	Output is correct
57	Correct	48 ms	8608 KB	Output is correct
58	Correct	87 ms	13564 KB	Output is correct
59	Correct	5 ms	2512 KB	Output is correct
60	Correct	131 ms	16588 KB	Output is correct
61	Correct	134 ms	18956 KB	Output is correct
62	Correct	138 ms	16844 KB	Output is correct
63	Correct	143 ms	20716 KB	Output is correct
64	Correct	137 ms	20292 KB	Output is correct
65	Correct	146 ms	16720 KB	Output is correct
66	Correct	177 ms	19204 KB	Output is correct
67	Correct	148 ms	20852 KB	Output is correct
68	Correct	161 ms	21212 KB	Output is correct
69	Correct	202 ms	22440 KB	Output is correct
70	Correct	126 ms	17880 KB	Output is correct
71	Correct	141 ms	21604 KB	Output is correct
72	Correct	162 ms	20168 KB	Output is correct
73	Correct	166 ms	21076 KB	Output is correct
74	Correct	168 ms	22708 KB	Output is correct
75	Correct	132 ms	18100 KB	Output is correct
76	Correct	151 ms	21640 KB	Output is correct
77	Correct	152 ms	22216 KB	Output is correct
78	Correct	141 ms	21388 KB	Output is correct
79	Correct	161 ms	22540 KB	Output is correct
80	Correct	156 ms	22756 KB	Output is correct
81	Correct	132 ms	17620 KB	Output is correct
82	Correct	143 ms	18120 KB	Output is correct
83	Correct	141 ms	17832 KB	Output is correct
84	Correct	61 ms	8736 KB	Output is correct

Submission #966541

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