oj.uz

Submission #566824

# Submission time Handle Problem Language Result Execution time Memory
566824 2022-05-23T00:55:24 Z zaneyu Fun Tour (APIO20_fun) C++14
100 / 100
 260 ms 22612 KB 
#include "fun.h"

#include <bits/stdc++.h>
#define pb push_back
#define sz(x) (int)x.size()
#define REP1(i,n) for(int i=1;i<=n;i++)
#define pii pair<int,int>
#define s second
#define MNTO(x,y) x=min(x,y)
#define ALL(x) x.begin(),x.end()
using namespace std;
const int maxn=1e5+5;
#define REP(i,n) for(int i=0;i<n;i++)
int d[maxn],p[maxn];
vector<int> t[maxn];
bool cmp(int a,int b){
	return d[a]<d[b];
}
bool cmp2(int a,int b){
	return sz(t[a])>sz(t[b]);
}
bool cmp3(int a,int b){
	return d[t[a].back()]>d[t[b].back()];
}
vector<int> createFunTour(int n, int q) {
	pii mn={INT_MAX,-1};
	REP(i,n){
		int sz=attractionsBehind(0,i);
		if(sz>n/2) MNTO(mn,make_pair(sz,i));
	}
	int c=mn.s;
	vector<int> v;
	REP(i,n){
		d[i]=hoursRequired(c,i);
		if(d[i]==1) v.pb(i);
	}
	REP(i,n){
		if(i==c) continue;
		while(p[i]<sz(v)-1 and hoursRequired(v[p[i]],i)>d[i]) ++p[i];
		t[p[i]].pb(i);
	}
	int ord[3]={0,1,2};
	REP(i,3) sort(ALL(t[i]),cmp);
	sort(ord,ord+3,cmp2);
	vector<int> ans;
	int pv=-1;
	while(sz(t[ord[0]])<sz(t[ord[1]])+sz(t[ord[2]])){
		sort(ord,ord+3,cmp3);
		int i=(pv==ord[0]);
		ans.pb(t[ord[i]].back());
		t[ord[i]].pop_back();
		pv=ord[i];
		sort(ord,ord+3,cmp2);
	}
	t[ord[1]].insert(t[ord[1]].end(),ALL(t[ord[2]]));
	sort(ALL(t[ord[1]]),cmp);
	int st=0;
	if(sz(ans) and d[ans.back()]<d[t[ord[1]].back()]) st=1;
	while(sz(t[ord[st]])){
		ans.pb(t[ord[st]].back());
		t[ord[st]].pop_back();
		st=1-st;
	}
	ans.pb(c);
	return ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 1 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 1 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 111 ms 17628 KB Output is correct
19 Correct 2 ms 2772 KB Output is correct
20 Correct 3 ms 2900 KB Output is correct
21 Correct 4 ms 3028 KB Output is correct
22 Correct 6 ms 3540 KB Output is correct
23 Correct 13 ms 4584 KB Output is correct
24 Correct 17 ms 5204 KB Output is correct
25 Correct 68 ms 11168 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2772 KB Output is correct
14 Correct 10 ms 4052 KB Output is correct
15 Correct 126 ms 17512 KB Output is correct
16 Correct 135 ms 17320 KB Output is correct
17 Correct 26 ms 6164 KB Output is correct
18 Correct 55 ms 9380 KB Output is correct
19 Correct 93 ms 14364 KB Output is correct
20 Correct 5 ms 3156 KB Output is correct

Subtask #5
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 1 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 1 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 1 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Correct 1 ms 2644 KB Output is correct
22 Correct 1 ms 2644 KB Output is correct
23 Correct 2 ms 2644 KB Output is correct
24 Correct 2 ms 2644 KB Output is correct
25 Correct 1 ms 2644 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 2 ms 2644 KB Output is correct
29 Correct 2 ms 2644 KB Output is correct
30 Correct 2 ms 2644 KB Output is correct
31 Correct 2 ms 2644 KB Output is correct
32 Correct 2 ms 2644 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 2 ms 2644 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct
36 Correct 2 ms 2644 KB Output is correct
37 Correct 1 ms 2644 KB Output is correct
38 Correct 2 ms 2644 KB Output is correct
39 Correct 2 ms 2644 KB Output is correct
40 Correct 2 ms 2644 KB Output is correct
41 Correct 2 ms 2644 KB Output is correct
42 Correct 2 ms 2644 KB Output is correct
43 Correct 2 ms 2644 KB Output is correct
44 Correct 111 ms 17628 KB Output is correct
45 Correct 2 ms 2772 KB Output is correct
46 Correct 3 ms 2900 KB Output is correct
47 Correct 4 ms 3028 KB Output is correct
48 Correct 6 ms 3540 KB Output is correct
49 Correct 13 ms 4584 KB Output is correct
50 Correct 17 ms 5204 KB Output is correct
51 Correct 68 ms 11168 KB Output is correct
52 Correct 2 ms 2772 KB Output is correct
53 Correct 10 ms 4052 KB Output is correct
54 Correct 126 ms 17512 KB Output is correct
55 Correct 135 ms 17320 KB Output is correct
56 Correct 26 ms 6164 KB Output is correct
57 Correct 55 ms 9380 KB Output is correct
58 Correct 93 ms 14364 KB Output is correct
59 Correct 5 ms 3156 KB Output is correct
60 Correct 144 ms 17880 KB Output is correct
61 Correct 171 ms 20060 KB Output is correct
62 Correct 145 ms 17932 KB Output is correct
63 Correct 163 ms 21820 KB Output is correct
64 Correct 157 ms 21680 KB Output is correct
65 Correct 171 ms 17764 KB Output is correct
66 Correct 181 ms 20056 KB Output is correct
67 Correct 176 ms 21800 KB Output is correct
68 Correct 188 ms 21020 KB Output is correct
69 Correct 222 ms 22460 KB Output is correct
70 Correct 148 ms 17792 KB Output is correct
71 Correct 163 ms 21640 KB Output is correct
72 Correct 220 ms 20348 KB Output is correct
73 Correct 191 ms 20972 KB Output is correct
74 Correct 203 ms 22612 KB Output is correct
75 Correct 159 ms 17864 KB Output is correct
76 Correct 194 ms 21748 KB Output is correct
77 Correct 181 ms 21700 KB Output is correct
78 Correct 166 ms 21008 KB Output is correct
79 Correct 260 ms 22444 KB Output is correct
80 Correct 207 ms 22564 KB Output is correct
81 Correct 158 ms 17580 KB Output is correct
82 Correct 157 ms 17756 KB Output is correct
83 Correct 170 ms 17956 KB Output is correct
84 Correct 63 ms 8956 KB Output is correct