Submission #50189

# Submission time Handle Problem Language Result Execution time Memory
50189 2018-06-08T08:23:53 Z Mamnoon_Siam The Big Prize (IOI17_prize) C++17
95.79 / 100
65 ms 5564 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 mx_tot = 0;
vector<int> blocks;

int Left(int i) {
	if(memo[i].empty()) memo[i] = ask(i);
	return memo[i][0];
}
int Total(int i) {
	if(memo[i].empty()) memo[i] = ask(i);
	return memo[i][0] + memo[i][1];
}
bool IsThere(int i, int j) {
	if(Total(j) < mx_tot) return true;
	return (Left(j) - Left(i)) > 0;
}
bool Thicc(int i) {
	return Total(i) < mx_tot;
}

int next_thicc(int i) {
	if(Thicc(i)) return i;
	int it = lower_bound(all(blocks), i) - blocks.begin();
	while(!IsThere(i, blocks[it])) it++;
	int lo = i, hi = blocks[it];
	int ret = -1;
	while(lo <= hi) {
		int mid = lo + hi >> 1;
		if(IsThere(i, mid)) {
			ret = mid;
			hi = mid - 1;
		} else {
			lo = mid + 1;
		}
	} return ret;
}

int find_best(int n) { int debug = 0;
	if(!debug) if(n <= 5000)
		for(int i = 0; i < n; i++)
			if(Total(i) == 0)
				return i;

	int k = 850; int sz = n / k;
	for(int i = 0; i < n; i += sz) {
		blocks.push_back(i);
	} if(blocks.back() != n-1) blocks.push_back(n-1);
	for(int b : blocks) mx_tot = max(mx_tot, Total(b));
	int now = 0;
	while(true) {
		now = next_thicc(now);
		if(Total(now) == 0) return now;
		now++;
	}
}

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 next_thicc(int)':
prize.cpp:54:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   int mid = lo + hi >> 1;
             ~~~^~~~
