oj.uz

답안 #935241

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
935241 2024-02-29T00:37:26 Z MinaRagy06 즐거운 행로 (APIO20_fun) C++17
100 / 100
 174 ms 21528 KB 
#include <bits/stdc++.h>
#ifdef MINA
#include "grader.cpp"
#endif
#include "fun.h"
using namespace std;
#define ll long long
#define sz(x) (int) x.size()

int n;
vector<int> ans;
const int MAXN = 100'005;
vector<int> gud[3];
int dist[MAXN], comp[MAXN];
int c, lst = -1;
void solve() {
	if (sz(gud[1]) < sz(gud[0])) {
		swap(gud[0], gud[1]);
		if (lst != -1) lst = !lst;
	}
	if (sz(gud[1]) > sz(gud[0])) lst = 0;
// 	for (auto i : gud[0]) {
// 		cout << dist[i] << ' ';
// 	}
// 	cout << '\n';
// 	for (auto i : gud[1]) {
// 		cout << dist[i] << ' ';
// 	}
// 	cout << '\n';
// 	for (auto i : ans) {
// 		cout << i << ' ';
// 	}
// 	cout << '\n';
	while (sz(gud[0]) || sz(gud[1])) {
		array<int, 3> mx = {-1, -1, -1};
		for (int k = 0; k < 2; k++) {
			if (lst == k || gud[k].empty()) continue;
			mx = max(mx, {dist[gud[k].back()], k, gud[k].back()});
		}
		lst = mx[1];
		ans.push_back(mx[2]);
		gud[lst].pop_back();
	}
	ans.push_back(c);
// 	for (auto i : ans) {
// 		cout << i << ' ';
// 	}
// 	cout << '\n';
}
vector<int> createFunTour(int _n, int q) {
	n = _n;
	array<int, 2> mn = {(int)1e9, -1};
	for (int i = 0; i < n; i++) {
		int sz = attractionsBehind(0, i);
		if (sz >= (n + 1) / 2) {
			mn = min(mn, {sz, i});
		}
	}
	c = mn[1];
	vector<int> v;
	for (int i = 0; i < n; i++) {
		dist[i] = hoursRequired(c, i);
		if (dist[i] == 1) v.push_back(i);
	}
	for (int i = 0; i < n; i++) {
		if (i == c) continue;
		if (hoursRequired(i, v[0]) + 1 == dist[i]) {
			comp[i] = 0;
			gud[0].push_back(i);
		} else if (hoursRequired(i, v[1]) + 1 == dist[i]) {
			comp[i] = 1;
			gud[1].push_back(i);
		} else {
			comp[i] = 2;
			gud[2].push_back(i);
		}
	}
	if (gud[2].empty()) {
		for (int k = 0; k < 3; k++) {
			sort(gud[k].begin(), gud[k].end(), [&] (int x, int y) {return dist[x] < dist[y];});
		}
		solve();
		return ans;
	}
	for (int k = 0; k < 3; k++) {
		sort(gud[k].begin(), gud[k].end(), [&] (int x, int y) {return dist[x] < dist[y];});
	}
	int mxm;
	while ((mxm = max({sz(gud[0]), sz(gud[1]), sz(gud[2])})) < sz(gud[0]) + sz(gud[1]) + sz(gud[2]) - mxm) {
		array<int, 3> mx = {-1, -1, -1};
		for (int k = 0; k < 3; k++) {
			if (lst == k || gud[k].empty()) continue;
			mx = max(mx, {dist[gud[k].back()], gud[k].back(), k});
		}
		lst = mx[2];
		ans.push_back(mx[1]);
		gud[lst].pop_back();
	}
	if (sz(gud[0]) + sz(gud[1]) + sz(gud[2]) == 0) return ans;
	int LST = lst;
	for (int k = 0; k < 3; k++) {
		if (sz(gud[k]) == mxm) {
			vector<int> v2;
			for (int j = 0; j < 3; j++) if (j != k) v2.push_back(j);
			if (lst == v2.back()) lst = v2[0];
			for (auto j : gud[v2.back()]) gud[v2[0]].push_back(j);
			gud[v2.back()].clear();
			break;
		}
	}
	for (int k = 0; k < 3; k++) {
		sort(gud[k].begin(), gud[k].end(), [&] (int x, int y) {return dist[x] < dist[y];});
	}
// 	cout << lst << '\n';
// 	for (auto i : gud[0]) {
// 		cout << dist[i] << ' ';
// 	}
// 	cout << '\n';
// 	for (auto i : gud[1]) {
// 		cout << dist[i] << ' '; 
// 	}
// 	cout << '\n';
// 	for (auto i : gud[2]) {
// 		cout << dist[i] << ' ';
// 	}
// 	cout << '\n';
	if (lst != -1) {
		for (int i = sz(gud[lst]) - 1; i >= 0; i--) {
			if (dist[gud[lst][i]] != dist[gud[lst].back()]) break;
			if (comp[gud[lst][i]] != LST) {
				swap(gud[lst][i], gud[lst][sz(gud[lst]) - 1]);
				lst = -1;
				break;
			}
		}
	}
// 	cout << ">>> ";
// 	for (auto i : ans) cout << i << ' ';
// 	cout << '\n';
	if (gud[0].empty()) {
		swap(gud[0], gud[2]);
		if (lst == 2) lst = 0;
	}
	if (gud[1].empty()) {
		swap(gud[1], gud[2]);
		if (lst == 2) lst = 1;
	}
	solve();
	return ans;
}

