Submission #965995

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
965995	2024-04-19T09:05:01 Z	Darren0724	Fun Tour (APIO20_fun)	C++17	26 / 100	77 ms	21648 KB

#include "fun.h"
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(),x.end()
const int N=200005;
int cntid=0;
const int INF=1e9;
vector<int> adj[N],sz(N,1),pa(N),ans,dis(N);
priority_queue<pair<int,int>> pq[3];
void dfs(int k){
	for(int j:adj[k]){
		if(j==pa[k])continue;
		pa[j]=k;
		dfs(j);
		sz[k]+=sz[j];
	}
}
int cen(int k,int need){
	for(int j:adj[k]){
		if(j==pa[k])continue;
		if(sz[j]>=need)return cen(j,need);
	}
	return k;
}
void dfs1(int k,int pa){
	pq[cntid].push({dis[k],k});
	for(int j:adj[k]){
		if(j==pa)continue;
		dis[j]=dis[k]+1;
		dfs1(j,k);
	}
}
vector<int> createFunTour(int n, int q) {
  	//int H = hoursRequired(0, N - 1);
  	//int A = attractionsBehind(0, N - 1);
	for(int i=0;i<n;i++){
		for(int j=i+1;j<n;j++){
			if(hoursRequired(i,j)==1){
				adj[i].push_back(j);
				adj[j].push_back(i);
			}
		}
	}
	dfs(0);
	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;
		}
	}
	for(int j:adj[c1]){
		dfs1(j,c1);
		cntid++;
	}
	int last=-1;
	for(int i=1;i<n;i++){
		pair<int,int> p={-1,-1};
		for(int j=0;j<cntid;j++){
			if(j==last||pq[j].size()==0)continue;
			p=max(p,make_pair(pq[j].top().first,j));
		}
		last=p.second;
		auto [dis1,idx]=pq[p.second].top();
		pq[p.second].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	7256 KB	Output is correct
2	Correct	2 ms	7260 KB	Output is correct
3	Correct	2 ms	7260 KB	Output is correct
4	Correct	2 ms	7512 KB	Output is correct
5	Correct	3 ms	7260 KB	Output is correct
6	Correct	2 ms	7260 KB	Output is correct
7	Correct	3 ms	7260 KB	Output is correct
8	Correct	3 ms	7260 KB	Output is correct
9	Correct	2 ms	7256 KB	Output is correct
10	Correct	3 ms	7260 KB	Output is correct
11	Correct	2 ms	7260 KB	Output is correct
12	Correct	2 ms	7260 KB	Output is correct
13	Correct	3 ms	7260 KB	Output is correct
14	Correct	3 ms	7260 KB	Output is correct
15	Correct	2 ms	7260 KB	Output is correct
16	Correct	2 ms	7260 KB	Output is correct
17	Correct	2 ms	7260 KB	Output is correct
18	Correct	3 ms	7260 KB	Output is correct
19	Correct	2 ms	7260 KB	Output is correct
20	Correct	2 ms	7256 KB	Output is correct

Subtask #2
16.0 / 16.0

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

Subtask #3
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	7260 KB	Output is correct
2	Correct	2 ms	7260 KB	Output is correct
3	Correct	2 ms	7512 KB	Output is correct
4	Correct	3 ms	7260 KB	Output is correct
5	Correct	2 ms	7260 KB	Output is correct
6	Correct	3 ms	7260 KB	Output is correct
7	Correct	3 ms	7260 KB	Output is correct
8	Correct	2 ms	7256 KB	Output is correct
9	Correct	3 ms	7260 KB	Output is correct
10	Correct	3 ms	7516 KB	Output is correct
11	Correct	2 ms	7260 KB	Output is correct
12	Correct	10 ms	7512 KB	Output is correct
13	Correct	2 ms	7260 KB	Output is correct
14	Correct	3 ms	7516 KB	Output is correct
15	Correct	3 ms	7516 KB	Output is correct
16	Correct	9 ms	7516 KB	Output is correct
17	Correct	9 ms	7516 KB	Output is correct
18	Incorrect	77 ms	21648 KB	Too many queries
19	Halted	0 ms	0 KB	-

Subtask #4
0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	7260 KB	Output is correct
2	Correct	2 ms	7260 KB	Output is correct
3	Correct	3 ms	7260 KB	Output is correct
4	Correct	2 ms	7260 KB	Output is correct
5	Correct	2 ms	7260 KB	Output is correct
6	Correct	3 ms	7260 KB	Output is correct
7	Correct	2 ms	7512 KB	Output is correct
8	Correct	10 ms	7512 KB	Output is correct
9	Correct	2 ms	7260 KB	Output is correct
10	Correct	3 ms	7516 KB	Output is correct
11	Correct	4 ms	7516 KB	Output is correct
12	Correct	3 ms	7516 KB	Output is correct
13	Incorrect	27 ms	7516 KB	Too many queries
14	Halted	0 ms	0 KB	-

Subtask #5
0 / 34.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	7256 KB	Output is correct
2	Correct	2 ms	7260 KB	Output is correct
3	Correct	2 ms	7260 KB	Output is correct
4	Correct	2 ms	7512 KB	Output is correct
5	Correct	3 ms	7260 KB	Output is correct
6	Correct	2 ms	7260 KB	Output is correct
7	Correct	3 ms	7260 KB	Output is correct
8	Correct	3 ms	7260 KB	Output is correct
9	Correct	2 ms	7256 KB	Output is correct
10	Correct	3 ms	7260 KB	Output is correct
11	Correct	2 ms	7260 KB	Output is correct
12	Correct	2 ms	7260 KB	Output is correct
13	Correct	3 ms	7260 KB	Output is correct
14	Correct	3 ms	7260 KB	Output is correct
15	Correct	2 ms	7260 KB	Output is correct
16	Correct	2 ms	7260 KB	Output is correct
17	Correct	2 ms	7260 KB	Output is correct
18	Correct	3 ms	7260 KB	Output is correct
19	Correct	2 ms	7260 KB	Output is correct
20	Correct	2 ms	7256 KB	Output is correct
21	Correct	3 ms	7260 KB	Output is correct
22	Correct	3 ms	7516 KB	Output is correct
23	Correct	2 ms	7260 KB	Output is correct
24	Correct	10 ms	7512 KB	Output is correct
25	Correct	2 ms	7260 KB	Output is correct
26	Correct	3 ms	7516 KB	Output is correct
27	Correct	3 ms	7516 KB	Output is correct
28	Correct	2 ms	7512 KB	Output is correct
29	Correct	10 ms	7512 KB	Output is correct
30	Correct	2 ms	7260 KB	Output is correct
31	Correct	3 ms	7516 KB	Output is correct
32	Correct	4 ms	7516 KB	Output is correct
33	Correct	3 ms	7516 KB	Output is correct
34	Correct	10 ms	7664 KB	Output is correct
35	Correct	10 ms	7512 KB	Output is correct
36	Correct	11 ms	7516 KB	Output is correct
37	Correct	2 ms	7516 KB	Output is correct
38	Correct	10 ms	7516 KB	Output is correct
39	Correct	5 ms	7512 KB	Output is correct
40	Correct	6 ms	7544 KB	Output is correct
41	Correct	3 ms	7512 KB	Output is correct
42	Correct	9 ms	7516 KB	Output is correct
43	Correct	9 ms	7516 KB	Output is correct
44	Incorrect	77 ms	21648 KB	Too many queries
45	Halted	0 ms	0 KB	-

Submission #965995

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 16.0 / 16.0

Subtask #3 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
0 / 21.0

Subtask #4
0 / 19.0

Subtask #5
0 / 34.0