Submission #715948

# Submission time Handle Problem Language Result Execution time Memory
715948 2023-03-28T14:46:53 Z myrcella The Big Prize (IOI17_prize) C++17
95.89 / 100
56 ms 428 KB
//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;
 
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) {
	rep(i,0,472) {
		vector <int> tmp = ask(i);
		if (tmp[0]+tmp[1]==0) return i;
		val.pb(tmp[0]+tmp[1]);
	}
	
	sort(ALL(val));val.erase(unique(ALL(val)),val.end());
	sum=val.back();
	solve(472,n-1,0,0);
	return ans;
}

Compilation message

prize.cpp: In function 'void solve(int, int, int, int)':
prize.cpp:34:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   34 |  int midl = l+r>>1;
      |             ~^~
# Verdict Execution time Memory Grader output
1 Correct 4 ms 292 KB Output is correct
2 Correct 5 ms 208 KB Output is correct
3 Correct 3 ms 208 KB Output is correct
4 Correct 4 ms 208 KB Output is correct
5 Correct 5 ms 292 KB Output is correct
6 Correct 0 ms 292 KB Output is correct
7 Correct 5 ms 208 KB Output is correct
8 Correct 3 ms 300 KB Output is correct
9 Correct 6 ms 284 KB Output is correct
10 Correct 6 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 336 KB Output is correct
2 Correct 6 ms 288 KB Output is correct
3 Correct 6 ms 288 KB Output is correct
4 Correct 5 ms 292 KB Output is correct
5 Correct 5 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 5 ms 208 KB Output is correct
8 Correct 4 ms 292 KB Output is correct
9 Correct 4 ms 208 KB Output is correct
10 Correct 5 ms 296 KB Output is correct
11 Correct 9 ms 208 KB Output is correct
12 Correct 4 ms 300 KB Output is correct
13 Correct 9 ms 208 KB Output is correct
14 Correct 10 ms 208 KB Output is correct
15 Partially correct 42 ms 356 KB Partially correct - number of queries: 5011
16 Partially correct 22 ms 304 KB Partially correct - number of queries: 5243
17 Correct 4 ms 208 KB Output is correct
18 Partially correct 49 ms 296 KB Partially correct - number of queries: 5247
19 Correct 5 ms 208 KB Output is correct
20 Correct 28 ms 288 KB Output is correct
21 Partially correct 53 ms 304 KB Partially correct - number of queries: 5212
22 Correct 37 ms 208 KB Output is correct
23 Correct 5 ms 272 KB Output is correct
24 Correct 10 ms 280 KB Output is correct
25 Correct 48 ms 284 KB Output is correct
26 Correct 49 ms 288 KB Output is correct
27 Correct 7 ms 208 KB Output is correct
28 Correct 38 ms 308 KB Output is correct
29 Correct 41 ms 300 KB Output is correct
30 Partially correct 56 ms 336 KB Partially correct - number of queries: 5206
31 Correct 3 ms 288 KB Output is correct
32 Correct 4 ms 344 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Partially correct 44 ms 296 KB Partially correct - number of queries: 5234
35 Correct 6 ms 208 KB Output is correct
36 Partially correct 40 ms 304 KB Partially correct - number of queries: 5203
37 Correct 8 ms 292 KB Output is correct
38 Correct 5 ms 288 KB Output is correct
39 Partially correct 52 ms 208 KB Partially correct - number of queries: 5211
40 Correct 37 ms 300 KB Output is correct
41 Partially correct 47 ms 344 KB Partially correct - number of queries: 5245
42 Partially correct 47 ms 308 KB Partially correct - number of queries: 5245
43 Partially correct 46 ms 428 KB Partially correct - number of queries: 5109
44 Partially correct 52 ms 412 KB Partially correct - number of queries: 5240
45 Correct 45 ms 292 KB Output is correct
46 Correct 4 ms 208 KB Output is correct
47 Correct 46 ms 288 KB Output is correct
48 Partially correct 23 ms 304 KB Partially correct - number of queries: 5242
49 Partially correct 48 ms 288 KB Partially correct - number of queries: 5241
50 Partially correct 38 ms 296 KB Partially correct - number of queries: 5242
51 Partially correct 49 ms 300 KB Partially correct - number of queries: 5237
52 Partially correct 42 ms 280 KB Partially correct - number of queries: 5240
53 Correct 6 ms 208 KB Output is correct
54 Partially correct 44 ms 288 KB Partially correct - number of queries: 5206
55 Correct 4 ms 272 KB Output is correct
56 Partially correct 43 ms 296 KB Partially correct - number of queries: 5242
57 Partially correct 46 ms 292 KB Partially correct - number of queries: 5208
58 Partially correct 45 ms 412 KB Partially correct - number of queries: 5242
59 Partially correct 52 ms 304 KB Partially correct - number of queries: 5245
60 Partially correct 53 ms 340 KB Partially correct - number of queries: 5203
61 Correct 4 ms 208 KB Output is correct
62 Correct 6 ms 288 KB Output is correct
63 Correct 4 ms 208 KB Output is correct
64 Correct 8 ms 284 KB Output is correct
65 Correct 6 ms 292 KB Output is correct
66 Correct 11 ms 208 KB Output is correct
67 Correct 4 ms 284 KB Output is correct
68 Correct 2 ms 296 KB Output is correct
69 Correct 9 ms 208 KB Output is correct
70 Correct 6 ms 208 KB Output is correct
71 Partially correct 41 ms 328 KB Partially correct - number of queries: 5231
72 Correct 9 ms 208 KB Output is correct
73 Partially correct 44 ms 300 KB Partially correct - number of queries: 5168
74 Partially correct 50 ms 292 KB Partially correct - number of queries: 5195
75 Correct 7 ms 208 KB Output is correct
76 Correct 36 ms 292 KB Output is correct
77 Partially correct 50 ms 292 KB Partially correct - number of queries: 5392
78 Correct 9 ms 208 KB Output is correct
79 Correct 30 ms 208 KB Output is correct
80 Partially correct 45 ms 304 KB Partially correct - number of queries: 5411
81 Partially correct 23 ms 304 KB Partially correct - number of queries: 5401
82 Partially correct 43 ms 368 KB Partially correct - number of queries: 5369
83 Correct 5 ms 300 KB Output is correct
84 Correct 41 ms 296 KB Output is correct
85 Partially correct 47 ms 304 KB Partially correct - number of queries: 5403
86 Correct 5 ms 208 KB Output is correct
87 Correct 6 ms 208 KB Output is correct
88 Correct 5 ms 292 KB Output is correct
89 Correct 5 ms 208 KB Output is correct
90 Correct 4 ms 208 KB Output is correct
91 Correct 6 ms 208 KB Output is correct
92 Correct 4 ms 208 KB Output is correct
93 Correct 7 ms 208 KB Output is correct
94 Correct 9 ms 208 KB Output is correct
95 Correct 9 ms 208 KB Output is correct
96 Correct 8 ms 208 KB Output is correct
97 Correct 4 ms 300 KB Output is correct