oj.uz

Submission #560938

# Submission time Handle Problem Language Result Execution time Memory
560938 2022-05-12T05:24:12 Z Koosha_mv Fun Tour (APIO20_fun) C++14
100 / 100
 206 ms 24736 KB 
#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,v.size()) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<x.F<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first
#include "fun.h"
 
const int N=1e5+99;
 
int n,rt,lid,last[N],dist[N];
vector<int> ans,g[N],vec[N];

int cmp(int u,int v){
	return dist[u]<dist[v];
}
int get1(int u,int v){
	return hoursRequired(u,v);
}
int get2(int u,int v){
	return attractionsBehind(u,v);
}
int get(int u){
	if(vec[u].size()==0) return -N;
	return dist[vec[u].back()];
}
void findcentroid(){
	int sz=n+1;
	rt=-1;
	f(i,0,n){
		int res=get2(0,i);
		if(res>=(n+1)/2 && res<sz){
			rt=i;
			sz=res;
		}
	}
}
bool check(){
	f(i,0,3){
		int sum=0;
		f(j,0,3) sum+=vec[j].size();
		if(sum==2*sz(vec[i])){
			return 1;
		}
	}
	return 0;
}
vector<int> createFunTour(int _n, int Q) {
	vector<int> adj;
	n=_n;
	findcentroid();
	f(i,0,n){
		dist[i]=get1(rt,i);
		if(dist[i]==1) adj.pb(i);
	}
	f(i,0,n){
		if(rt==i) continue ;
		f(j,0,adj.size()){
			if(j==adj.size()-1 || dist[i]==get1(adj[j],i)+1){
				vec[j].pb(i);
				break;
			}
		}
	}
	lid=3;
	last[0]=last[1]=N;
	f(i,0,3) sort(all(vec[i]),cmp);
	f(i,1,3) if(vec[i].size()>vec[0].size()) swap(vec[i],vec[0]);
	int i=0;
	if(vec[1].size()+vec[2].size()<vec[0].size()){
		while(vec[0].size()){
			ans.pb(vec[0].back());
			vec[0].pop_back();
			if(vec[1].size() && (get(1)>=get(2))) ans.pb(vec[1].back()),vec[1].pop_back();
			else if(vec[2].size()) ans.pb(vec[2].back()),vec[2].pop_back();
		}
		ans.pb(rt);
		return ans;
	}
	while(check()==0){
		int id=-1;
		f(i,0,3) if(vec[i].size() && i!=lid && (id==-1 || get(id)<get(i))){
			id=i;
		}
		last[i]=dist[vec[id].back()];
		ans.pb(vec[id].back());
		vec[id].pop_back();
		lid=id;
		i^=1;
	}
	f_(i,1,0){
		if(vec[i].size()<vec[i+1].size()){
			swap(vec[i],vec[i+1]);
			if(lid==i || lid==i+1) lid^=i^(i+1);
		}
	}
	if(get(0)<=last[i] && max(get(1),get(2))<=last[i^1]){
		while(vec[0].size()){
			ans.pb(vec[0].back());
			vec[0].pop_back();
			if(vec[2].size()==0 || (vec[1].size() && dist[vec[1].back()]>dist[vec[2].back()])){
				ans.pb(vec[1].back());
				vec[1].pop_back();
			}
			else{
				ans.pb(vec[2].back());
				vec[2].pop_back();
			}
		}
	}
	else if(get(0)<=last[i^1] && max(get(1),get(2))==get(3^lid) && max(get(1),get(2))<=last[i]){
		while(vec[0].size()){
			if(vec[2].size()==0 || (vec[1].size() && dist[vec[1].back()]>dist[vec[2].back()])){
				ans.pb(vec[1].back());
				vec[1].pop_back();
			}
			else{
				ans.pb(vec[2].back());
				vec[2].pop_back();
			}
			ans.pb(vec[0].back());
			vec[0].pop_back();
			
		}
	}
	else{
		eror(2);
		assert(0);
	}
	ans.pb(rt);
	return ans;
}

Compilation message

