oj.uz

Submission #118594

# Submission time Handle Problem Language Result Execution time Memory
118594 2019-06-19T09:32:45 Z StevenH The Big Prize (IOI17_prize) C++14
20 / 100
 44 ms 640 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;

	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(mid<l || mid>r)return 0;
	
	if(res[0]+res[1]==0)return mid;
	else 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-1,476-nm,0);
	//cout<<tp;
	return tp;
	
	return 0;
}

Compilation message

prize.cpp: In function 'int find(int, int, int, int)':
prize.cpp:40: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:46:15: warning: variable 'id' set but not used [-Wunused-but-set-variable]
  int mx=-1,nm,id;
               ^~
prize.cpp:46:12: warning: 'nm' may be used uninitialized in this function [-Wmaybe-uninitialized]
  int mx=-1,nm,id;
            ^~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 6 ms 504 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 7 ms 504 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 ms 536 KB Output is correct
8 Correct 7 ms 528 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 6 ms 384 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 3 ms 452 KB Output is correct
3 Correct 6 ms 432 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 8 ms 504 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 5 ms 380 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 7 ms 432 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 7 ms 504 KB Output is correct
12 Correct 4 ms 504 KB Output is correct
13 Correct 7 ms 376 KB Output is correct
14 Correct 9 ms 512 KB Output is correct
15 Correct 5 ms 524 KB Output is correct
16 Correct 30 ms 504 KB Output is correct
17 Correct 5 ms 256 KB Output is correct
18 Partially correct 32 ms 504 KB Partially correct - number of queries: 5241
19 Correct 3 ms 376 KB Output is correct
20 Correct 10 ms 504 KB Output is correct
21 Correct 9 ms 512 KB Output is correct
22 Correct 11 ms 376 KB Output is correct
23 Correct 6 ms 504 KB Output is correct
24 Correct 6 ms 504 KB Output is correct
25 Correct 17 ms 504 KB Output is correct
26 Correct 22 ms 376 KB Output is correct
27 Correct 5 ms 516 KB Output is correct
28 Correct 16 ms 524 KB Output is correct
29 Correct 15 ms 440 KB Output is correct
30 Partially correct 18 ms 512 KB Partially correct - number of queries: 5203
31 Correct 3 ms 392 KB Output is correct
32 Correct 6 ms 504 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 9 ms 640 KB Output is correct
35 Correct 4 ms 444 KB Output is correct
36 Correct 7 ms 448 KB Output is correct
37 Correct 4 ms 512 KB Output is correct
38 Correct 5 ms 504 KB Output is correct
39 Correct 18 ms 376 KB Output is correct
40 Correct 39 ms 432 KB Output is correct
41 Correct 22 ms 504 KB Output is correct
42 Correct 12 ms 440 KB Output is correct
43 Correct 34 ms 424 KB Output is correct
44 Correct 31 ms 504 KB Output is correct
45 Correct 15 ms 376 KB Output is correct
46 Correct 5 ms 308 KB Output is correct
47 Correct 20 ms 440 KB Output is correct
48 Correct 17 ms 376 KB Output is correct
49 Correct 10 ms 428 KB Output is correct
50 Partially correct 22 ms 504 KB Partially correct - number of queries: 5238
51 Correct 17 ms 420 KB Output is correct
52 Correct 7 ms 504 KB Output is correct
53 Correct 5 ms 424 KB Output is correct
54 Correct 14 ms 504 KB Output is correct
55 Correct 4 ms 256 KB Output is correct
56 Partially correct 44 ms 452 KB Partially correct - number of queries: 5238
57 Correct 24 ms 440 KB Output is correct
58 Correct 14 ms 448 KB Output is correct
59 Correct 20 ms 504 KB Output is correct
60 Correct 24 ms 520 KB Output is correct
61 Correct 7 ms 504 KB Output is correct
62 Correct 7 ms 504 KB Output is correct
63 Correct 7 ms 504 KB Output is correct
64 Correct 4 ms 528 KB Output is correct
65 Correct 6 ms 440 KB Output is correct
66 Correct 10 ms 436 KB Output is correct
67 Incorrect 8 ms 504 KB Integer 200000 violates the range [0, 199999]
68 Halted 0 ms 0 KB -