Compilation message

fun.cpp: In function 'std::vector<int> createFunTour(int, int)':
fun.cpp:89:14: warning: operation on 'mxm' may be undefined [-Wsequence-point]
   89 |  while ((mxm = max({sz(gud[0]), sz(gud[1]), sz(gud[2])})) < sz(gud[0]) + sz(gud[1]) + sz(gud[2]) - mxm) {
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
fun.cpp:89:14: warning: operation on 'mxm' may be undefined [-Wsequence-point]

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 592 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 592 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 504 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 544 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 376 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 504 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 86 ms 15560 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 2 ms 600 KB Output is correct
21 Correct 2 ms 860 KB Output is correct
22 Correct 4 ms 1368 KB Output is correct
23 Correct 8 ms 2376 KB Output is correct
24 Correct 11 ms 2908 KB Output is correct
25 Correct 49 ms 9116 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 544 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 7 ms 1784 KB Output is correct
15 Correct 92 ms 15544 KB Output is correct
16 Correct 102 ms 15308 KB Output is correct
17 Correct 19 ms 4440 KB Output is correct
18 Correct 45 ms 7684 KB Output is correct
19 Correct 69 ms 13088 KB Output is correct
20 Correct 3 ms 860 KB Output is correct

Subtask #5
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 592 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 504 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 544 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 376 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 86 ms 15560 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 2 ms 600 KB Output is correct
47 Correct 2 ms 860 KB Output is correct
48 Correct 4 ms 1368 KB Output is correct
49 Correct 8 ms 2376 KB Output is correct
50 Correct 11 ms 2908 KB Output is correct
51 Correct 49 ms 9116 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 7 ms 1784 KB Output is correct
54 Correct 92 ms 15544 KB Output is correct
55 Correct 102 ms 15308 KB Output is correct
56 Correct 19 ms 4440 KB Output is correct
57 Correct 45 ms 7684 KB Output is correct
58 Correct 69 ms 13088 KB Output is correct
59 Correct 3 ms 860 KB Output is correct
60 Correct 113 ms 16972 KB Output is correct
61 Correct 169 ms 19256 KB Output is correct
62 Correct 126 ms 16660 KB Output is correct
63 Correct 142 ms 20700 KB Output is correct
64 Correct 147 ms 20700 KB Output is correct
65 Correct 132 ms 16840 KB Output is correct
66 Correct 159 ms 19172 KB Output is correct
67 Correct 138 ms 20972 KB Output is correct
68 Correct 152 ms 19912 KB Output is correct
69 Correct 174 ms 21436 KB Output is correct
70 Correct 121 ms 16584 KB Output is correct
71 Correct 129 ms 20608 KB Output is correct
72 Correct 154 ms 19144 KB Output is correct
73 Correct 142 ms 19656 KB Output is correct
74 Correct 167 ms 21528 KB Output is correct
75 Correct 133 ms 16808 KB Output is correct
76 Correct 125 ms 20424 KB Output is correct
77 Correct 151 ms 20764 KB Output is correct
78 Correct 137 ms 19916 KB Output is correct
79 Correct 156 ms 21192 KB Output is correct
80 Correct 163 ms 21336 KB Output is correct
81 Correct 117 ms 16552 KB Output is correct
82 Correct 118 ms 16584 KB Output is correct
83 Correct 130 ms 16840 KB Output is correct
84 Correct 50 ms 7100 KB Output is correct