# Verdict Execution time Memory Grader output
1 Correct 13 ms 5028 KB Output is correct
2 Correct 13 ms 5048 KB Output is correct
3 Correct 12 ms 5100 KB Output is correct
4 Correct 12 ms 5176 KB Output is correct
5 Correct 13 ms 5176 KB Output is correct
6 Correct 14 ms 5236 KB Output is correct
7 Correct 12 ms 5236 KB Output is correct
8 Correct 11 ms 5236 KB Output is correct
9 Correct 10 ms 5236 KB Output is correct
10 Correct 10 ms 5236 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 9 ms 5284 KB Output is correct
2 Correct 13 ms 5312 KB Output is correct
3 Correct 12 ms 5312 KB Output is correct
4 Correct 10 ms 5312 KB Output is correct
5 Correct 11 ms 5312 KB Output is correct
6 Correct 10 ms 5312 KB Output is correct
7 Correct 14 ms 5312 KB Output is correct
8 Correct 12 ms 5312 KB Output is correct
9 Correct 13 ms 5312 KB Output is correct
10 Correct 12 ms 5312 KB Output is correct
11 Correct 14 ms 5312 KB Output is correct
12 Correct 12 ms 5312 KB Output is correct
13 Correct 16 ms 5312 KB Output is correct
14 Correct 13 ms 5312 KB Output is correct
15 Correct 16 ms 5312 KB Output is correct
16 Correct 23 ms 5404 KB Output is correct
17 Correct 9 ms 5404 KB Output is correct
18 Partially correct 31 ms 5404 KB Partially correct - number of queries: 5389
19 Correct 12 ms 5404 KB Output is correct
20 Correct 23 ms 5404 KB Output is correct
21 Correct 21 ms 5404 KB Output is correct
22 Correct 13 ms 5404 KB Output is correct
23 Correct 14 ms 5404 KB Output is correct
24 Correct 12 ms 5404 KB Output is correct
25 Correct 29 ms 5404 KB Output is correct
26 Correct 45 ms 5404 KB Output is correct
27 Correct 16 ms 5404 KB Output is correct
28 Correct 46 ms 5404 KB Output is correct
29 Correct 34 ms 5404 KB Output is correct
30 Partially correct 42 ms 5408 KB Partially correct - number of queries: 5353
31 Correct 13 ms 5408 KB Output is correct
32 Correct 20 ms 5408 KB Output is correct
33 Correct 6 ms 5408 KB Output is correct
34 Correct 25 ms 5408 KB Output is correct
35 Correct 15 ms 5408 KB Output is correct
36 Correct 22 ms 5408 KB Output is correct
37 Correct 13 ms 5408 KB Output is correct
38 Correct 9 ms 5408 KB Output is correct
39 Correct 29 ms 5408 KB Output is correct
40 Correct 24 ms 5416 KB Output is correct
41 Correct 18 ms 5416 KB Output is correct
42 Correct 34 ms 5416 KB Output is correct
43 Correct 29 ms 5436 KB Output is correct
44 Correct 24 ms 5436 KB Output is correct
45 Correct 23 ms 5436 KB Output is correct
46 Correct 12 ms 5436 KB Output is correct
47 Correct 29 ms 5436 KB Output is correct
48 Correct 37 ms 5436 KB Output is correct
49 Correct 18 ms 5436 KB Output is correct
50 Partially correct 50 ms 5436 KB Partially correct - number of queries: 5383
51 Correct 29 ms 5436 KB Output is correct
52 Correct 14 ms 5436 KB Output is correct
53 Correct 15 ms 5436 KB Output is correct
54 Correct 23 ms 5436 KB Output is correct
55 Correct 14 ms 5436 KB Output is correct
56 Partially correct 50 ms 5436 KB Partially correct - number of queries: 5397
57 Correct 49 ms 5436 KB Output is correct
58 Correct 37 ms 5436 KB Output is correct
59 Correct 36 ms 5436 KB Output is correct
60 Correct 18 ms 5436 KB Output is correct
61 Correct 13 ms 5436 KB Output is correct
62 Correct 13 ms 5436 KB Output is correct
63 Correct 18 ms 5436 KB Output is correct
64 Correct 14 ms 5436 KB Output is correct
65 Correct 14 ms 5436 KB Output is correct
66 Correct 27 ms 5436 KB Output is correct
67 Correct 14 ms 5436 KB Output is correct
68 Correct 20 ms 5436 KB Output is correct
69 Correct 25 ms 5436 KB Output is correct
70 Correct 16 ms 5436 KB Output is correct
71 Partially correct 53 ms 5436 KB Partially correct - number of queries: 5268
72 Correct 15 ms 5436 KB Output is correct
73 Partially correct 53 ms 5436 KB Partially correct - number of queries: 5211
74 Partially correct 56 ms 5436 KB Partially correct - number of queries: 5236
75 Correct 14 ms 5436 KB Output is correct
76 Correct 49 ms 5436 KB Output is correct
77 Partially correct 65 ms 5436 KB Partially correct - number of queries: 5408
78 Correct 17 ms 5436 KB Output is correct
79 Correct 33 ms 5436 KB Output is correct
80 Partially correct 44 ms 5436 KB Partially correct - number of queries: 5421
81 Partially correct 50 ms 5436 KB Partially correct - number of queries: 5389
82 Partially correct 64 ms 5436 KB Partially correct - number of queries: 5361
83 Correct 14 ms 5436 KB Output is correct
84 Correct 25 ms 5564 KB Output is correct
85 Partially correct 47 ms 5564 KB Partially correct - number of queries: 5383
86 Correct 37 ms 5564 KB Output is correct
87 Correct 11 ms 5564 KB Output is correct
88 Correct 49 ms 5564 KB Output is correct
89 Correct 49 ms 5564 KB Output is correct
90 Correct 14 ms 5564 KB Output is correct
91 Correct 33 ms 5564 KB Output is correct
92 Correct 40 ms 5564 KB Output is correct
93 Correct 53 ms 5564 KB Output is correct
94 Correct 61 ms 5564 KB Output is correct
95 Correct 51 ms 5564 KB Output is correct
96 Correct 48 ms 5564 KB Output is correct
97 Correct 49 ms 5564 KB Output is correct