oj.uz

Submission #70063

# Submission time Handle Problem Language Result Execution time Memory
70063 2018-08-22T10:03:17 Z E869120 The Big Prize (IOI17_prize) C++14
20 / 100
 96 ms 1780 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

vector<int>vec;int N;

pair<int,int> asks(int p){
	vector<int>Z = ask(p);
	return make_pair(Z[0],Z[1]);
}

int find_best(int n) {
	srand((unsigned)time(NULL));
	N=n;
	vector<int>vec;for(int i=0;i<n;i++) vec.push_back(i);
	
	while(vec.size()>=2){
		int minx=0;
		if(vec.size()>=30){
			for(int i=0;i<5;i++){
				pair<int,int>A=asks(vec[rand()%vec.size()]);
				minx=max(minx,A.first+A.second);
			}
		}
		else{
			for(int i=0;i<vec.size();i++){
				pair<int,int>A=asks(vec[i]);
				minx=max(minx,A.first+A.second);
			}
		}
		
		int s = 0;for(int i=0;i<20;i++){if((1<<i)<=vec.size()) s=i+1;}
		int cnt=0,ret=0;vector<int>vec2;
		while(true){
			int c = 0;
			for(int i=s-1;i>=0;i--){
				int pos = vec[min(c + (1<<i), (int)vec.size() - 1)];
				if(pos <= ret) c += (1<<i);
				else{
					pair<int,int>Z = asks(pos);
					if(Z.first+Z.second==minx && Z.first<=cnt) c+=(1<<i);
				}
			}
			if(c==(1<<s)-1){
				break;
			}
			else{
				// results = vec[c + 1]
				if(c == 0){
					int pos = vec[0];
					pair<int, int> Z = asks(pos);
					if(Z.first + Z.second != minx) c = -1;
				}
				vec2.push_back(vec[c + 1]);
				ret = vec[c + 1];
			}
			cnt++;
		}
		vec=vec2;
	}
	return vec[0];
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:26:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int i=0;i<vec.size();i++){
                ~^~~~~~~~~~~
prize.cpp:32:44: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   int s = 0;for(int i=0;i<20;i++){if((1<<i)<=vec.size()) s=i+1;}
                                      ~~~~~~^~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1392 KB Output is correct
2 Correct 5 ms 1580 KB Output is correct
3 Correct 6 ms 1580 KB Output is correct
4 Correct 5 ms 1580 KB Output is correct
5 Correct 6 ms 1584 KB Output is correct
6 Correct 4 ms 1780 KB Output is correct
7 Correct 5 ms 1780 KB Output is correct
8 Correct 4 ms 1780 KB Output is correct
9 Correct 6 ms 1780 KB Output is correct
10 Correct 5 ms 1780 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1780 KB Output is correct
2 Correct 5 ms 1780 KB Output is correct
3 Correct 5 ms 1780 KB Output is correct
4 Correct 5 ms 1780 KB Output is correct
5 Correct 5 ms 1780 KB Output is correct
6 Correct 5 ms 1780 KB Output is correct
7 Correct 5 ms 1780 KB Output is correct
8 Correct 6 ms 1780 KB Output is correct
9 Correct 4 ms 1780 KB Output is correct
10 Correct 5 ms 1780 KB Output is correct
11 Correct 11 ms 1780 KB Output is correct
12 Correct 15 ms 1780 KB Output is correct
13 Correct 10 ms 1780 KB Output is correct
14 Correct 19 ms 1780 KB Output is correct
15 Partially correct 44 ms 1780 KB Partially correct - number of queries: 6623
16 Partially correct 59 ms 1780 KB Partially correct - number of queries: 7196
17 Partially correct 83 ms 1780 KB Partially correct - number of queries: 7205
18 Partially correct 59 ms 1780 KB Partially correct - number of queries: 7193
19 Partially correct 69 ms 1780 KB Partially correct - number of queries: 6746
20 Correct 29 ms 1780 KB Output is correct
21 Partially correct 81 ms 1780 KB Partially correct - number of queries: 7091
22 Partially correct 70 ms 1780 KB Partially correct - number of queries: 5288
23 Correct 7 ms 1780 KB Output is correct
24 Correct 9 ms 1780 KB Output is correct
25 Partially correct 67 ms 1780 KB Partially correct - number of queries: 6992
26 Partially correct 64 ms 1780 KB Partially correct - number of queries: 6985
27 Correct 8 ms 1780 KB Output is correct
28 Partially correct 89 ms 1780 KB Partially correct - number of queries: 6855
29 Partially correct 73 ms 1780 KB Partially correct - number of queries: 5738
30 Partially correct 65 ms 1780 KB Partially correct - number of queries: 7089
31 Partially correct 65 ms 1780 KB Partially correct - number of queries: 7108
32 Correct 13 ms 1780 KB Output is correct
33 Correct 3 ms 1780 KB Output is correct
34 Partially correct 49 ms 1780 KB Partially correct - number of queries: 7212
35 Correct 8 ms 1780 KB Output is correct
36 Partially correct 58 ms 1780 KB Partially correct - number of queries: 7135
37 Correct 11 ms 1780 KB Output is correct
38 Correct 8 ms 1780 KB Output is correct
39 Partially correct 71 ms 1780 KB Partially correct - number of queries: 7105
40 Partially correct 80 ms 1780 KB Partially correct - number of queries: 6051
41 Partially correct 49 ms 1780 KB Partially correct - number of queries: 7222
42 Partially correct 35 ms 1780 KB Partially correct - number of queries: 7222
43 Partially correct 94 ms 1780 KB Partially correct - number of queries: 6997
44 Partially correct 75 ms 1780 KB Partially correct - number of queries: 7217
45 Partially correct 41 ms 1780 KB Partially correct - number of queries: 6994
46 Partially correct 85 ms 1780 KB Partially correct - number of queries: 7203
47 Partially correct 79 ms 1780 KB Partially correct - number of queries: 7030
48 Partially correct 95 ms 1780 KB Partially correct - number of queries: 7206
49 Partially correct 72 ms 1780 KB Partially correct - number of queries: 7208
50 Partially correct 65 ms 1780 KB Partially correct - number of queries: 7193
51 Partially correct 78 ms 1780 KB Partially correct - number of queries: 7219
52 Partially correct 66 ms 1780 KB Partially correct - number of queries: 7202
53 Correct 7 ms 1780 KB Output is correct
54 Partially correct 65 ms 1780 KB Partially correct - number of queries: 7094
55 Partially correct 56 ms 1780 KB Partially correct - number of queries: 7201
56 Partially correct 96 ms 1780 KB Partially correct - number of queries: 7194
57 Partially correct 91 ms 1780 KB Partially correct - number of queries: 7109
58 Partially correct 60 ms 1780 KB Partially correct - number of queries: 7203
59 Partially correct 95 ms 1780 KB Partially correct - number of queries: 7222
60 Partially correct 79 ms 1780 KB Partially correct - number of queries: 7096
61 Correct 9 ms 1780 KB Output is correct
62 Correct 7 ms 1780 KB Output is correct
63 Correct 7 ms 1780 KB Output is correct
64 Correct 6 ms 1780 KB Output is correct
65 Correct 11 ms 1780 KB Output is correct
66 Correct 61 ms 1780 KB Output is correct
67 Correct 43 ms 1780 KB Output is correct
68 Incorrect 76 ms 1780 KB answer is not correct
69 Halted 0 ms 0 KB -