oj.uz

Submission #387123

# Submission time Handle Problem Language Result Execution time Memory
387123 2021-04-08T02:09:53 Z rainboy Fun Tour (APIO20_fun) C++11
100 / 100
 334 ms 20964 KB 
#include "fun.h"
#include <cassert>
#include <vector>

using namespace std;

const int N = 100000;

unsigned int X = 12345;

int rand_() {
	return (X *= 3) >> 1;
}

int dd[N];

void sort(int *ii, int l, int r) {
	while (l < r) {
		int i = l, j = l, k = r, i_ = ii[l + rand_() % (r - l)], tmp;

		while (j < k)
			if (dd[ii[j]] == dd[i_])
				j++;
			else if (dd[ii[j]] < dd[i_]) {
				tmp = ii[i], ii[i] = ii[j], ii[j] = tmp;
				i++, j++;
			} else {
				k--;
				tmp = ii[j], ii[j] = ii[k], ii[k] = tmp;
			}
		sort(ii, l, i);
		l = k;
	}
}

vector<int> createFunTour(int n, int q) {
	static int type[N], qu[3][N], cnt[3];
	vector<int> pp = vector<int>(n);
	int n_, h, h_, i, i_, u, a, b, c, sz_;

	q = -1;
	sz_ = n + 1, u = -1;
	for (i = 0; i < n; i++) {
		int sz = attractionsBehind(0, i);

		if ((n - sz) * 2 <= n && sz_ > sz)
			sz_ = sz, u = i;
	}
	a = -1, b = -1, c = -1;
	for (i = 0; i < n; i++)
		if (i != u) {
			dd[i] = hoursRequired(u, i);
			if (dd[i] == 1) {
				if (a == -1)
					a = i;
				else if (b == -1)
					b = i;
				else
					c = i;
			}
		}
	for (i = 0; i < n; i++)
		if (i != u) {
			if (hoursRequired(a, i) == dd[i] - 1)
				type[i] = 0, qu[0][cnt[0]++] = i;
			else if (hoursRequired(b, i) == dd[i] - 1)
				type[i] = 1, qu[1][cnt[1]++] = i;
			else
				type[i] = 2, qu[2][cnt[2]++] = i;
		}
	for (h = 0; h < 3; h++)
		sort(qu[h], 0, cnt[h]);
	i_ = -1;
	for (h = 0; h < 3; h++)
		if (cnt[h]) {
			i = qu[h][cnt[h] - 1];
			if (i_ == -1 || dd[i_] < dd[i])
				i_ = i;
		}
	h_ = -1;
	for (h = 0; h < 3; h++)
		if (cnt[h] >= cnt[(h + 1) % 3] + cnt[(h + 2) % 3]) {
			h_ = h;
			break;
		}
	n_ = 0;
	if (h_ == -1) {
		i = i_;
		while (1) {
			pp[n_++] = i, cnt[h_ = type[i]]--;
			if (n == n_)
				break;
			i_ = -1;
			for (h = 0; h < 3; h++)
				if (h != h_ && cnt[h]) {
					int i1 = qu[h][cnt[h] - 1];

					if (i_ == -1 || dd[i_] < dd[i1])
						i_ = i1;
				}
			for (h = 0; h < 3; h++)
				if (h != type[i_] && cnt[h] == cnt[(h + 1) % 3] + cnt[(h + 2) % 3]) {
					if (dd[i] < dd[i_])
						pp[n_++] = i_, cnt[type[i_]]--;
					h_ = h;
					goto out;
				}
			i = i_;
		}
out:;
	}
	while (cnt[h_]) {
		int h1, h2;

		pp[n_++] = cnt[h_] == 0 ? u : qu[h_][--cnt[h_]];
		if (n - n_ == 1)
			break;
		h1 = (h_ + 1) % 3, h2 = (h_ + 2) % 3;
		pp[n_++] = !cnt[h2] || cnt[h1] && dd[qu[h1][cnt[h1] - 1]] > dd[qu[h2][cnt[h2] - 1]] ? qu[h1][--cnt[h1]] : qu[h2][--cnt[h2]];
	}
	pp[n_++] = u;
	return pp;
}

