oj.uz

답안 #833036

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
833036 2023-08-21T20:13:21 Z Antekb 즐거운 행로 (APIO20_fun) C++17
100 / 100
 181 ms 27084 KB 
#include<bits/stdc++.h>
#include "fun.h"
#define st first
#define nd second
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define eb emplace_back
#define pp pop_back
#define mp make_pair
using namespace std;
using pii = pair<int, int>;
using ll = long long;
using vi = vector<int>;
using vii = vector<pii>;
void debug(){cerr<<"\n";}
template<typename H, typename... T>
void debug(H h, T... t){
	cerr<<h;
	if(sizeof...(t)){
		cerr<<", ";
	}
	debug(t...);
}
#define deb(x...) cerr<<#x<<" = ";debug(x);

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());


std::vector<int> createFunTour(int n, int Q) {
	if(n==2)return {0, 1};
	//int H = hoursRequired(0, N - 1);
	//int A = attractionsBehind(0, N - 1);
	vi siz(n), dep(n), typ(n);
	siz[0]=n;
	int cent=0;
	for(int i=1; i<n; i++){
		siz[i]=attractionsBehind(0, i);
		if(2*siz[i]>=n && siz[i]<siz[cent])cent=i;
	}
	vi kto;
	for(int i=0; i<n; i++){
		if(i!=cent)dep[i]=hoursRequired(cent, i);
		if(dep[i]==1)kto.pb(i);
	}
	set<pii> S[3];
	for(int i=0; i<kto.size(); i++){
		S[i].insert(mp(1, kto[i]));
		typ[kto[i]]=i;
	}
	typ[cent]=-1;
	for(int i=0; i<n; i++){
		if(dep[i]>1){
			if(attractionsBehind(i, kto[0])*2>n){
				S[0].insert(mp(dep[i], i));
				typ[i]=0;
			}
			else if(attractionsBehind(i, kto[1])*2>n){
				S[1].insert(mp(dep[i], i));
				typ[i]=1;
			}
			else{
				S[2].insert(mp(dep[i], i));
				typ[i]=2;
			}
		}
	}
	vi ans;
	int lst=0, opt=S[0].crbegin()->st;
	for(int i=1; i<kto.size(); i++)if(opt<S[i].crbegin()->st){
		lst=i;
		opt=S[i].crbegin()->st;
	}
	ans.pb(S[lst].crbegin()->nd);
	S[lst].erase(--S[lst].end());
	while(max({S[0].size(), S[1].size(), S[2].size()})*2<S[0].size()+S[1].size()+S[2].size()){
		int akt=(lst+1)%3;
		opt=S[akt].crbegin()->st;
		if(opt<S[(akt+1)%3].crbegin()->st){
			akt=(akt+1)%3;
			opt=S[(akt+1)%3].crbegin()->st;
		}
		lst=akt;
		ans.pb(S[lst].crbegin()->nd);
		S[lst].erase(--S[lst].end());
	}
	if(S[0].size()<S[1].size()){
		swap(S[0], S[1]);
		if(lst==0 || lst==1)lst^=1;
	}
	if(S[0].size()<S[2].size()){
		swap(S[0], S[2]);
		if(lst==0 || lst==2)lst^=2;
	}
	if(lst!=0 && S[lst^3].size() && S[lst^3].crbegin()->st>dep[ans.back()]){
		ans.pb(S[lst^3].crbegin()->nd);
		S[lst^3].erase(--S[lst^3].end());
		lst^=3;
	}
	for(auto i:S[2]){
		S[1].insert(i);
	}
	if(S[0].size()>S[1].size())S[1].insert(mp(0, cent));
	else if(S[0].size()<S[1].size())S[0].insert(mp(0, cent));
	else if(lst==0)S[1].insert(mp(0, cent));
	else S[0].insert(mp(0, cent));
	lst=min(lst, 1);
	while(ans.size()<n){
		lst^=1;
		ans.pb(S[lst].crbegin()->nd);
		S[lst].erase(--S[lst].end());
	}
	for(int i=1; i<n; i++){
		//deb(ans[i], ans[i-1], hoursRequired(ans[i], ans[i-1]))
	}
	for(int i:ans){
		//cerr<<i<<" ";
	}
	return ans;
}

