oj.uz

Submission #291694

# Submission time Handle Problem Language Result Execution time Memory
291694 2020-09-05T16:31:38 Z nvmdava Fun Tour (APIO20_fun) C++17
100 / 100
 374 ms 20464 KB 
#include "fun.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
#define ff first
#define ss second
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int d[N];
vector<int> id;
vector<pair<int, int> > ch[4];
vector<int> ans;


std::vector<int> createFunTour(int N, int Q) {
	int r = 0, cn = 0, mxw = N + 5;
	for(int i = 1; i < N; ++i){
		int w = attractionsBehind(r, i);
		if(w >= (N + 1) / 2){
			if(w < mxw){
				cn = i;
				mxw = w;
			}
		}
	}

	r = cn;

	for(int i = 0; i < N; ++i){
		if(i == r) continue;
		d[i] = hoursRequired(i, r);
		if(d[i] == 1)
			id.push_back(i);
	}
	for(int i = 0; i < N; ++i){
		if(i == r) continue;
		bool ok = 0;
		for(int j = 1; j < id.size(); ++j){
			if(d[i] - 1 == hoursRequired(id[j], i)){
				ch[j].push_back({d[i], i});
				ok = 1;
				break;
			}
		}
		if(!ok){
			ch[0].push_back({d[i], i});
		}
	}

	int szz = 0;
	if(ch[1].size() < ch[szz].size()) szz = 1;
	if(ch[2].size() < ch[szz].size()) szz = 2;
	ch[szz].push_back({d[r], r});

	for(int i = 0; i < id.size(); ++i)
		sort(ch[i].begin(), ch[i].end());

	int la = -1;

	int cnt = N;

	while(cnt){

		if(max(ch[0].size(), max(ch[1].size(), ch[2].size())) * 2 == cnt){
			break;
		}

		int now = -1;
		for(int i = 0; i < 3; ++i){
			if(la == i) continue;
			if(ch[i].empty()) continue;
			if(now == -1 || ch[now].back().ff < ch[i].back().ff)
				now = i;
		}
		la = now;
		ans.push_back(ch[now].back().ss);
		ch[now].pop_back();
		cnt--;
	}

	if(ch[0].size() < ch[1].size()){
		swap(ch[0], ch[1]);
		if(la == 0) la = 1;
		else if(la == 1) la = 0;
	}

	if(ch[0].size() < ch[2].size()){
		swap(ch[0], ch[2]);
		if(la == 0) la = 2;
		else if(la == 2) la = 0;
	}

	if(ch[1].size() < ch[2].size()){
		swap(ch[1], ch[2]);
		if(la == 1) la = 2;
		else if(la == 2) la = 1;
	}

	if(!ch[2].empty()){
		if(ch[2].back().ff > ch[1].back().ff){
			swap(ch[1], ch[2]);
			if(la == 1) la = 2;
			else if(la == 2) la = 1;
		}
	}

	if(!ch[1].empty() && (la == 0 || (la == 2 && ch[1].back().ff > ch[0].back().ff))){
		la = 1;
		ans.push_back(ch[1].back().ss);
		ch[1].pop_back();
		cnt--;
	}
	while(cnt){
		if(!ch[0].empty()){
			ans.push_back(ch[0].back().ss);
			ch[0].pop_back();
			cnt--;
		}
		if(ch[1].empty() && ch[2].empty()){
			continue;
		}
		if(ch[1].empty()){
			ans.push_back(ch[2].back().ss);
			ch[2].pop_back();
			cnt--;
			continue;
		}
		if(ch[2].empty()){
			ans.push_back(ch[1].back().ss);
			ch[1].pop_back();
			cnt--;
			continue;
		}
		if(ch[1].back().ff < ch[2].back().ff){
			swap(ch[1], ch[2]);
		}
		ans.push_back(ch[1].back().ss);
		ch[1].pop_back();
		cnt--;
	}

	return ans;
}

Compilation message

fun.cpp: In function 'std::vector<int> createFunTour(int, int)':
fun.cpp:38:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |   for(int j = 1; j < id.size(); ++j){
      |                  ~~^~~~~~~~~~~
fun.cpp:55:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |  for(int i = 0; i < id.size(); ++i)
      |                 ~~^~~~~~~~~~~
fun.cpp:64:61: warning: comparison of integer expressions of different signedness: 'long unsigned int' and 'int' [-Wsign-compare]
   64 |   if(max(ch[0].size(), max(ch[1].size(), ch[2].size())) * 2 == cnt){
      |      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 149 ms 15792 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 2 ms 640 KB Output is correct
21 Correct 5 ms 768 KB Output is correct
22 Correct 7 ms 1280 KB Output is correct
23 Correct 23 ms 2304 KB Output is correct
24 Correct 19 ms 3072 KB Output is correct
25 Correct 84 ms 9212 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 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 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 10 ms 1792 KB Output is correct
15 Correct 153 ms 15400 KB Output is correct
16 Correct 154 ms 15476 KB Output is correct
17 Correct 35 ms 3832 KB Output is correct
18 Correct 66 ms 7232 KB Output is correct
19 Correct 122 ms 12104 KB Output is correct
20 Correct 5 ms 896 KB Output is correct

Subtask #5
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 1 ms 288 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 0 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 360 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 416 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 2 ms 384 KB Output is correct
41 Correct 1 ms 384 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 149 ms 15792 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 2 ms 640 KB Output is correct
47 Correct 5 ms 768 KB Output is correct
48 Correct 7 ms 1280 KB Output is correct
49 Correct 23 ms 2304 KB Output is correct
50 Correct 19 ms 3072 KB Output is correct
51 Correct 84 ms 9212 KB Output is correct
52 Correct 1 ms 384 KB Output is correct
53 Correct 10 ms 1792 KB Output is correct
54 Correct 153 ms 15400 KB Output is correct
55 Correct 154 ms 15476 KB Output is correct
56 Correct 35 ms 3832 KB Output is correct
57 Correct 66 ms 7232 KB Output is correct
58 Correct 122 ms 12104 KB Output is correct
59 Correct 5 ms 896 KB Output is correct
60 Correct 212 ms 15604 KB Output is correct
61 Correct 243 ms 17904 KB Output is correct
62 Correct 208 ms 15472 KB Output is correct
63 Correct 229 ms 19416 KB Output is correct
64 Correct 246 ms 19432 KB Output is correct
65 Correct 241 ms 15600 KB Output is correct
66 Correct 289 ms 17904 KB Output is correct
67 Correct 266 ms 19352 KB Output is correct
68 Correct 261 ms 18568 KB Output is correct
69 Correct 374 ms 20212 KB Output is correct
70 Correct 220 ms 15728 KB Output is correct
71 Correct 249 ms 19572 KB Output is correct
72 Correct 264 ms 18032 KB Output is correct
73 Correct 274 ms 18544 KB Output is correct
74 Correct 335 ms 20208 KB Output is correct
75 Correct 231 ms 15856 KB Output is correct
76 Correct 241 ms 19312 KB Output is correct
77 Correct 257 ms 19312 KB Output is correct
78 Correct 247 ms 18984 KB Output is correct
79 Correct 318 ms 20080 KB Output is correct
80 Correct 325 ms 20464 KB Output is correct
81 Correct 223 ms 15704 KB Output is correct
82 Correct 243 ms 15856 KB Output is correct
83 Correct 249 ms 15732 KB Output is correct
84 Correct 85 ms 6736 KB Output is correct