oj.uz

Submission #768115

# Submission time Handle Problem Language Result Execution time Memory
768115 2023-06-27T13:22:38 Z GrindMachine The Big Prize (IOI17_prize) C++17
20 / 100
 95 ms 336 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
edi


f(i+1) > f(i)^2
#of non-lollipops = O(sqrt(n))

just check all non-lollipops for diamond
efficiently find all non-lollipops

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "prize.h"

pii ask2(int i){
	vector<int> v = ask(i);
	return {v[0],v[1]};
}

int find_best(int n) {
	int mx = -1, pos = -1;

	rep(i,450){
		auto [cl,cr] = ask2(i);
		int cnt = cl+cr;
		if(cnt == 0){
			return i;
		}

		if(cnt > mx){
			mx = cnt;
			pos = i;
		}
	}

	assert(pos != -1);

	// find the closest non-lollipop with ind > i
	// given that the curr pos is a lollipop
	while(true){
		int l = pos, r = n-1;
		auto [fcl,fcr] = ask2(pos);
		int first = -1;

		while(l <= r){
			// is there a lollipop in range [pos,mid]?
			int mid = (l+r) >> 1;
			auto [cl,cr] = ask2(mid);
			int cnt = cl+cr;
			bool ok = false;

			// mid is a lollipop
			if(cnt != mx){
				ok = true;
			}
			else{
				// mid is not a lollipop
				if(cl > fcl){
					ok = true;
				}
			}

			if(ok){
				first = mid;
				r = mid-1;
			}
			else{
				l = mid+1;
			}
		}

		if(first == -1){
			break;
		}

		pos = -1;

		// find the closest pos >= first that is a lollipop
		for(int i = first; i < n; ++i){
			auto [cl,cr] = ask2(i);
			int cnt = cl+cr;
			
			if(cnt == 0){
				return i;
			}

			if(cnt == mx){
				pos = i;
				break;
			}
		}

		if(pos == -1) break;
	}

	// assert(0);
	return -1;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 208 KB Output is correct
2 Correct 2 ms 336 KB Output is correct
3 Correct 3 ms 292 KB Output is correct
4 Correct 4 ms 292 KB Output is correct
5 Correct 4 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 2 ms 288 KB Output is correct
8 Correct 2 ms 292 KB Output is correct
9 Correct 3 ms 288 KB Output is correct
10 Correct 4 ms 208 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 208 KB Output is correct
2 Correct 4 ms 208 KB Output is correct
3 Correct 4 ms 292 KB Output is correct
4 Correct 4 ms 288 KB Output is correct
5 Correct 3 ms 208 KB Output is correct
6 Correct 0 ms 292 KB Output is correct
7 Correct 2 ms 288 KB Output is correct
8 Correct 4 ms 296 KB Output is correct
9 Correct 3 ms 208 KB Output is correct
10 Correct 5 ms 208 KB Output is correct
11 Correct 3 ms 288 KB Output is correct
12 Correct 2 ms 288 KB Output is correct
13 Correct 4 ms 288 KB Output is correct
14 Correct 8 ms 208 KB Output is correct
15 Correct 6 ms 336 KB Output is correct
16 Partially correct 27 ms 292 KB Partially correct - number of queries: 8171
17 Correct 4 ms 292 KB Output is correct
18 Partially correct 81 ms 208 KB Partially correct - number of queries: 9534
19 Correct 4 ms 288 KB Output is correct
20 Correct 20 ms 208 KB Output is correct
21 Correct 13 ms 284 KB Output is correct
22 Correct 10 ms 292 KB Output is correct
23 Correct 4 ms 292 KB Output is correct
24 Correct 4 ms 284 KB Output is correct
25 Partially correct 19 ms 336 KB Partially correct - number of queries: 5570
26 Partially correct 46 ms 276 KB Partially correct - number of queries: 5489
27 Correct 4 ms 208 KB Output is correct
28 Partially correct 56 ms 288 KB Partially correct - number of queries: 9075
29 Partially correct 49 ms 208 KB Partially correct - number of queries: 6976
30 Partially correct 58 ms 208 KB Partially correct - number of queries: 9453
31 Correct 2 ms 292 KB Output is correct
32 Correct 5 ms 296 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 29 ms 208 KB Output is correct
35 Correct 3 ms 336 KB Output is correct
36 Correct 31 ms 208 KB Output is correct
37 Correct 3 ms 288 KB Output is correct
38 Correct 3 ms 292 KB Output is correct
39 Correct 37 ms 292 KB Output is correct
40 Partially correct 45 ms 296 KB Partially correct - number of queries: 8140
41 Partially correct 48 ms 316 KB Partially correct - number of queries: 5865
42 Partially correct 19 ms 268 KB Partially correct - number of queries: 5865
43 Partially correct 42 ms 288 KB Partially correct - number of queries: 5338
44 Correct 36 ms 292 KB Output is correct
45 Correct 21 ms 208 KB Output is correct
46 Correct 2 ms 296 KB Output is correct
47 Correct 29 ms 300 KB Output is correct
48 Partially correct 29 ms 296 KB Partially correct - number of queries: 7146
49 Correct 10 ms 296 KB Output is correct
50 Partially correct 58 ms 208 KB Partially correct - number of queries: 9528
51 Correct 14 ms 336 KB Output is correct
52 Correct 5 ms 288 KB Output is correct
53 Correct 4 ms 208 KB Output is correct
54 Correct 28 ms 208 KB Output is correct
55 Correct 4 ms 208 KB Output is correct
56 Partially correct 62 ms 292 KB Partially correct - number of queries: 9527
57 Partially correct 45 ms 292 KB Partially correct - number of queries: 7054
58 Partially correct 44 ms 208 KB Partially correct - number of queries: 7166
59 Partially correct 27 ms 292 KB Partially correct - number of queries: 5865
60 Partially correct 39 ms 292 KB Partially correct - number of queries: 5471
61 Correct 8 ms 208 KB Output is correct
62 Correct 5 ms 284 KB Output is correct
63 Correct 5 ms 208 KB Output is correct
64 Correct 2 ms 284 KB Output is correct
65 Correct 4 ms 292 KB Output is correct
66 Correct 8 ms 292 KB Output is correct
67 Correct 4 ms 208 KB Output is correct
68 Correct 3 ms 292 KB Output is correct
69 Correct 8 ms 208 KB Output is correct
70 Correct 3 ms 208 KB Output is correct
71 Partially correct 56 ms 208 KB Partially correct - number of queries: 9666
72 Correct 10 ms 208 KB Output is correct
73 Partially correct 76 ms 288 KB Partially correct - number of queries: 9528
74 Partially correct 67 ms 208 KB Partially correct - number of queries: 9609
75 Correct 5 ms 208 KB Output is correct
76 Partially correct 53 ms 208 KB Partially correct - number of queries: 8284
77 Partially correct 58 ms 208 KB Partially correct - number of queries: 9548
78 Correct 9 ms 208 KB Output is correct
79 Correct 42 ms 208 KB Output is correct
80 Partially correct 95 ms 208 KB Partially correct - number of queries: 9523
81 Partially correct 34 ms 208 KB Partially correct - number of queries: 9539
82 Partially correct 70 ms 208 KB Partially correct - number of queries: 9475
83 Correct 3 ms 336 KB Output is correct
84 Partially correct 47 ms 208 KB Partially correct - number of queries: 7863
85 Partially correct 71 ms 208 KB Partially correct - number of queries: 9601
86 Incorrect 63 ms 208 KB Incorrect
87 Halted 0 ms 0 KB -