답안 #715953

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
715953	2023-03-28T15:01:38 Z	myrcella	커다란 상품 (IOI17_prize)	C++17	95.89 / 100	64 ms	432 KB

prize

//by szh
#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 0x3f
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define ll long long
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
void inc(int &a,int b) {a=(a+b)%mod;}
void dec(int &a,int b) {a=(a-b+mod)%mod;}
int lowbit(int x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}
#include "prize.h"
 
const int maxn = 2e5+10;

int ans;
set <int> pos;
vector <int> val;
int sum;
set <int> hi;
 
void solve(int l,int r,int pre,int suf) {
	if (l>r) return;
	int midl = l+r>>1;
	int midr = midl;
	vector <int> tmp = {-1,-1};
	int mid;
	while (midl>=l) {
		tmp = ask(midl);
		if (tmp[0]+tmp[1]==sum) break;
		if (tmp[0]+tmp[1]==0) {
			ans = midl;
			return;
		}
		pos.insert(midl);
		midl--;
	}
	if (midl<l) {
		midr++;
		while (midr<=r) {
			tmp = ask(midr);
			if (tmp[0]+tmp[1]==sum) break;
			if (tmp[0]+tmp[1]==0) {
				ans = midr;
				return;
			}
			pos.insert(midr);
			midr++;
		}
		mid=midr;
	}
	else mid=midl;
	if (mid>r) return;
	if (tmp[0]-pre>0) solve(l,midl-1,pre,tmp[1]);
	if (tmp[1]-suf>0) solve(midr+1,r,tmp[0],suf);
	return;
}
 
int find_best(int n) {
	int ed;
	rep(i,0,472) {
		vector <int> tmp = ask(i);
		if (tmp[0]+tmp[1]==0) return i;
		val.pb(tmp[0]+tmp[1]);
		hi.insert(val.back());
		ed = i;
		if (SZ(hi)==4) break;
	}
	
	sort(ALL(val));val.erase(unique(ALL(val)),val.end());
	sum=val.back();
	solve(ed+1,n-1,0,0);
	return ans;
}

Compilation message

prize.cpp: In function 'void solve(int, int, int, int)':
prize.cpp:35:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   35 |  int midl = l+r>>1;
      |             ~^~

Subtask #1

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	288 KB	Output is correct
2	Correct	4 ms	208 KB	Output is correct
3	Correct	3 ms	292 KB	Output is correct
4	Correct	3 ms	208 KB	Output is correct
5	Correct	3 ms	336 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	6 ms	292 KB	Output is correct
8	Correct	4 ms	208 KB	Output is correct
9	Correct	3 ms	276 KB	Output is correct
10	Correct	4 ms	208 KB	Output is correct

Subtask #2

