답안 #1081467

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1081467	2024-08-30T05:20:58 Z	kes0716	Archery (IOI09_archery)	C++17	100 / 100	626 ms	14620 KB

archery

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200009;
int n, r, crit;
int a[2*MAXN];
struct State{
	int pl, ze, mi;
	State operator+(const State &s) const{
		return (State){pl+s.pl, ze+s.ze, mi+s.mi};
	}
} init[MAXN];
int simulate1(void){
	vector<State> pot(5*n);
	State pq = {0, 0, 0};
	int i, j;
	for(i=0; i<n; i++){
		pot[i] = init[i];
	}
	for(i=n; i<5*n; i++)
		pot[i] = {0, 0, 0};
	int cnt = 0, last = -1;
	int lwin = (init[0].pl ? 1 : (init[0].ze ? 0 : -1));
	for(i=0; i<4*n; i++){
		pq = pq + pot[i];
		int oppb;
		//printf("i=%d pq= +%d 0%d -%d\n", i, pq.pl, pq.ze, pq.mi);
		if(pq.pl >= 2){
			oppb = 1;
		}
		else if(pq.pl == 1){
			if(lwin == 1){
				if(pq.ze){
					oppb = 0;
				}
				else{
					oppb = -1;
				}
			}
			else{
				oppb = 1;
			}
		}
		else if(pq.ze && lwin){
			oppb = 0;
		}
		else{
			oppb = -1;
		}
		if(!lwin || !oppb)
			last = i;
		if(i==r)
			break;
		if(!oppb && lwin == 1)
			cnt++;
		else if(!lwin && oppb == 1)
			cnt++;
		if(lwin < oppb)
			swap(lwin, oppb);
		if(oppb == 1){
			pq.pl--;
			pot[i+n].pl++;
		}
		else if(oppb== 0){
			pq.ze--;
			pot[i+n].ze++;
		}
		else{
			pq.mi--;
			pot[i+n].mi++;
		}
	}
	//printf("last=%d cnt=%d\n", last, cnt);
	int ret = last - r - n*cnt;
	return ret;
}
int simulate2(int pos){
	State pq = {0, 0, 0};
	int i, ans = pos;
	for(i=2*n; i>=1; i--){
		int cur = i%n;
		pq = pq + init[cur];
		//printf("i=%d pq.pl=%d ze=%d mi=%d\n", i,pq.pl, pq.ze, pq.mi);
		init[cur].pl = init[cur].mi = init[cur].ze = 0;
		if(cur){
			if(pq.mi){
				if(pq.ze)
					ans--;
				init[cur].mi = 1;
				pq.mi--;
			}
			else if(pq.ze){
				init[cur].ze = 1;
				pq.ze--;
			}
		}
		else{
			if(pq.ze)
				ans--;
		}
	}
	return ans;
}
int simulate(int p){
	int i, j=0;
	for(i=0; i<n; i++){
		init[i].pl = init[i].ze = init[i].mi = 0;
		if(p == i)
			init[i].ze++;
		else{
			if(a[j] < crit)
				init[i].pl++;
			else
				init[i].mi++;
			j++;
		}
		if(a[j] < crit)
			init[i].pl++;
		else
			init[i].mi++;
		j++;
	}
	if(crit <= n+1)
		return simulate1();
	return simulate2(p);
}
int main(){
	int i;
	scanf("%d %d", &n, &r);
	r = 3*n + r%n;
	scanf("%d", &crit);
	for(i=0; i<2*n-1; i++){
		scanf("%d", &a[i]);
	}
	if(crit==1){
		printf("%d\n", n);
		return 0;
	}
	pair<int, int> ans = make_pair(n, -1);	//(result, -start)
	for(int t=-5; t<=1; t++){
		int goal = t*n, lo = 0, hi = n-1, mid;
		while(lo < hi){
			mid = (lo+hi)/2;
			if(simulate(mid) >= goal)
				hi = mid;
			else
				lo = mid+1;
		}
		int crit = simulate(lo);
		//printf("lo=%d crit=%d\n", lo, crit);
		hi = n-1;
		while(lo < hi){
			mid = (lo+hi+1)/2;
			if(simulate(mid) == crit)
				lo = mid;
			else
				hi = mid-1;
		}
		//printf("lo=%d\n", lo);
		ans = min(ans, make_pair((crit%n + n)%n, -lo-1));
	}
	printf("%d\n", -ans.second);
	return 0;
}

Compilation message

archery.cpp: In function 'int simulate1()':
archery.cpp:15:9: warning: unused variable 'j' [-Wunused-variable]
   15 |  int i, j;
      |         ^
archery.cpp: In function 'int main()':
archery.cpp:128:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  128 |  scanf("%d %d", &n, &r);
      |  ~~~~~^~~~~~~~~~~~~~~~~
archery.cpp:130:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  130 |  scanf("%d", &crit);
      |  ~~~~~^~~~~~~~~~~~~
archery.cpp:132:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  132 |   scanf("%d", &a[i]);
      |   ~~~~~^~~~~~~~~~~~~

Subtask #1

6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 ms	452 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	5 ms	604 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct

Subtask #2

94.0 / 94.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	5 ms	348 KB	Output is correct
4	Correct	40 ms	1628 KB	Output is correct
5	Correct	626 ms	13924 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	2 ms	348 KB	Output is correct
8	Correct	34 ms	1628 KB	Output is correct
9	Correct	45 ms	3988 KB	Output is correct
10	Correct	2 ms	348 KB	Output is correct
11	Correct	51 ms	3956 KB	Output is correct
12	Correct	5 ms	604 KB	Output is correct
13	Correct	276 ms	10896 KB	Output is correct
14	Correct	11 ms	816 KB	Output is correct
15	Correct	72 ms	4700 KB	Output is correct
16	Correct	1 ms	344 KB	Output is correct
17	Correct	3 ms	348 KB	Output is correct
18	Correct	4 ms	600 KB	Output is correct
19	Correct	6 ms	652 KB	Output is correct
20	Correct	10 ms	816 KB	Output is correct
21	Correct	74 ms	3968 KB	Output is correct
22	Correct	59 ms	4700 KB	Output is correct
23	Correct	467 ms	14620 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	2 ms	348 KB	Output is correct
26	Correct	6 ms	348 KB	Output is correct
27	Correct	47 ms	2840 KB	Output is correct
28	Correct	403 ms	3596 KB	Output is correct
29	Correct	2 ms	344 KB	Output is correct
30	Correct	6 ms	348 KB	Output is correct
31	Correct	27 ms	2812 KB	Output is correct
32	Correct	316 ms	3932 KB	Output is correct
33	Correct	1 ms	344 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	2 ms	348 KB	Output is correct
36	Correct	3 ms	344 KB	Output is correct
37	Correct	21 ms	2652 KB	Output is correct
38	Correct	41 ms	2844 KB	Output is correct
39	Correct	0 ms	348 KB	Output is correct
40	Correct	1 ms	348 KB	Output is correct
41	Correct	2 ms	484 KB	Output is correct
42	Correct	3 ms	348 KB	Output is correct
43	Correct	5 ms	348 KB	Output is correct
44	Correct	14 ms	472 KB	Output is correct
45	Correct	25 ms	2652 KB	Output is correct
46	Correct	28 ms	2648 KB	Output is correct
47	Correct	288 ms	4184 KB	Output is correct