Submission #50155

# Submission time Handle Problem Language Result Execution time Memory
50155 2018-06-08T01:28:41 Z Mamnoon_Siam The Big Prize (IOI17_prize) C++17
90 / 100
98 ms 5656 KB
//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

#define debug(s) cout<< #s <<" = "<< s <<endl
#define all(v) (v).begin(), (v).end()
#define KeepUnique(v) (v).erase( unique(all(v)), v.end() )
#define MEMSET(a,val) memset(a, val, sizeof a)
#define PB push_back
#define endl '\n'

inline int myrand(int l, int r) {
	int ret = rand(); ret <<= 15; ret ^= rand();
	if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
	return ret;
}
template <typename F, typename S>
ostream& operator << (ostream& os, const pair< F, S>& p) {
    return os<<"(" <<p.first<<", "<<p.second<<")";
}

const int maxn = 200010;

vector<int> memo[maxn];

int Left(int i) {
	if(i < 0) return 0;
	if(memo[i].empty()) memo[i] = ask(i);
	return memo[i][0];
}
int Right(int i) {
	if(i < 0) return 0;
	if(memo[i].empty()) memo[i] = ask(i);
	return memo[i][1];
}
int Total(int i) {
	if(i < 0) return 0;
	if(memo[i].empty()) memo[i] = ask(i);
	return memo[i][0] + memo[i][1];
}

int find_best(int n) {
	if(n <= 5000) { // fix
		for(int i = 0; i < n; i++) {
			if(Total(i) == 0) {
				return i;
			}
		}
	}
	int mx_tot = 0, id = -1;
	for(int i = 0; i < 477; i++) { // fix
		mx_tot = max(mx_tot, Total(i));
	}

	int now = 0;
	int cnt = 0;
	while(now < n) {
		while(Total(now) < mx_tot and now < n) {
			if(Total(now) == 0) return now;
			now++;
		}
		int lo = now, hi = n - 1;
		int ret = -1;
		while(lo <= hi) {
			int mid = lo + hi >> 1;
			bool full = ((Left(mid) - Left(now) == 0) and (Total(mid) == mx_tot));
			if(!full) {
				hi = mid - 1;
			} else {
				lo = mid + 1;
				ret = mid;
			}
		} now = ret + 1;
	}
	return 0;
}

Compilation message

prize.cpp: In function 'int myrand(int, int)':
prize.cpp:17:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
  ^~
prize.cpp:17:26: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
                          ^~~
prize.cpp: In function 'int find_best(int)':
prize.cpp:68:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
    int mid = lo + hi >> 1;
              ~~~^~~~
prize.cpp:53:18: warning: unused variable 'id' [-Wunused-variable]
  int mx_tot = 0, id = -1;
                  ^~
prize.cpp:59:6: warning: unused variable 'cnt' [-Wunused-variable]
  int cnt = 0;
      ^~~
