oj.uz

Submission #744784

# Submission time Handle Problem Language Result Execution time Memory
744784 2023-05-19T05:41:21 Z oolimry Archery (IOI09_archery) C++17
85 / 100
 2000 ms 65536 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[600005];

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 = 2;
			while(choices[t] == 0) t--;
			choices[t]--;
			
			//show(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++;
			
			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(){
	//freopen("i.txt","r",stdin);
	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
5.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14292 KB Output is correct
2 Correct 10 ms 14420 KB Output is correct
3 Runtime error 20 ms 29080 KB Execution killed with signal 6
4 Correct 14 ms 14932 KB Output is correct
5 Correct 8 ms 14420 KB Output is correct
6 Correct 8 ms 14420 KB Output is correct

Subtask #2
80.0 / 94.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 9 ms 14396 KB Output is correct
3 Correct 12 ms 14804 KB Output is correct
4 Correct 66 ms 17112 KB Output is correct
5 Correct 1822 ms 36924 KB Output is correct
6 Correct 8 ms 14420 KB Output is correct
7 Incorrect 10 ms 14548 KB Output isn't correct
8 Incorrect 63 ms 16464 KB Output isn't correct
9 Correct 98 ms 18320 KB Output is correct
10 Incorrect 10 ms 14548 KB Output isn't correct
11 Correct 92 ms 19044 KB Output is correct
12 Correct 16 ms 14976 KB Output is correct
13 Correct 1022 ms 51400 KB Output is correct
14 Correct 23 ms 15580 KB Output is correct
15 Correct 162 ms 23168 KB Output is correct
16 Correct 9 ms 14420 KB Output is correct
17 Correct 12 ms 14660 KB Output is correct
18 Correct 14 ms 14732 KB Output is correct
19 Correct 19 ms 15272 KB Output is correct
20 Correct 23 ms 15284 KB Output is correct
21 Correct 88 ms 18508 KB Output is correct
22 Correct 137 ms 20188 KB Output is correct
23 Runtime error 183 ms 65536 KB Execution killed with signal 11
24 Correct 12 ms 14316 KB Output is correct
25 Correct 13 ms 14420 KB Output is correct
26 Correct 40 ms 14676 KB Output is correct
27 Correct 250 ms 15728 KB Output is correct
28 Execution timed out 2058 ms 22280 KB Time limit exceeded
29 Correct 15 ms 14420 KB Output is correct
30 Correct 35 ms 14676 KB Output is correct
31 Correct 225 ms 15660 KB Output is correct
32 Execution timed out 2081 ms 25292 KB Time limit exceeded
33 Correct 8 ms 14432 KB Output is correct
34 Correct 9 ms 14420 KB Output is correct
35 Correct 20 ms 14480 KB Output is correct
36 Correct 27 ms 14556 KB Output is correct
37 Correct 206 ms 15572 KB Output is correct
38 Correct 331 ms 15964 KB Output is correct
39 Correct 8 ms 14420 KB Output is correct
40 Correct 15 ms 14388 KB Output is correct
41 Correct 21 ms 14556 KB Output is correct
42 Correct 22 ms 14544 KB Output is correct
43 Correct 51 ms 14720 KB Output is correct
44 Correct 91 ms 15032 KB Output is correct
45 Correct 197 ms 15572 KB Output is correct
46 Correct 338 ms 15784 KB Output is correct
47 Execution timed out 2066 ms 26852 KB Time limit exceeded