Submission #966050

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
966050	2024-04-19T10:01:45 Z	Darren0724	Fun Tour (APIO20_fun)	C++17	66 / 100	221 ms	23936 KB

#include "fun.h"
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(),x.end()
const int N=100005;
int cntid=0;
const int INF=1e9;
vector<int> sz(N,1),pa(N),ans,dis(N);
priority_queue<pair<int,int>> pq[3];
vector<int> createFunTour(int n, int q) {
	int c1=n-1;
	int need=n/2+1;
	int mn=INF;
	for(int i=0;i<n-1;i++){
		int t=attractionsBehind(n-1, 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=r.size();
	int last=-1;
	int left=n-1;
	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(left-mx.first<=mx.first&&last!=mx.second){
			p[2]=mx.second;
		}
		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;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	3164 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2772 KB	Output is correct
4	Correct	1 ms	2772 KB	Output is correct
5	Correct	2 ms	3164 KB	Output is correct
6	Correct	1 ms	2772 KB	Output is correct
7	Correct	1 ms	2772 KB	Output is correct
8	Correct	2 ms	3164 KB	Output is correct
9	Correct	1 ms	3164 KB	Output is correct
10	Correct	2 ms	2772 KB	Output is correct
11	Correct	1 ms	3416 KB	Output is correct
12	Correct	1 ms	3144 KB	Output is correct
13	Correct	1 ms	2772 KB	Output is correct
14	Correct	2 ms	3064 KB	Output is correct
15	Correct	1 ms	2772 KB	Output is correct
16	Correct	2 ms	3164 KB	Output is correct
17	Correct	2 ms	3160 KB	Output is correct
18	Correct	2 ms	3164 KB	Output is correct
19	Correct	1 ms	3164 KB	Output is correct
20	Correct	2 ms	2772 KB	Output is correct

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2772 KB	Output is correct
3	Correct	1 ms	2772 KB	Output is correct
4	Correct	2 ms	3164 KB	Output is correct
5	Correct	1 ms	2772 KB	Output is correct
6	Correct	1 ms	2772 KB	Output is correct
7	Correct	2 ms	3164 KB	Output is correct
8	Correct	1 ms	3164 KB	Output is correct
9	Correct	2 ms	3164 KB	Output is correct
10	Correct	2 ms	3164 KB	Output is correct
11	Correct	1 ms	2772 KB	Output is correct
12	Correct	2 ms	3164 KB	Output is correct
13	Correct	2 ms	3160 KB	Output is correct
14	Correct	1 ms	3156 KB	Output is correct
15	Correct	2 ms	3156 KB	Output is correct
16	Correct	2 ms	3116 KB	Output is correct
17	Correct	2 ms	2772 KB	Output is correct
18	Correct	105 ms	18968 KB	Output is correct
19	Correct	2 ms	3280 KB	Output is correct
20	Correct	3 ms	3420 KB	Output is correct
21	Correct	4 ms	3540 KB	Output is correct
22	Correct	6 ms	4064 KB	Output is correct
23	Correct	11 ms	5076 KB	Output is correct
24	Correct	15 ms	5844 KB	Output is correct
25	Correct	59 ms	12512 KB	Output is correct

Subtask #4
19.0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2772 KB	Output is correct
3	Correct	2 ms	2772 KB	Output is correct
4	Correct	1 ms	3416 KB	Output is correct
5	Correct	1 ms	3144 KB	Output is correct
6	Correct	1 ms	2772 KB	Output is correct
7	Correct	2 ms	3164 KB	Output is correct
8	Correct	2 ms	3164 KB	Output is correct
9	Correct	2 ms	2772 KB	Output is correct
10	Correct	2 ms	3160 KB	Output is correct
11	Correct	2 ms	3160 KB	Output is correct
12	Correct	2 ms	3164 KB	Output is correct
13	Correct	2 ms	3284 KB	Output is correct
14	Correct	9 ms	4592 KB	Output is correct
15	Correct	109 ms	18632 KB	Output is correct
16	Correct	117 ms	18500 KB	Output is correct
17	Correct	20 ms	6868 KB	Output is correct
18	Correct	48 ms	10332 KB	Output is correct
19	Correct	80 ms	15120 KB	Output is correct
20	Correct	4 ms	3928 KB	Output is correct

Subtask #5
0 / 34.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	3164 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2772 KB	Output is correct
4	Correct	1 ms	2772 KB	Output is correct
5	Correct	2 ms	3164 KB	Output is correct
6	Correct	1 ms	2772 KB	Output is correct
7	Correct	1 ms	2772 KB	Output is correct
8	Correct	2 ms	3164 KB	Output is correct
9	Correct	1 ms	3164 KB	Output is correct
10	Correct	2 ms	2772 KB	Output is correct
11	Correct	1 ms	3416 KB	Output is correct
12	Correct	1 ms	3144 KB	Output is correct
13	Correct	1 ms	2772 KB	Output is correct
14	Correct	2 ms	3064 KB	Output is correct
15	Correct	1 ms	2772 KB	Output is correct
16	Correct	2 ms	3164 KB	Output is correct
17	Correct	2 ms	3160 KB	Output is correct
18	Correct	2 ms	3164 KB	Output is correct
19	Correct	1 ms	3164 KB	Output is correct
20	Correct	2 ms	2772 KB	Output is correct
21	Correct	2 ms	3164 KB	Output is correct
22	Correct	2 ms	3164 KB	Output is correct
23	Correct	1 ms	2772 KB	Output is correct
24	Correct	2 ms	3164 KB	Output is correct
25	Correct	2 ms	3160 KB	Output is correct
26	Correct	1 ms	3156 KB	Output is correct
27	Correct	2 ms	3156 KB	Output is correct
28	Correct	2 ms	3164 KB	Output is correct
29	Correct	2 ms	3164 KB	Output is correct
30	Correct	2 ms	2772 KB	Output is correct
31	Correct	2 ms	3160 KB	Output is correct
32	Correct	2 ms	3160 KB	Output is correct
33	Correct	2 ms	3164 KB	Output is correct
34	Correct	2 ms	2772 KB	Output is correct
35	Correct	2 ms	3164 KB	Output is correct
36	Correct	2 ms	3160 KB	Output is correct
37	Correct	2 ms	3164 KB	Output is correct
38	Correct	3 ms	3164 KB	Output is correct
39	Correct	2 ms	3164 KB	Output is correct
40	Correct	2 ms	3164 KB	Output is correct
41	Correct	1 ms	2772 KB	Output is correct
42	Correct	2 ms	3116 KB	Output is correct
43	Correct	2 ms	2772 KB	Output is correct
44	Correct	105 ms	18968 KB	Output is correct
45	Correct	2 ms	3280 KB	Output is correct
46	Correct	3 ms	3420 KB	Output is correct
47	Correct	4 ms	3540 KB	Output is correct
48	Correct	6 ms	4064 KB	Output is correct
49	Correct	11 ms	5076 KB	Output is correct
50	Correct	15 ms	5844 KB	Output is correct
51	Correct	59 ms	12512 KB	Output is correct
52	Correct	2 ms	3284 KB	Output is correct
53	Correct	9 ms	4592 KB	Output is correct
54	Correct	109 ms	18632 KB	Output is correct
55	Correct	117 ms	18500 KB	Output is correct
56	Correct	20 ms	6868 KB	Output is correct
57	Correct	48 ms	10332 KB	Output is correct
58	Correct	80 ms	15120 KB	Output is correct
59	Correct	4 ms	3928 KB	Output is correct
60	Correct	117 ms	18516 KB	Output is correct
61	Correct	135 ms	20916 KB	Output is correct
62	Correct	127 ms	19404 KB	Output is correct
63	Correct	154 ms	23136 KB	Output is correct
64	Correct	134 ms	22520 KB	Output is correct
65	Correct	142 ms	19148 KB	Output is correct
66	Correct	176 ms	21476 KB	Output is correct
67	Correct	150 ms	22644 KB	Output is correct
68	Correct	176 ms	22396 KB	Output is correct
69	Correct	202 ms	23708 KB	Output is correct
70	Correct	122 ms	19312 KB	Output is correct
71	Correct	160 ms	23068 KB	Output is correct
72	Correct	162 ms	21616 KB	Output is correct
73	Correct	159 ms	21964 KB	Output is correct
74	Correct	185 ms	23936 KB	Output is correct
75	Correct	133 ms	19432 KB	Output is correct
76	Correct	141 ms	23188 KB	Output is correct
77	Correct	154 ms	22988 KB	Output is correct
78	Correct	145 ms	22220 KB	Output is correct
79	Correct	221 ms	23480 KB	Output is correct
80	Correct	161 ms	23496 KB	Output is correct
81	Correct	131 ms	18908 KB	Output is correct
82	Correct	135 ms	19404 KB	Output is correct
83	Incorrect	142 ms	19028 KB	Tour is not fun
84	Halted	0 ms	0 KB	-

Submission #966050

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 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
0 / 34.0