Submission #118587

# Submission time Handle Problem Language Result Execution time Memory
118587 2019-06-19T09:24:27 Z StevenH The Big Prize (IOI17_prize) C++14
20 / 100
41 ms 688 KB
#include "prize.h"
#include <cstring>
//#include <bits\stdc++.h> 
using namespace std;
const int maxn = 200005;
bool vis[maxn];
int lp;
									//rx right of r
int find(int l,int r,int lx,int rx)	//lx left of l
{
	int mid,tmp,nm;
	mid=(l+r)/2-1;

	while(vis[mid] && mid<=r)mid++;
	if(mid>r)
	{
		while(vis[mid] && mid>=l)mid--;
		if(mid<l)return 0;	// 0 not find any thing
	}
	
	vector<int> res = ask(mid);
	vis[mid]=true;
	
	if(res[0]+res[1]==0)return mid;
	if(res[0]+res[1]==lp)
	{
		if(res[0]-lx>0)	 // left not empty 
		{
			tmp=find(l,mid-1,lx,res[1]);
			if(tmp)return tmp;
		}
		if(res[1]-rx>0)	// right not empty
		{
			tmp=find(mid+1,r,res[0],rx);
			if(tmp)return tmp;
		}
	}
	else if(tmp=find(l,r,lx,rx))return tmp;
	
	return 0;
}

int find_best(int n) {
	int mx=-1,nm,id;
	//vector<int> res = ask(i);
	for(int i=0;i<476;i++)
	{
		vector<int> res = ask(i);
		int tmp = res[0] + res[1];
		if(tmp==0)
		{
			//cout<<i;
			return i;
		}
		if(tmp>mx)
		{
			mx=tmp;
			id=i;
			nm=1;
		}
		if(tmp==mx)nm++;
	}
	
	lp=mx;	//lp refers to lollipop
	memset(vis,false,sizeof(vis));
	int tp=find(476,n,476-nm,0);
	//cout<<tp;
	return tp;
	
	return 0;
}

Compilation message

prize.cpp: In function 'int find(int, int, int, int)':
prize.cpp:38:13: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
  else if(tmp=find(l,r,lx,rx))return tmp;
          ~~~^~~~~~~~~~~~~~~~
prize.cpp:11:14: warning: unused variable 'nm' [-Wunused-variable]
  int mid,tmp,nm;
              ^~
prize.cpp: In function 'int find_best(int)':
prize.cpp:44:15: warning: variable 'id' set but not used [-Wunused-but-set-variable]
  int mx=-1,nm,id;
               ^~
prize.cpp:44:12: warning: 'nm' may be used uninitialized in this function [-Wmaybe-uninitialized]
  int mx=-1,nm,id;
            ^~
# Verdict Execution time Memory Grader output
1 Correct 9 ms 404 KB Output is correct
2 Correct 4 ms 444 KB Output is correct
3 Correct 7 ms 428 KB Output is correct
4 Correct 3 ms 448 KB Output is correct
5 Correct 5 ms 504 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 7 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 7 ms 504 KB Output is correct
10 Correct 7 ms 504 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 520 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 3 ms 520 KB Output is correct
5 Correct 8 ms 504 KB Output is correct
6 Correct 2 ms 416 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 7 ms 504 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 8 ms 440 KB Output is correct
12 Correct 7 ms 376 KB Output is correct
13 Correct 8 ms 508 KB Output is correct
14 Correct 9 ms 512 KB Output is correct
15 Correct 11 ms 424 KB Output is correct
16 Correct 16 ms 536 KB Output is correct
17 Correct 3 ms 312 KB Output is correct
18 Partially correct 20 ms 512 KB Partially correct - number of queries: 5543
19 Correct 5 ms 256 KB Output is correct
20 Correct 15 ms 532 KB Output is correct
21 Correct 10 ms 512 KB Output is correct
22 Correct 5 ms 512 KB Output is correct
23 Correct 4 ms 528 KB Output is correct
24 Correct 6 ms 504 KB Output is correct
25 Correct 35 ms 504 KB Output is correct
26 Correct 25 ms 504 KB Output is correct
27 Correct 4 ms 444 KB Output is correct
28 Correct 32 ms 504 KB Output is correct
29 Correct 15 ms 512 KB Output is correct
30 Partially correct 30 ms 504 KB Partially correct - number of queries: 5518
31 Correct 6 ms 256 KB Output is correct
32 Correct 4 ms 452 KB Output is correct
33 Correct 2 ms 412 KB Output is correct
34 Correct 8 ms 512 KB Output is correct
35 Correct 7 ms 376 KB Output is correct
36 Correct 10 ms 500 KB Output is correct
37 Correct 5 ms 504 KB Output is correct
38 Correct 7 ms 512 KB Output is correct
39 Correct 28 ms 380 KB Output is correct
40 Correct 40 ms 440 KB Output is correct
41 Correct 13 ms 512 KB Output is correct
42 Correct 13 ms 520 KB Output is correct
43 Correct 30 ms 376 KB Output is correct
44 Correct 12 ms 512 KB Output is correct
45 Correct 9 ms 512 KB Output is correct
46 Correct 6 ms 304 KB Output is correct
47 Correct 15 ms 424 KB Output is correct
48 Correct 14 ms 540 KB Output is correct
49 Correct 5 ms 640 KB Output is correct
50 Partially correct 33 ms 424 KB Partially correct - number of queries: 5546
51 Correct 17 ms 424 KB Output is correct
52 Correct 4 ms 448 KB Output is correct
53 Correct 5 ms 688 KB Output is correct
54 Correct 24 ms 376 KB Output is correct
55 Correct 3 ms 456 KB Output is correct
56 Partially correct 35 ms 404 KB Partially correct - number of queries: 5513
57 Correct 41 ms 384 KB Output is correct
58 Correct 38 ms 436 KB Output is correct
59 Correct 24 ms 512 KB Output is correct
60 Correct 17 ms 512 KB Output is correct
61 Correct 8 ms 376 KB Output is correct
62 Correct 3 ms 512 KB Output is correct
63 Correct 7 ms 376 KB Output is correct
64 Correct 3 ms 512 KB Output is correct
65 Correct 3 ms 512 KB Output is correct
66 Correct 11 ms 504 KB Output is correct
67 Incorrect 10 ms 440 KB Integer 200000 violates the range [0, 199999]
68 Halted 0 ms 0 KB -