oj.uz

답안 #744673

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
744673 2023-05-18T23:48:36 Z oolimry Archery (IOI09_archery) C++17
84 / 100
 2000 ms 33032 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;

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){
	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); 
	
	//show3(valmod, bestVal, pos);	
	
	if(valmod <= bestVal){
		bestVal = valmod;
		bestPos = pos;
	}
}

int main(){
	ios_base::sync_with_stdio(false); cin.tie(0);
	
	cin >> n >> R;
	cin >> me;
	
	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);
	
	small += (n - bruhmod(small));
	
	for(int x = 0;x < 4;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 'int solve(int)':
archery.cpp:89:1: warning: control reaches end of non-void function [-Wreturn-type]
   89 | }
      | ^

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14292 KB Output is correct
2 Correct 8 ms 14408 KB Output is correct
3 Correct 9 ms 14420 KB Output is correct
4 Correct 22 ms 14652 KB Output is correct
5 Correct 8 ms 14332 KB Output is correct
6 Correct 9 ms 14420 KB Output is correct

Subtask #2
78.0 / 94.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14424 KB Output is correct
2 Correct 9 ms 14432 KB Output is correct
3 Correct 16 ms 14548 KB Output is correct
4 Correct 138 ms 16212 KB Output is correct
5 Execution timed out 2082 ms 30856 KB Time limit exceeded
6 Correct 9 ms 14420 KB Output is correct
7 Incorrect 11 ms 14420 KB Output isn't correct
8 Incorrect 60 ms 16208 KB Output isn't correct
9 Correct 201 ms 16728 KB Output is correct
10 Incorrect 11 ms 14548 KB Output isn't correct
11 Correct 210 ms 16948 KB Output is correct
12 Correct 24 ms 14756 KB Output is correct
13 Correct 1874 ms 29048 KB Output is correct
14 Correct 46 ms 15016 KB Output is correct
15 Correct 337 ms 18296 KB Output is correct
16 Correct 8 ms 14428 KB Output is correct
17 Correct 16 ms 14592 KB Output is correct
18 Correct 19 ms 14676 KB Output is correct
19 Correct 28 ms 14776 KB Output is correct
20 Correct 39 ms 14932 KB Output is correct
21 Correct 201 ms 16932 KB Output is correct
22 Correct 282 ms 17392 KB Output is correct
23 Execution timed out 2092 ms 33032 KB Time limit exceeded
24 Correct 11 ms 14420 KB Output is correct
25 Correct 14 ms 14420 KB Output is correct
26 Correct 47 ms 14716 KB Output is correct
27 Correct 211 ms 15724 KB Output is correct
28 Execution timed out 2078 ms 22244 KB Time limit exceeded
29 Correct 15 ms 14520 KB Output is correct
30 Correct 34 ms 14676 KB Output is correct
31 Correct 214 ms 15660 KB Output is correct
32 Execution timed out 2057 ms 25392 KB Time limit exceeded
33 Correct 11 ms 14420 KB Output is correct
34 Correct 11 ms 14420 KB Output is correct
35 Correct 20 ms 14560 KB Output is correct
36 Correct 27 ms 14548 KB Output is correct
37 Correct 205 ms 15468 KB Output is correct
38 Correct 293 ms 15964 KB Output is correct
39 Correct 8 ms 14420 KB Output is correct
40 Correct 13 ms 14388 KB Output is correct
41 Correct 20 ms 14548 KB Output is correct
42 Correct 21 ms 14548 KB Output is correct
43 Correct 44 ms 14724 KB Output is correct
44 Correct 80 ms 14984 KB Output is correct
45 Correct 184 ms 15652 KB Output is correct
46 Correct 303 ms 15780 KB Output is correct
47 Execution timed out 2071 ms 26868 KB Time limit exceeded