Compilation message

fun.cpp: In function 'std::vector<int> createFunTour(int, int)':
fun.cpp:46:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |  for(int i=0; i<kto.size(); i++){
      |               ~^~~~~~~~~~~
fun.cpp:69:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |  for(int i=1; i<kto.size(); i++)if(opt<S[i].crbegin()->st){
      |               ~^~~~~~~~~~~
fun.cpp:107:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  107 |  while(ans.size()<n){
      |        ~~~~~~~~~~^~
fun.cpp:115:10: warning: unused variable 'i' [-Wunused-variable]
  115 |  for(int i:ans){
      |          ^

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 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 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 1 ms 212 KB Output is correct
12 Correct 1 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 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 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 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 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 1 ms 212 KB Output is correct
12 Correct 1 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 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 2 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 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 340 KB Output is correct
32 Correct 1 ms 340 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 340 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 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 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 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 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 98 ms 20164 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 3 ms 724 KB Output is correct
22 Correct 5 ms 1492 KB Output is correct
23 Correct 10 ms 2800 KB Output is correct
24 Correct 13 ms 3644 KB Output is correct
25 Correct 55 ms 11744 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 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 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 2 ms 560 KB Output is correct
14 Correct 8 ms 2260 KB Output is correct
15 Correct 110 ms 21172 KB Output is correct
16 Correct 101 ms 20936 KB Output is correct
17 Correct 19 ms 5204 KB Output is correct
18 Correct 43 ms 9748 KB Output is correct
19 Correct 81 ms 16452 KB Output is correct
20 Correct 4 ms 980 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 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 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 1 ms 212 KB Output is correct
12 Correct 1 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 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 2 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 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 340 KB Output is correct
32 Correct 1 ms 340 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 340 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 98 ms 20164 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 2 ms 596 KB Output is correct
47 Correct 3 ms 724 KB Output is correct
48 Correct 5 ms 1492 KB Output is correct
49 Correct 10 ms 2800 KB Output is correct
50 Correct 13 ms 3644 KB Output is correct
51 Correct 55 ms 11744 KB Output is correct
52 Correct 2 ms 560 KB Output is correct
53 Correct 8 ms 2260 KB Output is correct
54 Correct 110 ms 21172 KB Output is correct
55 Correct 101 ms 20936 KB Output is correct
56 Correct 19 ms 5204 KB Output is correct
57 Correct 43 ms 9748 KB Output is correct
58 Correct 81 ms 16452 KB Output is correct
59 Correct 4 ms 980 KB Output is correct
60 Correct 146 ms 21296 KB Output is correct
61 Correct 141 ms 23592 KB Output is correct
62 Correct 132 ms 21060 KB Output is correct
63 Correct 152 ms 25088 KB Output is correct
64 Correct 155 ms 24984 KB Output is correct
65 Correct 143 ms 22004 KB Output is correct
66 Correct 153 ms 24484 KB Output is correct
67 Correct 159 ms 26908 KB Output is correct
68 Correct 154 ms 25540 KB Output is correct
69 Correct 179 ms 27084 KB Output is correct
70 Correct 129 ms 21160 KB Output is correct
71 Correct 146 ms 25024 KB Output is correct
72 Correct 165 ms 23644 KB Output is correct
73 Correct 160 ms 25664 KB Output is correct
74 Correct 181 ms 25796 KB Output is correct
75 Correct 164 ms 21836 KB Output is correct
76 Correct 147 ms 25208 KB Output is correct
77 Correct 179 ms 27004 KB Output is correct
78 Correct 152 ms 24904 KB Output is correct
79 Correct 171 ms 25652 KB Output is correct
80 Correct 176 ms 25924 KB Output is correct
81 Correct 126 ms 21060 KB Output is correct
82 Correct 133 ms 21120 KB Output is correct
83 Correct 142 ms 21120 KB Output is correct
84 Correct 59 ms 8992 KB Output is correct