oj.uz

Submission #745393

# Submission time Handle Problem Language Result Execution time Memory
745393 2023-05-20T00:57:59 Z oolimry Archery (IOI09_archery) C++17
96 / 100
 2000 ms 41088 KB 
#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int) (x).size()
#define all(x) (x).begin(), (x).end()
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
typedef long long lint;
typedef pair<lint,lint> ii;


int arr[400005];
int target[400005];
int n, R; 
int me;

inline int bruhmod(int x){
	int res = x%n;
	if(res <= 0) res += n;
	return res;
}

///for strong
vector<int> candidates[800005];

inline int solve(int s){
	//return debuggingstuff[s];
	target[me] = s;
	for(int i = 1;i <= 2*n;i++){
		int newi = i + (i >= 2*s);
		target[arr[i]] = (newi+1)/2;
	}
	
	
	if(me >= n+2){ ///weak
		set<int> available;
		for(int i = 2;i <= n;i++) available.insert(i);
		
		for(int i = 2*n;i >= me;i--){
			auto it = available.upper_bound(target[i]);
			
			bool looparound = false;
			
			if(it == available.begin()){
				it = --available.end();
				looparound = true;
			}
			else it--;
						
			if(i == me) return *it - (looparound * n);
			available.erase(it);
		}
	}
	else{ ///strong
		for(int i = 1;i <= 3*n;i++) candidates[i].clear();
		
		for(int i = 1;i <= 2*n;i++){
			candidates[target[i]].push_back((i > me) + (i >= me));
		}
		
		if(candidates[1][0] < candidates[1][1]) swap(candidates[1][0], candidates[1][1]);
		int winner = candidates[1][1]; candidates[1].pop_back();
		
		int looparounds = 0;
		
		vector<int> choices = {0,0,0};
		for(int turn = 1;turn <= 3*n;turn++){
			for(int x : candidates[turn]){
				choices[x]++;
			}
			
			int t = 0;
			while(choices[t] == 0) t++;
			choices[t]--;
			
			if(turn >= 2*n and t == 1){
				int turnsleft = R-turn+1;
				
				looparounds += (turnsleft + n - 1) / n;
				
				turnsleft %= n;
								
				int res = (1-turnsleft+n) % n;
				if(res == 0) res = n;
				return res -  n * looparounds;
			}
			
			if(t < winner) swap(t, winner);
			if(t == 1) looparounds++;
			
			if(turn < 2*n) candidates[turn+n].push_back(t);
		}
	}
	assert(false);
	return -4;
}

inline int bsta(int x){ ///find last position <= x
	int low = 0, high = n+1;
		
	while(low < high-1){
		int mid = (low+high)/2;
		
		if(solve(mid) <= x) low = mid;
		else high = mid;
	}
	
	return low;
}

int bestPos = -1;
int bestVal = 1;
inline void consider(int pos){
	int val = solve(pos);
	int valmod = bruhmod(val); 
		
	if(valmod < bestVal){
		bestVal = valmod;
		bestPos = pos;
	}
	if(valmod == bestVal and bestPos < pos){
		bestVal = valmod;
		bestPos = pos;
	}
}

signed main(){
	ios_base::sync_with_stdio(false); cin.tie(0);
	
	cin >> n >> R;
	cin >> me;
	
	//for(int i = 1;i <= n;i++) cin >> debuggingstuff[i];
	
	if(me == 1){
		cout << n;
		return 0;
	}
	
	for(int i = 1;i <= 2*n-1;i++) cin >> arr[i];	
	
	
	//solve(1); return 0;
	//for(int i = 1;i <= n;i++) show(solve(i));
	
	bestVal = n+1;
	int small = solve(1);
	consider(1); consider(n);
	
	int pos = bsta(small);
	consider(pos);
	
	small += (n - bruhmod(small));
	
	for(int x = 0;x < 1;x++){
		int pos = bsta(small);
		if(pos >= n) break;
		
		pos++;
		int val = solve(pos);
		pos = bsta(val);
		consider(pos);
		
		small += n;
	}
	
	cout << bestPos;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 19116 KB Output is correct
2 Correct 10 ms 19028 KB Output is correct
3 Correct 9 ms 19108 KB Output is correct
4 Correct 16 ms 19412 KB Output is correct
5 Correct 9 ms 19096 KB Output is correct
6 Correct 10 ms 19120 KB Output is correct

Subtask #2
90.0 / 94.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 19028 KB Output is correct
2 Correct 10 ms 19100 KB Output is correct
3 Correct 12 ms 19284 KB Output is correct
4 Correct 63 ms 20916 KB Output is correct
5 Correct 1512 ms 40020 KB Output is correct
6 Correct 9 ms 19028 KB Output is correct
7 Correct 12 ms 19176 KB Output is correct
8 Correct 46 ms 20916 KB Output is correct
9 Correct 82 ms 21620 KB Output is correct
10 Correct 11 ms 19220 KB Output is correct
11 Correct 86 ms 21788 KB Output is correct
12 Correct 15 ms 19412 KB Output is correct
13 Correct 816 ms 34200 KB Output is correct
14 Correct 23 ms 19788 KB Output is correct
15 Correct 143 ms 22992 KB Output is correct
16 Correct 10 ms 19156 KB Output is correct
17 Correct 12 ms 19248 KB Output is correct
18 Correct 14 ms 19256 KB Output is correct
19 Correct 19 ms 19448 KB Output is correct
20 Correct 21 ms 19716 KB Output is correct
21 Correct 86 ms 21588 KB Output is correct
22 Correct 120 ms 22740 KB Output is correct
23 Correct 1431 ms 41088 KB Output is correct
24 Correct 10 ms 19028 KB Output is correct
25 Correct 14 ms 19156 KB Output is correct
26 Correct 39 ms 19468 KB Output is correct
27 Correct 219 ms 20784 KB Output is correct
28 Correct 1934 ms 28764 KB Output is correct
29 Correct 15 ms 19156 KB Output is correct
30 Correct 35 ms 19384 KB Output is correct
31 Correct 216 ms 20536 KB Output is correct
32 Execution timed out 2065 ms 32340 KB Time limit exceeded
33 Correct 10 ms 19120 KB Output is correct
34 Correct 10 ms 19028 KB Output is correct
35 Correct 21 ms 19272 KB Output is correct
36 Correct 26 ms 19256 KB Output is correct
37 Correct 201 ms 20352 KB Output is correct
38 Correct 300 ms 21068 KB Output is correct
39 Correct 11 ms 19016 KB Output is correct
40 Correct 15 ms 19124 KB Output is correct
41 Correct 22 ms 19264 KB Output is correct
42 Correct 23 ms 19252 KB Output is correct
43 Correct 47 ms 19464 KB Output is correct
44 Correct 84 ms 19840 KB Output is correct
45 Correct 189 ms 20564 KB Output is correct
46 Correct 288 ms 20684 KB Output is correct
47 Execution timed out 2064 ms 34132 KB Time limit exceeded