# Verdict Execution time Memory Grader output
1 Correct 11 ms 4984 KB Output is correct
2 Correct 8 ms 5072 KB Output is correct
3 Correct 11 ms 5140 KB Output is correct
4 Correct 10 ms 5148 KB Output is correct
5 Correct 10 ms 5148 KB Output is correct
6 Correct 9 ms 5192 KB Output is correct
7 Correct 9 ms 5192 KB Output is correct
8 Correct 8 ms 5228 KB Output is correct
9 Correct 9 ms 5228 KB Output is correct
10 Correct 10 ms 5264 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 10 ms 5264 KB Output is correct
2 Correct 10 ms 5264 KB Output is correct
3 Correct 10 ms 5264 KB Output is correct
4 Correct 11 ms 5304 KB Output is correct
5 Correct 12 ms 5304 KB Output is correct
6 Correct 10 ms 5304 KB Output is correct
7 Correct 10 ms 5304 KB Output is correct
8 Correct 11 ms 5304 KB Output is correct
9 Correct 10 ms 5304 KB Output is correct
10 Correct 10 ms 5304 KB Output is correct
11 Correct 13 ms 5304 KB Output is correct
12 Correct 10 ms 5308 KB Output is correct
13 Correct 16 ms 5308 KB Output is correct
14 Correct 14 ms 5308 KB Output is correct
15 Correct 25 ms 5308 KB Output is correct
16 Partially correct 86 ms 5436 KB Partially correct - number of queries: 7196
17 Correct 11 ms 5436 KB Output is correct
18 Partially correct 75 ms 5436 KB Partially correct - number of queries: 8356
19 Correct 11 ms 5436 KB Output is correct
20 Correct 36 ms 5436 KB Output is correct
21 Correct 41 ms 5436 KB Output is correct
22 Correct 15 ms 5436 KB Output is correct
23 Correct 8 ms 5436 KB Output is correct
24 Correct 13 ms 5436 KB Output is correct
25 Correct 55 ms 5436 KB Output is correct
26 Correct 67 ms 5436 KB Output is correct
27 Correct 10 ms 5436 KB Output is correct
28 Partially correct 55 ms 5620 KB Partially correct - number of queries: 7880
29 Partially correct 71 ms 5620 KB Partially correct - number of queries: 6120
30 Partially correct 96 ms 5620 KB Partially correct - number of queries: 8285
31 Correct 10 ms 5620 KB Output is correct
32 Correct 19 ms 5620 KB Output is correct
33 Correct 6 ms 5620 KB Output is correct
34 Correct 34 ms 5620 KB Output is correct
35 Correct 9 ms 5620 KB Output is correct
36 Correct 25 ms 5620 KB Output is correct
37 Correct 12 ms 5620 KB Output is correct
38 Correct 11 ms 5620 KB Output is correct
39 Correct 24 ms 5620 KB Output is correct
40 Partially correct 70 ms 5620 KB Partially correct - number of queries: 7161
41 Partially correct 60 ms 5620 KB Partially correct - number of queries: 5216
42 Partially correct 53 ms 5620 KB Partially correct - number of queries: 5216
43 Correct 40 ms 5620 KB Output is correct
44 Correct 34 ms 5620 KB Output is correct
45 Correct 39 ms 5620 KB Output is correct
46 Correct 9 ms 5620 KB Output is correct
47 Correct 42 ms 5620 KB Output is correct
48 Partially correct 60 ms 5620 KB Partially correct - number of queries: 6312
49 Correct 12 ms 5620 KB Output is correct
50 Partially correct 75 ms 5620 KB Partially correct - number of queries: 8357
51 Correct 47 ms 5620 KB Output is correct
52 Correct 16 ms 5620 KB Output is correct
53 Correct 9 ms 5620 KB Output is correct
54 Correct 35 ms 5620 KB Output is correct
55 Correct 8 ms 5620 KB Output is correct
56 Partially correct 84 ms 5620 KB Partially correct - number of queries: 8352
57 Partially correct 57 ms 5620 KB Partially correct - number of queries: 6216
58 Partially correct 29 ms 5620 KB Partially correct - number of queries: 6298
59 Partially correct 39 ms 5620 KB Partially correct - number of queries: 5213
60 Correct 54 ms 5620 KB Output is correct
61 Correct 12 ms 5620 KB Output is correct
62 Correct 9 ms 5620 KB Output is correct
63 Correct 11 ms 5620 KB Output is correct
64 Correct 10 ms 5620 KB Output is correct
65 Correct 10 ms 5620 KB Output is correct
66 Correct 11 ms 5620 KB Output is correct
67 Correct 11 ms 5620 KB Output is correct
68 Correct 11 ms 5620 KB Output is correct
69 Correct 14 ms 5620 KB Output is correct
70 Correct 8 ms 5620 KB Output is correct
71 Partially correct 63 ms 5620 KB Partially correct - number of queries: 8247
72 Correct 17 ms 5620 KB Output is correct
73 Partially correct 61 ms 5656 KB Partially correct - number of queries: 8136
74 Partially correct 98 ms 5656 KB Partially correct - number of queries: 8196
75 Correct 11 ms 5656 KB Output is correct
76 Partially correct 60 ms 5656 KB Partially correct - number of queries: 7093
77 Partially correct 61 ms 5656 KB Partially correct - number of queries: 8377
78 Correct 12 ms 5656 KB Output is correct
79 Correct 39 ms 5656 KB Output is correct
80 Partially correct 60 ms 5656 KB Partially correct - number of queries: 8421
81 Partially correct 89 ms 5656 KB Partially correct - number of queries: 8412
82 Partially correct 42 ms 5656 KB Partially correct - number of queries: 8361
83 Correct 13 ms 5656 KB Output is correct
84 Partially correct 76 ms 5656 KB Partially correct - number of queries: 6947
85 Partially correct 69 ms 5656 KB Partially correct - number of queries: 8405
86 Correct 11 ms 5656 KB Output is correct
87 Correct 10 ms 5656 KB Output is correct
88 Correct 10 ms 5656 KB Output is correct
89 Correct 11 ms 5656 KB Output is correct
90 Correct 9 ms 5656 KB Output is correct
91 Correct 8 ms 5656 KB Output is correct
92 Correct 10 ms 5656 KB Output is correct
93 Correct 14 ms 5656 KB Output is correct
94 Correct 13 ms 5656 KB Output is correct
95 Correct 17 ms 5656 KB Output is correct
96 Correct 15 ms 5656 KB Output is correct
97 Correct 11 ms 5656 KB Output is correct