oj.uz

Submission #744680

# Submission time Handle Problem Language Result Execution time Memory
744680 2023-05-19T00:58:47 Z oolimry Archery (IOI09_archery) C++17
88 / 100
 2000 ms 37608 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;
#define int long long


int debuggingstuff[400005];

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

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

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

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;
	}
	
	//for(int i = 1;i <= 2*n;i++) show2(i, target[i]);
	
	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);
		}
		
		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;
		
		priority_queue<int, vector<int>, greater<int> > choices;
		for(int turn = 1;turn <= 3*n+1;turn++){
			for(int x : candidates[turn]) choices.push(x);
			
			int t = choices.top(); choices.pop();
			
			if(turn > n and t == me){
				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 == me) looparounds++;
			
			candidates[turn+n].push_back(t);
		}
	}
}

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;
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];	
	
	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 < 3;x++){
		int pos = bsta(small);
		if(pos >= n) break;
		
		pos++;
		int val = solve(pos);
		pos = bsta(val);
		consider(pos);
		
		small += n;
	}
	
	cout << bestPos;
}

Compilation message

archery.cpp: In function 'long long int solve(long long int)':
archery.cpp:94:1: warning: control reaches end of non-void function [-Wreturn-type]
   94 | }
      | ^

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14420 KB Output is correct
2 Correct 8 ms 14420 KB Output is correct
3 Correct 9 ms 14420 KB Output is correct
4 Correct 25 ms 14792 KB Output is correct
5 Correct 7 ms 14420 KB Output is correct
6 Correct 8 ms 14420 KB Output is correct

Subtask #2
82.0 / 94.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 8 ms 14460 KB Output is correct
3 Correct 18 ms 14636 KB Output is correct
4 Correct 169 ms 16588 KB Output is correct
5 Execution timed out 2081 ms 35136 KB Time limit exceeded
6 Correct 10 ms 14420 KB Output is correct
7 Correct 13 ms 14488 KB Output is correct
8 Correct 104 ms 16512 KB Output is correct
9 Correct 239 ms 17320 KB Output is correct
10 Correct 14 ms 14676 KB Output is correct
11 Correct 267 ms 17636 KB Output is correct
12 Correct 32 ms 14804 KB Output is correct
13 Execution timed out 2091 ms 31932 KB Time limit exceeded
14 Correct 54 ms 15088 KB Output is correct
15 Correct 428 ms 18996 KB Output is correct
16 Correct 9 ms 14420 KB Output is correct
17 Correct 20 ms 14632 KB Output is correct
18 Correct 22 ms 14696 KB Output is correct
19 Correct 37 ms 14924 KB Output is correct
20 Correct 50 ms 15060 KB Output is correct
21 Correct 260 ms 17504 KB Output is correct
22 Correct 330 ms 18096 KB Output is correct
23 Execution timed out 2064 ms 37608 KB Time limit exceeded
24 Correct 8 ms 14420 KB Output is correct
25 Correct 16 ms 14568 KB Output is correct
26 Correct 50 ms 14732 KB Output is correct
27 Correct 283 ms 16056 KB Output is correct
28 Execution timed out 2080 ms 24268 KB Time limit exceeded
29 Correct 16 ms 14420 KB Output is correct
30 Correct 41 ms 14804 KB Output is correct
31 Correct 295 ms 15972 KB Output is correct
32 Execution timed out 2080 ms 28068 KB Time limit exceeded
33 Correct 8 ms 14420 KB Output is correct
34 Correct 9 ms 14320 KB Output is correct
35 Correct 23 ms 14596 KB Output is correct
36 Correct 30 ms 14548 KB Output is correct
37 Correct 259 ms 15732 KB Output is correct
38 Correct 387 ms 16352 KB Output is correct
39 Correct 8 ms 14420 KB Output is correct
40 Correct 14 ms 14504 KB Output is correct
41 Correct 25 ms 14548 KB Output is correct
42 Correct 28 ms 14620 KB Output is correct
43 Correct 63 ms 14804 KB Output is correct
44 Correct 104 ms 15196 KB Output is correct
45 Correct 230 ms 16080 KB Output is correct
46 Correct 388 ms 16124 KB Output is correct
47 Execution timed out 2058 ms 30012 KB Time limit exceeded