75.89 / 80.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	336 KB	Output is correct
2	Correct	4 ms	284 KB	Output is correct
3	Correct	4 ms	288 KB	Output is correct
4	Correct	3 ms	344 KB	Output is correct
5	Correct	4 ms	208 KB	Output is correct
6	Correct	1 ms	288 KB	Output is correct
7	Correct	3 ms	300 KB	Output is correct
8	Correct	3 ms	292 KB	Output is correct
9	Correct	3 ms	288 KB	Output is correct
10	Correct	7 ms	208 KB	Output is correct
11	Correct	8 ms	304 KB	Output is correct
12	Correct	9 ms	300 KB	Output is correct
13	Correct	8 ms	296 KB	Output is correct
14	Correct	19 ms	208 KB	Output is correct
15	Partially correct	40 ms	288 KB	Partially correct - number of queries: 5011
16	Partially correct	46 ms	308 KB	Partially correct - number of queries: 5243
17	Correct	5 ms	208 KB	Output is correct
18	Partially correct	43 ms	304 KB	Partially correct - number of queries: 5247
19	Correct	5 ms	288 KB	Output is correct
20	Correct	28 ms	308 KB	Output is correct
21	Partially correct	40 ms	328 KB	Partially correct - number of queries: 5212
22	Correct	37 ms	208 KB	Output is correct
23	Correct	7 ms	208 KB	Output is correct
24	Correct	8 ms	292 KB	Output is correct
25	Correct	49 ms	300 KB	Output is correct
26	Correct	58 ms	208 KB	Output is correct
27	Correct	7 ms	208 KB	Output is correct
28	Correct	24 ms	308 KB	Output is correct
29	Correct	38 ms	292 KB	Output is correct
30	Partially correct	64 ms	292 KB	Partially correct - number of queries: 5206
31	Correct	4 ms	208 KB	Output is correct
32	Correct	8 ms	288 KB	Output is correct
33	Correct	0 ms	208 KB	Output is correct
34	Partially correct	43 ms	416 KB	Partially correct - number of queries: 5234
35	Correct	6 ms	208 KB	Output is correct
36	Partially correct	41 ms	308 KB	Partially correct - number of queries: 5203
37	Correct	9 ms	284 KB	Output is correct
38	Correct	5 ms	288 KB	Output is correct
39	Partially correct	55 ms	292 KB	Partially correct - number of queries: 5211
40	Correct	35 ms	208 KB	Output is correct
41	Partially correct	40 ms	420 KB	Partially correct - number of queries: 5245
42	Partially correct	49 ms	288 KB	Partially correct - number of queries: 5245
43	Partially correct	24 ms	308 KB	Partially correct - number of queries: 5109
44	Partially correct	43 ms	292 KB	Partially correct - number of queries: 5240
45	Correct	46 ms	428 KB	Output is correct
46	Correct	6 ms	288 KB	Output is correct
47	Correct	46 ms	332 KB	Output is correct
48	Partially correct	46 ms	208 KB	Partially correct - number of queries: 5242
49	Partially correct	53 ms	296 KB	Partially correct - number of queries: 5241
50	Partially correct	45 ms	292 KB	Partially correct - number of queries: 5242
51	Partially correct	40 ms	432 KB	Partially correct - number of queries: 5237
52	Partially correct	49 ms	284 KB	Partially correct - number of queries: 5240
53	Correct	9 ms	208 KB	Output is correct
54	Partially correct	43 ms	304 KB	Partially correct - number of queries: 5206
55	Correct	3 ms	208 KB	Output is correct
56	Partially correct	47 ms	280 KB	Partially correct - number of queries: 5242
57	Partially correct	54 ms	208 KB	Partially correct - number of queries: 5208
58	Partially correct	42 ms	296 KB	Partially correct - number of queries: 5242
59	Partially correct	46 ms	288 KB	Partially correct - number of queries: 5245
60	Partially correct	36 ms	300 KB	Partially correct - number of queries: 5203
61	Correct	3 ms	336 KB	Output is correct
62	Correct	5 ms	292 KB	Output is correct
63	Correct	4 ms	288 KB	Output is correct
64	Correct	6 ms	284 KB	Output is correct
65	Correct	6 ms	208 KB	Output is correct
66	Correct	11 ms	292 KB	Output is correct
67	Correct	3 ms	296 KB	Output is correct
68	Correct	5 ms	208 KB	Output is correct
69	Correct	4 ms	348 KB	Output is correct
70	Correct	6 ms	292 KB	Output is correct
71	Partially correct	49 ms	304 KB	Partially correct - number of queries: 5231
72	Correct	11 ms	300 KB	Output is correct
73	Partially correct	48 ms	308 KB	Partially correct - number of queries: 5168
74	Partially correct	41 ms	208 KB	Partially correct - number of queries: 5195
75	Correct	4 ms	208 KB	Output is correct
76	Correct	47 ms	288 KB	Output is correct
77	Partially correct	45 ms	304 KB	Partially correct - number of queries: 5392
78	Correct	16 ms	208 KB	Output is correct
79	Correct	21 ms	300 KB	Output is correct
80	Partially correct	43 ms	300 KB	Partially correct - number of queries: 5411
81	Partially correct	55 ms	304 KB	Partially correct - number of queries: 5401
82	Partially correct	56 ms	328 KB	Partially correct - number of queries: 5369
83	Correct	7 ms	300 KB	Output is correct
84	Correct	42 ms	300 KB	Output is correct
85	Partially correct	51 ms	300 KB	Partially correct - number of queries: 5403
86	Correct	6 ms	208 KB	Output is correct
87	Correct	1 ms	212 KB	Output is correct
88	Correct	5 ms	292 KB	Output is correct
89	Correct	6 ms	208 KB	Output is correct
90	Correct	6 ms	208 KB	Output is correct
91	Correct	3 ms	348 KB	Output is correct
92	Correct	4 ms	300 KB	Output is correct
93	Correct	8 ms	208 KB	Output is correct
94	Correct	7 ms	208 KB	Output is correct
95	Correct	7 ms	208 KB	Output is correct
96	Correct	8 ms	208 KB	Output is correct
97	Correct	6 ms	208 KB	Output is correct