Submission #966034

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
966034	2024-04-19T09:45:57 Z	Darren0724	Fun Tour (APIO20_fun)	C++17	47 / 100	123 ms	18136 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[10];
vector<int> createFunTour(int n, int q) {
  	//int H = hoursRequired(0, N - 1);
  	//int A = attractionsBehind(0, N - 1);
	int c1=0;
	int need=(n+1)/2;
	int mn=INF;
	for(int i=1;i<n;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=r.size();
	int last=-1;
	for(int i=1;i<n;i++){
		array<int,3> p={-1,-1,last};
		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});
		}
		last=p[2];
		assert(last!=-1&&pq[last].size()>0);
		auto [dis1,idx]=pq[last].top();
		pq[last].pop();
		ans.push_back(idx);
	}
	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	3160 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	3160 KB	Output is correct
6	Correct	1 ms	3164 KB	Output is correct
7	Correct	1 ms	2768 KB	Output is correct
8	Correct	2 ms	3164 KB	Output is correct
9	Correct	1 ms	3164 KB	Output is correct
10	Correct	1 ms	2772 KB	Output is correct
11	Correct	2 ms	3164 KB	Output is correct
12	Correct	1 ms	3164 KB	Output is correct
13	Correct	1 ms	2772 KB	Output is correct
14	Correct	1 ms	3164 KB	Output is correct
15	Correct	1 ms	2772 KB	Output is correct
16	Correct	2 ms	3160 KB	Output is correct
17	Correct	1 ms	3160 KB	Output is correct
18	Correct	2 ms	3160 KB	Output is correct
19	Correct	2 ms	3164 KB	Output is correct
20	Correct	1 ms	2772 KB	Output is correct

Subtask #2
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	3160 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	3160 KB	Output is correct
6	Correct	1 ms	3164 KB	Output is correct
7	Correct	1 ms	2768 KB	Output is correct
8	Correct	2 ms	3164 KB	Output is correct
9	Correct	1 ms	3164 KB	Output is correct
10	Correct	1 ms	2772 KB	Output is correct
11	Correct	2 ms	3164 KB	Output is correct
12	Correct	1 ms	3164 KB	Output is correct
13	Correct	1 ms	2772 KB	Output is correct
14	Correct	1 ms	3164 KB	Output is correct
15	Correct	1 ms	2772 KB	Output is correct
16	Correct	2 ms	3160 KB	Output is correct
17	Correct	1 ms	3160 KB	Output is correct
18	Correct	2 ms	3160 KB	Output is correct
19	Correct	2 ms	3164 KB	Output is correct
20	Correct	1 ms	2772 KB	Output is correct
21	Correct	1 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	3160 KB	Output is correct
25	Correct	2 ms	3164 KB	Output is correct
26	Correct	2 ms	3164 KB	Output is correct
27	Correct	2 ms	3164 KB	Output is correct
28	Correct	1 ms	3164 KB	Output is correct
29	Correct	2 ms	3164 KB	Output is correct
30	Correct	1 ms	2772 KB	Output is correct
31	Correct	2 ms	3164 KB	Output is correct
32	Correct	2 ms	3164 KB	Output is correct
33	Correct	1 ms	3164 KB	Output is correct
34	Correct	2 ms	2772 KB	Output is correct
35	Correct	2 ms	3160 KB	Output is correct
36	Correct	2 ms	3164 KB	Output is correct
37	Correct	1 ms	3188 KB	Output is correct
38	Correct	2 ms	3160 KB	Output is correct
39	Correct	2 ms	3164 KB	Output is correct
40	Correct	2 ms	3164 KB	Output is correct
41	Correct	2 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	3160 KB	Output is correct
5	Correct	1 ms	3164 KB	Output is correct
6	Correct	1 ms	2768 KB	Output is correct
7	Correct	2 ms	3164 KB	Output is correct
8	Correct	1 ms	3164 KB	Output is correct
9	Correct	1 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	3160 KB	Output is correct
13	Correct	2 ms	3164 KB	Output is correct
14	Correct	2 ms	3164 KB	Output is correct
15	Correct	2 ms	3164 KB	Output is correct
16	Correct	2 ms	3164 KB	Output is correct
17	Correct	1 ms	2772 KB	Output is correct
18	Correct	104 ms	18136 KB	Output is correct
19	Correct	2 ms	3284 KB	Output is correct
20	Correct	3 ms	3284 KB	Output is correct
21	Correct	6 ms	3540 KB	Output is correct
22	Correct	6 ms	4052 KB	Output is correct
23	Correct	11 ms	5108 KB	Output is correct
24	Correct	14 ms	5840 KB	Output is correct
25	Correct	65 ms	11892 KB	Output is correct

