Submission #291049

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
291049	2020-09-04T15:56:24 Z	TadijaSebez	Fun Tour (APIO20_fun)	C++11	0 / 100	1 ms	384 KB

fun

#include "fun.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pii pair<int,int>

int SUB(int root,int x){return attractionsBehind(root,x);}
int DEP(int root,int x){return hoursRequired(root,x);}

const int N=100050;
int sz[N],type[N],dist[N];
vector<pii> v[3];
vector<int> createFunTour(int n,int q){
	for(int i=0;i<n;i++)sz[i]=SUB(0,i);
	int cen=0;
	for(int i=1;i<n;i++)if(sz[i]*2>=n&&sz[i]<sz[cen])cen=i;
	type[cen]=-1;
	for(int i=0,cnt=0;i<n;i++){
		dist[i]=DEP(cen,i);
		if(dist[i]==1&&cnt<2&&sz[i]<sz[cen]){
			cnt++;
			for(int j=0;j<n;j++)if(!type[j]){
				if(SUB(j,i)*2>n)type[j]=cnt;
			}
		}
	}
	for(int i=0;i<n;i++)if(type[i]==0)type[i]=3;
	for(int i=0;i<n;i++)if(i!=cen)v[type[i]-1].pb({dist[i],i});
	for(int i=0;i<3;i++)sort(v[i].begin(),v[i].end());
	if(v[0].size()<v[1].size())swap(v[0],v[1]);
	if(v[0].size()<v[2].size())swap(v[0],v[2]);
	if(v[1].size()<v[2].size())swap(v[1],v[2]);
	bool pu=0;
	if(v[0].size()>v[1].size()+v[2].size())v[2].pb({0,cen}),pu=1;
	assert(v[0].size()<=v[1].size()+v[2].size());
	int las=-1;
	vector<int> ans;
	while(max({v[0].size(),v[1].size(),v[2].size()})*2<v[0].size()+v[1].size()+v[2].size()){
		int mx=-1,o=-1;
		for(int i=0;i<3;i++)if(i!=las&&v[i].size()){
			if(v[i].back().first>mx)mx=v[i].back().first,o=i;
		}
		assert(o!=-1);
		ans.pb(v[o].back().second);
		v[o].pop_back();
		las=o;
	}
	if(v[0].size()<v[1].size())swap(v[0],v[1]);
	if(v[0].size()<v[2].size())swap(v[0],v[2]);
	if(v[1].size()<v[2].size())swap(v[1],v[2]);
	assert(v[0].size()==v[1].size()+v[2].size());
	while(v[0].size()){
		auto P=[&](int o){
			ans.pb(v[o].back().second);
			v[o].pop_back();
		};
		P(0);
		if(v[2].empty())P(1);
		else if(v[1].empty())P(2);
		else P(v[1].back().first>v[2].back().first?1:2);
	}
	if(!pu)ans.pb(cen);
	return ans;
}

Subtask #1

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Incorrect	1 ms	384 KB	Tour is not fun
7	Halted	0 ms	0 KB	-

Subtask #2

0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Incorrect	1 ms	384 KB	Tour is not fun
7	Halted	0 ms	0 KB	-

Subtask #3

0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Incorrect	1 ms	384 KB	Tour is not fun
6	Halted	0 ms	0 KB	-

Subtask #4

0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Incorrect	1 ms	384 KB	Tour is not fun
9	Halted	0 ms	0 KB	-

Subtask #5

0 / 34.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Incorrect	1 ms	384 KB	Tour is not fun
7	Halted	0 ms	0 KB	-