Submission #721450

# Submission time Handle Problem Language Result Execution time Memory
721450 2023-04-11T01:45:00 Z minhcool The Big Prize (IOI17_prize) C++17
20 / 100
92 ms 336 KB
#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
 
#define fi first
#define se second
#define pb push_back
#define mp make_pair
 
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
 
const int N = 3e5 + 5;
 
const int oo = 1e18 + 7, mod = 1e9 + 7;
 
int n;
 
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
int rnd(int l, int r){
	int temp = rng() % (r - l + 1);
	return abs(temp) + l;
}
 
vector<int> askk(int pos){
	return ask(pos - 1);
}
 
int find_best(int N){
	n = N;
	if(n <= 5000){
		for(int i = 1; i <= n; i++){
			vector<int> res = askk(i);
			if(res[0] == 0 && res[1] == 0) return i - 1;
		}
	}
	//cout << "OK\n";
	int mx = -1;
	for(int i = 1; i <= 20; i++){
		vector<int> v = askk(rnd(1, n));
		mx = max(mx, v[0] + v[1]);
	}
	int itr = 0, tot = 0;
	while(1){
      if(itr >= n) return n - 1;
		int l = itr + 1, r = n;
		while(l < r){
			int mid = (l + r) >> 1;
			vector<int> a = askk(mid);
			if(a[0] + a[1] != mx) r = mid;
			else if(a[0] > tot) r = mid;
			else l = mid + 1;
		}
		vector<int> v = askk(l);
		if(!(v[0] + v[1])) return l - 1;
		itr = l;
        tot++;
		/*
		assert(l != n);
		vector<int> v = ask(l + 1);
		assert(v[0] + v[1] != mx);
		if(!(v[0] + v[1])) return l + 1;
		int temp = l + 1;
		set<int> se;
		se.insert(mx);
		se.insert(v[0] + v[1]);*/
	}
}
 
 
/*
void process(){
 
}
 
signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t;
	cin >> t;
	while(t--) process();
}
*/

Compilation message

prize.cpp:16:21: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   16 | const int oo = 1e18 + 7, mod = 1e9 + 7;
      |                ~~~~~^~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 284 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 1 ms 292 KB Output is correct
6 Correct 1 ms 292 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 296 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 292 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 292 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 3 ms 300 KB Output is correct
12 Correct 1 ms 296 KB Output is correct
13 Correct 7 ms 292 KB Output is correct
14 Correct 4 ms 208 KB Output is correct
15 Correct 9 ms 292 KB Output is correct
16 Partially correct 27 ms 296 KB Partially correct - number of queries: 6974
17 Correct 1 ms 328 KB Output is correct
18 Partially correct 64 ms 208 KB Partially correct - number of queries: 8179
19 Correct 1 ms 208 KB Output is correct
20 Correct 19 ms 208 KB Output is correct
21 Correct 24 ms 296 KB Output is correct
22 Correct 5 ms 208 KB Output is correct
23 Correct 1 ms 208 KB Output is correct
24 Correct 1 ms 300 KB Output is correct
25 Correct 31 ms 208 KB Output is correct
26 Correct 37 ms 208 KB Output is correct
27 Correct 1 ms 296 KB Output is correct
28 Partially correct 65 ms 296 KB Partially correct - number of queries: 7795
29 Partially correct 40 ms 292 KB Partially correct - number of queries: 5897
30 Partially correct 70 ms 208 KB Partially correct - number of queries: 8091
31 Correct 1 ms 208 KB Output is correct
32 Correct 2 ms 328 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Correct 32 ms 208 KB Output is correct
35 Correct 2 ms 300 KB Output is correct
36 Correct 16 ms 208 KB Output is correct
37 Correct 1 ms 208 KB Output is correct
38 Correct 2 ms 208 KB Output is correct
39 Correct 30 ms 208 KB Output is correct
40 Partially correct 27 ms 300 KB Partially correct - number of queries: 6920
41 Correct 37 ms 208 KB Output is correct
42 Correct 46 ms 208 KB Output is correct
43 Correct 37 ms 208 KB Output is correct
44 Correct 25 ms 300 KB Output is correct
45 Correct 19 ms 296 KB Output is correct
46 Correct 1 ms 208 KB Output is correct
47 Correct 23 ms 208 KB Output is correct
48 Partially correct 43 ms 272 KB Partially correct - number of queries: 6049
49 Correct 7 ms 292 KB Output is correct
50 Partially correct 55 ms 208 KB Partially correct - number of queries: 8174
51 Correct 33 ms 208 KB Output is correct
52 Correct 1 ms 292 KB Output is correct
53 Correct 1 ms 336 KB Output is correct
54 Correct 25 ms 296 KB Output is correct
55 Correct 1 ms 208 KB Output is correct
56 Partially correct 66 ms 300 KB Partially correct - number of queries: 8161
57 Partially correct 24 ms 328 KB Partially correct - number of queries: 5960
58 Partially correct 51 ms 288 KB Partially correct - number of queries: 6074
59 Correct 22 ms 336 KB Output is correct
60 Correct 35 ms 292 KB Output is correct
61 Correct 2 ms 208 KB Output is correct
62 Correct 1 ms 208 KB Output is correct
63 Correct 1 ms 208 KB Output is correct
64 Correct 2 ms 292 KB Output is correct
65 Correct 5 ms 292 KB Output is correct
66 Correct 41 ms 208 KB Output is correct
67 Correct 1 ms 296 KB Output is correct
68 Partially correct 63 ms 208 KB Partially correct - number of queries: 8513
69 Correct 41 ms 208 KB Output is correct
70 Correct 2 ms 208 KB Output is correct
71 Partially correct 76 ms 208 KB Partially correct - number of queries: 8361
72 Correct 7 ms 208 KB Output is correct
73 Partially correct 60 ms 296 KB Partially correct - number of queries: 8239
74 Partially correct 68 ms 208 KB Partially correct - number of queries: 8299
75 Correct 2 ms 208 KB Output is correct
76 Partially correct 44 ms 208 KB Partially correct - number of queries: 7100
77 Partially correct 78 ms 208 KB Partially correct - number of queries: 8248
78 Correct 4 ms 208 KB Output is correct
79 Correct 37 ms 208 KB Output is correct
80 Partially correct 75 ms 256 KB Partially correct - number of queries: 8228
81 Partially correct 82 ms 208 KB Partially correct - number of queries: 8221
82 Partially correct 68 ms 208 KB Partially correct - number of queries: 8163
83 Correct 2 ms 208 KB Output is correct
84 Partially correct 55 ms 208 KB Partially correct - number of queries: 6712
85 Partially correct 69 ms 208 KB Partially correct - number of queries: 8228
86 Partially correct 92 ms 208 KB Partially correct - number of queries: 9186
87 Correct 3 ms 208 KB Output is correct
88 Partially correct 44 ms 296 KB Partially correct - number of queries: 5473
89 Partially correct 33 ms 208 KB Partially correct - number of queries: 5023
90 Correct 2 ms 208 KB Output is correct
91 Incorrect 89 ms 208 KB Incorrect
92 Halted 0 ms 0 KB -