fun.cpp: In function 'std::vector<int> createFunTour(int, int)':
fun.cpp:8:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 | #define f(i,a,b) for(int i=a;i<b;i++)
......
   73 |   f(j,0,adj.size()){
      |     ~~~~~~~~~~~~~~             
fun.cpp:73:3: note: in expansion of macro 'f'
   73 |   f(j,0,adj.size()){
      |   ^
fun.cpp:74:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |    if(j==adj.size()-1 || dist[i]==get1(adj[j],i)+1){
      |       ~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4956 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 2 ms 4968 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4996 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 4 ms 5040 KB Output is correct
18 Correct 109 ms 19764 KB Output is correct
19 Correct 4 ms 5076 KB Output is correct
20 Correct 4 ms 5204 KB Output is correct
21 Correct 5 ms 5332 KB Output is correct
22 Correct 7 ms 5972 KB Output is correct
23 Correct 13 ms 6868 KB Output is correct
24 Correct 16 ms 7508 KB Output is correct
25 Correct 63 ms 13572 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 3 ms 5076 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 10 ms 6364 KB Output is correct
15 Correct 122 ms 19760 KB Output is correct
16 Correct 124 ms 19584 KB Output is correct
17 Correct 23 ms 8396 KB Output is correct
18 Correct 53 ms 11628 KB Output is correct
19 Correct 89 ms 16440 KB Output is correct
20 Correct 6 ms 5460 KB Output is correct

Subtask #5
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4956 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 2 ms 4968 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4996 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 3 ms 4948 KB Output is correct
28 Correct 2 ms 4948 KB Output is correct
29 Correct 3 ms 5076 KB Output is correct
30 Correct 3 ms 4948 KB Output is correct
31 Correct 3 ms 4948 KB Output is correct
32 Correct 3 ms 4948 KB Output is correct
33 Correct 3 ms 4948 KB Output is correct
34 Correct 3 ms 5076 KB Output is correct
35 Correct 3 ms 5076 KB Output is correct
36 Correct 3 ms 5076 KB Output is correct
37 Correct 2 ms 4948 KB Output is correct
38 Correct 3 ms 4948 KB Output is correct
39 Correct 3 ms 4948 KB Output is correct
40 Correct 3 ms 4948 KB Output is correct
41 Correct 3 ms 4948 KB Output is correct
42 Correct 3 ms 4948 KB Output is correct
43 Correct 4 ms 5040 KB Output is correct
44 Correct 109 ms 19764 KB Output is correct
45 Correct 4 ms 5076 KB Output is correct
46 Correct 4 ms 5204 KB Output is correct
47 Correct 5 ms 5332 KB Output is correct
48 Correct 7 ms 5972 KB Output is correct
49 Correct 13 ms 6868 KB Output is correct
50 Correct 16 ms 7508 KB Output is correct
51 Correct 63 ms 13572 KB Output is correct
52 Correct 3 ms 5076 KB Output is correct
53 Correct 10 ms 6364 KB Output is correct
54 Correct 122 ms 19760 KB Output is correct
55 Correct 124 ms 19584 KB Output is correct
56 Correct 23 ms 8396 KB Output is correct
57 Correct 53 ms 11628 KB Output is correct
58 Correct 89 ms 16440 KB Output is correct
59 Correct 6 ms 5460 KB Output is correct
60 Correct 145 ms 19772 KB Output is correct
61 Correct 163 ms 22212 KB Output is correct
62 Correct 151 ms 19856 KB Output is correct
63 Correct 179 ms 23876 KB Output is correct
64 Correct 184 ms 23736 KB Output is correct
65 Correct 168 ms 19756 KB Output is correct
66 Correct 185 ms 21900 KB Output is correct
67 Correct 166 ms 23776 KB Output is correct
68 Correct 178 ms 22984 KB Output is correct
69 Correct 206 ms 24344 KB Output is correct
70 Correct 147 ms 19900 KB Output is correct
71 Correct 154 ms 23624 KB Output is correct
72 Correct 175 ms 22272 KB Output is correct
73 Correct 180 ms 22840 KB Output is correct
74 Correct 202 ms 24440 KB Output is correct
75 Correct 183 ms 19712 KB Output is correct
76 Correct 191 ms 23612 KB Output is correct
77 Correct 184 ms 23728 KB Output is correct
78 Correct 160 ms 22876 KB Output is correct
79 Correct 189 ms 24440 KB Output is correct
80 Correct 206 ms 24736 KB Output is correct
81 Correct 162 ms 19728 KB Output is correct
82 Correct 154 ms 19804 KB Output is correct
83 Correct 170 ms 19948 KB Output is correct
84 Correct 65 ms 11268 KB Output is correct