oj.uz

답안 #568030

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
568030 2022-05-24T14:09:57 Z hhhhaura 즐거운 행로 (APIO20_fun) C++14
100 / 100
 398 ms 22196 KB 
#include "fun.h"
#define wiwihorz
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse")
#pragma loop-opt(on)
#define rep(i, a, b) for(int i = a; i <= b; i ++)
#define rrep(i, a, b) for(int i = b; i >= a; i --)
#define all(x) x.begin(), x.end()
#define ceil(a, b) ((a + b - 1) / (b))
#define ll long long int
#define lld long double
#define pii pair<int, int>
#define random mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count())
#define INF 2000000000
#define MOD 1000000007
#define eps (1e-9)
using namespace std;
#ifdef wiwihorz
#define print(a...)cerr<<"Line "<<__LINE__<<":",kout("["+string(#a)+"] = ", a)
void vprint(auto L,auto R){while(L<R)cerr<<*L<<" \n"[next(L) == R], ++L; }
void kout() { cerr << endl; }
template<class T1,class ... T2>void kout(T1 a,T2 ... e){cerr<<a<<" ",kout(e...);}
#else
#define print(...) 0
#define vprint(...) 0
#endif
vector<int> createFunTour(int N, int Q) {
	if(N == 2) return {0, 1};
	vector<int> sz(N, 0), dis(N, 0), id(N, -1), up;
	vector<vector<int>> v(3, vector<int>());
	int cen = 0, best = N, bad = -1;
	rep(i, 1, N - 1) {
		sz[i] = attractionsBehind(0, i);
		if(sz[i] * 2 >= N && best >= sz[i]) {
			cen = i, best = sz[i];
		} 
	}
	auto cmp = [&](int x, int y) {
		if(dis[x] != dis[y]) return dis[x] > dis[y];
		else return (id[x] != bad) > (id[y] != bad);
	};
	rep(i, 0, N - 1) if(cen != i) {
		dis[i] = hoursRequired(cen, i);
		if(dis[i] == 1) up.push_back(i);
	}
	rep(i, 0, N - 1) if(i != cen) {
		int L = hoursRequired(up[0], i);
		int R = hoursRequired(up[1], i);
		if(L + 1 == dis[i]) v[0].push_back(i), id[i] = 0;
		else if(R + 1 == dis[i]) v[1].push_back(i), id[i] = 1;
		else v[2].push_back(i), id[i] = 2;
	}
	vector<int> L, R, ans;
	if(up.size() == 3) {
		vector<int> piv(3, 0);
		int a = v[0].size(), b = v[1].size(), c = v[2].size();
		rep(i, 0, 2) sort(all(v[i]), cmp);
		int pre = -1, cur = 0, tot = 0;
		while(max({a - piv[0], b - piv[1], c - piv[2]})* 2 < a + b + c - tot) {
			cur = -1;
			rep(i, 0, 2) if(i != pre && piv[i] < v[i].size()) {
				if(cur == -1 || dis[v[i][piv[i]]] 
					> dis[v[cur][piv[cur]]]) cur = i;
			}
			tot ++, pre = cur;
			ans.push_back(v[cur][piv[cur] ++]);
		}
		int ok = 0;
		rep(i, 1, 2) if(v[i].size() - piv[i] 
			> v[ok].size() - piv[ok]) ok = i;
		bad = pre;
		rep(i, piv[ok], v[ok].size() - 1) L.push_back(v[ok][i]);
		rep(j, 0, 2) if(j != ok)
			rep(i, piv[j], v[j].size() - 1) R.push_back(v[j][i]);
		sort(all(R), cmp);
		if(dis[R[0]] > dis[L[0]] && id[R[0]] != pre) swap(L, R);
	}
	else L = v[0], R = v[1];
	if(L.size() < R.size()) swap(L, R);
	sort(all(R), cmp);
	sort(all(L), cmp);
	int l = 0, r = 0;
	while(l < L.size()) {
		if(l < L.size()) ans.push_back(L[l++]);
		if(r < R.size()) ans.push_back(R[r++]);
	}
	ans.push_back(cen);
	return ans;
}

Compilation message

fun.cpp:6: warning: ignoring '#pragma loop ' [-Wunknown-pragmas]
    6 | #pragma loop-opt(on)
      | 
fun.cpp:21:13: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   21 | void vprint(auto L,auto R){while(L<R)cerr<<*L<<" \n"[next(L) == R], ++L; }
      |             ^~~~