Compilation message

fun.cpp: In function 'std::vector<int> createFunTour(int, int)':
fun.cpp:119:34: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  119 |   pp[n_++] = !cnt[h2] || cnt[h1] && dd[qu[h1][cnt[h1] - 1]] > dd[qu[h2][cnt[h2] - 1]] ? qu[h1][--cnt[h1]] : qu[h2][--cnt[h2]];
      |                          ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
fun.cpp:39:33: warning: variable 'c' set but not used [-Wunused-but-set-variable]
   39 |  int n_, h, h_, i, i_, u, a, b, c, sz_;
      |                                 ^

Subtask #1
10.0 / 10.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 127 ms 14820 KB Output is correct
19 Correct 2 ms 492 KB Output is correct
20 Correct 2 ms 620 KB Output is correct
21 Correct 5 ms 748 KB Output is correct
22 Correct 7 ms 1260 KB Output is correct
23 Correct 13 ms 2156 KB Output is correct
24 Correct 20 ms 2796 KB Output is correct
25 Correct 72 ms 8708 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 2 ms 492 KB Output is correct
14 Correct 10 ms 1772 KB Output is correct
15 Correct 146 ms 15972 KB Output is correct
16 Correct 150 ms 15876 KB Output is correct
17 Correct 27 ms 4096 KB Output is correct
18 Correct 64 ms 7476 KB Output is correct
19 Correct 109 ms 12476 KB Output is correct
20 Correct 5 ms 876 KB Output is correct

Subtask #5
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 2 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 2 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 127 ms 14820 KB Output is correct
45 Correct 2 ms 492 KB Output is correct
46 Correct 2 ms 620 KB Output is correct
47 Correct 5 ms 748 KB Output is correct
48 Correct 7 ms 1260 KB Output is correct
49 Correct 13 ms 2156 KB Output is correct
50 Correct 20 ms 2796 KB Output is correct
51 Correct 72 ms 8708 KB Output is correct
52 Correct 2 ms 492 KB Output is correct
53 Correct 10 ms 1772 KB Output is correct
54 Correct 146 ms 15972 KB Output is correct
55 Correct 150 ms 15876 KB Output is correct
56 Correct 27 ms 4096 KB Output is correct
57 Correct 64 ms 7476 KB Output is correct
58 Correct 109 ms 12476 KB Output is correct
59 Correct 5 ms 876 KB Output is correct
60 Correct 196 ms 15964 KB Output is correct
61 Correct 236 ms 18404 KB Output is correct
62 Correct 203 ms 15972 KB Output is correct
63 Correct 224 ms 19960 KB Output is correct
64 Correct 238 ms 19940 KB Output is correct
65 Correct 215 ms 16068 KB Output is correct
66 Correct 260 ms 18276 KB Output is correct
67 Correct 239 ms 19940 KB Output is correct
68 Correct 238 ms 19172 KB Output is correct
69 Correct 318 ms 20580 KB Output is correct
70 Correct 186 ms 15972 KB Output is correct
71 Correct 220 ms 19940 KB Output is correct
72 Correct 260 ms 18532 KB Output is correct
73 Correct 257 ms 19148 KB Output is correct
74 Correct 334 ms 20964 KB Output is correct
75 Correct 219 ms 15972 KB Output is correct
76 Correct 222 ms 19940 KB Output is correct
77 Correct 251 ms 20068 KB Output is correct
78 Correct 237 ms 19172 KB Output is correct
79 Correct 308 ms 20836 KB Output is correct
80 Correct 308 ms 20964 KB Output is correct
81 Correct 197 ms 16100 KB Output is correct
82 Correct 203 ms 16100 KB Output is correct
83 Correct 227 ms 16100 KB Output is correct
84 Correct 74 ms 6852 KB Output is correct