oj.uz

답안 #744781

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
744781 2023-05-19T05:34:32 Z oolimry Archery (IOI09_archery) C++17
88 / 100
 2000 ms 52792 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 <= 2*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 <= 2*n+1;turn++){
			for(int x : candidates[turn]){
				choices[x]++;
			}
			
			int t = 2;
			while(choices[t] == 0) t--;
			choices[t]--;
			
			//show(t);
			
			if(turn > 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);
		}
	}
	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

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 14388 KB Output is correct
2 Correct 10 ms 14436 KB Output is correct
3 Correct 9 ms 14400 KB Output is correct
4 Correct 16 ms 14804 KB Output is correct
5 Correct 11 ms 14344 KB Output is correct
6 Correct 11 ms 14408 KB Output is correct

Subtask #2
82.0 / 94.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 11 ms 14420 KB Output is correct
3 Correct 12 ms 14804 KB Output is correct
4 Correct 59 ms 17192 KB Output is correct
5 Correct 1452 ms 32604 KB Output is correct
6 Correct 11 ms 14420 KB Output is correct
7 Incorrect 10 ms 14428 KB Output isn't correct
8 Incorrect 52 ms 16440 KB Output isn't correct
9 Correct 79 ms 17848 KB Output is correct
10 Incorrect 11 ms 14548 KB Output isn't correct
11 Correct 82 ms 18644 KB Output is correct
12 Correct 15 ms 14992 KB Output is correct
13 Correct 924 ms 48580 KB Output is correct
14 Correct 21 ms 15492 KB Output is correct
15 Correct 137 ms 22528 KB Output is correct
16 Correct 8 ms 14424 KB Output is correct
17 Correct 13 ms 14684 KB Output is correct
18 Correct 15 ms 14804 KB Output is correct
19 Correct 16 ms 15180 KB Output is correct
20 Correct 18 ms 15188 KB Output is correct
21 Correct 74 ms 18448 KB Output is correct
22 Correct 114 ms 19500 KB Output is correct
23 Correct 1511 ms 52792 KB Output is correct
24 Correct 11 ms 14420 KB Output is correct
25 Correct 15 ms 14392 KB Output is correct
26 Correct 46 ms 14772 KB Output is correct
27 Correct 236 ms 15972 KB Output is correct
28 Execution timed out 2064 ms 23624 KB Time limit exceeded
29 Correct 15 ms 14420 KB Output is correct
30 Correct 35 ms 14676 KB Output is correct
31 Correct 218 ms 15836 KB Output is correct
32 Execution timed out 2048 ms 26528 KB Time limit exceeded
33 Correct 10 ms 14420 KB Output is correct
34 Correct 9 ms 14368 KB Output is correct
35 Correct 21 ms 14584 KB Output is correct
36 Correct 25 ms 14588 KB Output is correct
37 Correct 248 ms 15664 KB Output is correct
38 Correct 353 ms 16252 KB Output is correct
39 Correct 10 ms 14440 KB Output is correct
40 Correct 14 ms 14500 KB Output is correct
41 Correct 21 ms 14564 KB Output is correct
42 Correct 25 ms 14548 KB Output is correct
43 Correct 46 ms 14764 KB Output is correct
44 Correct 85 ms 15092 KB Output is correct
45 Correct 181 ms 15828 KB Output is correct
46 Correct 325 ms 16100 KB Output is correct
47 Execution timed out 2017 ms 28108 KB Time limit exceeded