fun.cpp:21:20: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   21 | void vprint(auto L,auto R){while(L<R)cerr<<*L<<" \n"[next(L) == R], ++L; }
      |                    ^~~~
fun.cpp: In function 'std::vector<int> createFunTour(int, int)':
fun.cpp:62:39: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |    rep(i, 0, 2) if(i != pre && piv[i] < v[i].size()) {
fun.cpp:7:39: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | #define rep(i, a, b) for(int i = a; i <= b; i ++)
......
   73 |   rep(i, piv[ok], v[ok].size() - 1) L.push_back(v[ok][i]);
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~     
fun.cpp:73:3: note: in expansion of macro 'rep'
   73 |   rep(i, piv[ok], v[ok].size() - 1) L.push_back(v[ok][i]);
      |   ^~~
fun.cpp:7:39: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | #define rep(i, a, b) for(int i = a; i <= b; i ++)
......
   75 |    rep(i, piv[j], v[j].size() - 1) R.push_back(v[j][i]);
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~      
fun.cpp:75:4: note: in expansion of macro 'rep'
   75 |    rep(i, piv[j], v[j].size() - 1) R.push_back(v[j][i]);
      |    ^~~
fun.cpp:84:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |  while(l < L.size()) {
      |        ~~^~~~~~~~~~
fun.cpp:85:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |   if(l < L.size()) ans.push_back(L[l++]);
      |      ~~^~~~~~~~~~
fun.cpp:86:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |   if(r < R.size()) ans.push_back(R[r++]);
      |      ~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 120 ms 15824 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 3 ms 468 KB Output is correct
21 Correct 4 ms 596 KB Output is correct
22 Correct 6 ms 1196 KB Output is correct
23 Correct 12 ms 2260 KB Output is correct
24 Correct 15 ms 2900 KB Output is correct
25 Correct 61 ms 9156 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 9 ms 1748 KB Output is correct
15 Correct 135 ms 15816 KB Output is correct
16 Correct 152 ms 15640 KB Output is correct
17 Correct 35 ms 3924 KB Output is correct
18 Correct 61 ms 7316 KB Output is correct
19 Correct 102 ms 12264 KB Output is correct
20 Correct 5 ms 868 KB Output is correct

Subtask #5
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 120 ms 15824 KB Output is correct
45 Correct 2 ms 340 KB Output is correct
46 Correct 3 ms 468 KB Output is correct
47 Correct 4 ms 596 KB Output is correct
48 Correct 6 ms 1196 KB Output is correct
49 Correct 12 ms 2260 KB Output is correct
50 Correct 15 ms 2900 KB Output is correct
51 Correct 61 ms 9156 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 9 ms 1748 KB Output is correct
54 Correct 135 ms 15816 KB Output is correct
55 Correct 152 ms 15640 KB Output is correct
56 Correct 35 ms 3924 KB Output is correct
57 Correct 61 ms 7316 KB Output is correct
58 Correct 102 ms 12264 KB Output is correct
59 Correct 5 ms 868 KB Output is correct
60 Correct 183 ms 17240 KB Output is correct
61 Correct 270 ms 19672 KB Output is correct
62 Correct 208 ms 17208 KB Output is correct
63 Correct 232 ms 21104 KB Output is correct
64 Correct 281 ms 21068 KB Output is correct
65 Correct 211 ms 17328 KB Output is correct
66 Correct 252 ms 19564 KB Output is correct
67 Correct 256 ms 21408 KB Output is correct
68 Correct 234 ms 20476 KB Output is correct
69 Correct 398 ms 21936 KB Output is correct
70 Correct 230 ms 17020 KB Output is correct
71 Correct 257 ms 20852 KB Output is correct
72 Correct 272 ms 19920 KB Output is correct
73 Correct 275 ms 20476 KB Output is correct
74 Correct 378 ms 21700 KB Output is correct
75 Correct 212 ms 17396 KB Output is correct
76 Correct 293 ms 21216 KB Output is correct
77 Correct 271 ms 21236 KB Output is correct
78 Correct 235 ms 20544 KB Output is correct
79 Correct 277 ms 21776 KB Output is correct
80 Correct 294 ms 22196 KB Output is correct
81 Correct 183 ms 16836 KB Output is correct
82 Correct 174 ms 16936 KB Output is correct
83 Correct 178 ms 17092 KB Output is correct
84 Correct 69 ms 7292 KB Output is correct