Subtask #4
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	1 ms	2772 KB	Output is correct
4	Correct	2 ms	3164 KB	Output is correct
5	Correct	1 ms	3164 KB	Output is correct
6	Correct	1 ms	2772 KB	Output is correct
7	Correct	1 ms	3164 KB	Output is correct
8	Correct	2 ms	3164 KB	Output is correct
9	Correct	1 ms	2772 KB	Output is correct
10	Correct	2 ms	3164 KB	Output is correct
11	Correct	2 ms	3164 KB	Output is correct
12	Correct	1 ms	3164 KB	Output is correct
13	Correct	2 ms	3284 KB	Output is correct
14	Correct	10 ms	4516 KB	Output is correct
15	Correct	112 ms	17808 KB	Output is correct
16	Correct	123 ms	17732 KB	Output is correct
17	Correct	22 ms	6604 KB	Output is correct
18	Correct	54 ms	10004 KB	Output is correct
19	Incorrect	86 ms	14492 KB	Tour is not fun
20	Halted	0 ms	0 KB	-

Subtask #5
0 / 34.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	3160 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	3160 KB	Output is correct
6	Correct	1 ms	3164 KB	Output is correct
7	Correct	1 ms	2768 KB	Output is correct
8	Correct	2 ms	3164 KB	Output is correct
9	Correct	1 ms	3164 KB	Output is correct
10	Correct	1 ms	2772 KB	Output is correct
11	Correct	2 ms	3164 KB	Output is correct
12	Correct	1 ms	3164 KB	Output is correct
13	Correct	1 ms	2772 KB	Output is correct
14	Correct	1 ms	3164 KB	Output is correct
15	Correct	1 ms	2772 KB	Output is correct
16	Correct	2 ms	3160 KB	Output is correct
17	Correct	1 ms	3160 KB	Output is correct
18	Correct	2 ms	3160 KB	Output is correct
19	Correct	2 ms	3164 KB	Output is correct
20	Correct	1 ms	2772 KB	Output is correct
21	Correct	1 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	3160 KB	Output is correct
25	Correct	2 ms	3164 KB	Output is correct
26	Correct	2 ms	3164 KB	Output is correct
27	Correct	2 ms	3164 KB	Output is correct
28	Correct	1 ms	3164 KB	Output is correct
29	Correct	2 ms	3164 KB	Output is correct
30	Correct	1 ms	2772 KB	Output is correct
31	Correct	2 ms	3164 KB	Output is correct
32	Correct	2 ms	3164 KB	Output is correct
33	Correct	1 ms	3164 KB	Output is correct
34	Correct	2 ms	2772 KB	Output is correct
35	Correct	2 ms	3160 KB	Output is correct
36	Correct	2 ms	3164 KB	Output is correct
37	Correct	1 ms	3188 KB	Output is correct
38	Correct	2 ms	3160 KB	Output is correct
39	Correct	2 ms	3164 KB	Output is correct
40	Correct	2 ms	3164 KB	Output is correct
41	Correct	2 ms	2772 KB	Output is correct
42	Correct	2 ms	3164 KB	Output is correct
43	Correct	1 ms	2772 KB	Output is correct
44	Correct	104 ms	18136 KB	Output is correct
45	Correct	2 ms	3284 KB	Output is correct
46	Correct	3 ms	3284 KB	Output is correct
47	Correct	6 ms	3540 KB	Output is correct
48	Correct	6 ms	4052 KB	Output is correct
49	Correct	11 ms	5108 KB	Output is correct
50	Correct	14 ms	5840 KB	Output is correct
51	Correct	65 ms	11892 KB	Output is correct
52	Correct	2 ms	3284 KB	Output is correct
53	Correct	10 ms	4516 KB	Output is correct
54	Correct	112 ms	17808 KB	Output is correct
55	Correct	123 ms	17732 KB	Output is correct
56	Correct	22 ms	6604 KB	Output is correct
57	Correct	54 ms	10004 KB	Output is correct
58	Incorrect	86 ms	14492 KB	Tour is not fun
59	Halted	0 ms	0 KB	-

Submission #966034

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 16.0 / 16.0

Subtask #3 21.0 / 21.0

Subtask #4 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
0 / 19.0

Subtask #5
0 / 34.0