oj.uz

Submission #768121

# Submission time Handle Problem Language Result Execution time Memory
768121 2023-06-27T13:28:39 Z GrindMachine The Big Prize (IOI17_prize) C++17
90 / 100
 78 ms 2000 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 = 2e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "prize.h"

vector<pii> dp(N,{-1,-1});

pii ask2(int i){
	if(dp[i].ff != -1) return dp[i];
	vector<int> v = ask(i);
	return dp[i] = {v[0],v[1]};
}

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

	rep(i,500){
		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 3 ms 1872 KB Output is correct
2 Correct 6 ms 1872 KB Output is correct
3 Correct 4 ms 1872 KB Output is correct
4 Correct 5 ms 1872 KB Output is correct
5 Correct 6 ms 1872 KB Output is correct
6 Correct 1 ms 1864 KB Output is correct
7 Correct 5 ms 1872 KB Output is correct
8 Correct 5 ms 1868 KB Output is correct
9 Correct 3 ms 1872 KB Output is correct
10 Correct 6 ms 1872 KB Output is correct

Subtask #2
70.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1876 KB Output is correct
2 Correct 3 ms 1872 KB Output is correct
3 Correct 3 ms 1872 KB Output is correct
4 Correct 4 ms 1868 KB Output is correct
5 Correct 6 ms 1872 KB Output is correct
6 Correct 1 ms 1872 KB Output is correct
7 Correct 4 ms 1868 KB Output is correct
8 Correct 4 ms 1872 KB Output is correct
9 Correct 6 ms 1864 KB Output is correct
10 Correct 4 ms 1872 KB Output is correct
11 Correct 7 ms 1872 KB Output is correct
12 Correct 3 ms 1872 KB Output is correct
13 Correct 5 ms 1872 KB Output is correct
14 Correct 9 ms 1872 KB Output is correct
15 Correct 6 ms 1920 KB Output is correct
16 Partially correct 47 ms 1872 KB Partially correct - number of queries: 7218
17 Correct 3 ms 1872 KB Output is correct
18 Partially correct 46 ms 1872 KB Partially correct - number of queries: 8378
19 Correct 4 ms 1868 KB Output is correct
20 Correct 21 ms 1872 KB Output is correct
21 Correct 22 ms 1872 KB Output is correct
22 Correct 10 ms 1872 KB Output is correct
23 Correct 6 ms 1868 KB Output is correct
24 Correct 5 ms 1868 KB Output is correct
25 Correct 18 ms 1872 KB Output is correct
26 Correct 18 ms 1864 KB Output is correct
27 Correct 3 ms 1868 KB Output is correct
28 Partially correct 67 ms 1744 KB Partially correct - number of queries: 7903
29 Partially correct 35 ms 1872 KB Partially correct - number of queries: 6143
30 Partially correct 43 ms 1876 KB Partially correct - number of queries: 8307
31 Correct 3 ms 1872 KB Output is correct
32 Correct 4 ms 1872 KB Output is correct
33 Correct 1 ms 1872 KB Output is correct
34 Correct 25 ms 1872 KB Output is correct
35 Correct 4 ms 2000 KB Output is correct
36 Correct 20 ms 1868 KB Output is correct
37 Correct 5 ms 1872 KB Output is correct
38 Correct 5 ms 1872 KB Output is correct
39 Correct 34 ms 1872 KB Output is correct
40 Partially correct 34 ms 1768 KB Partially correct - number of queries: 7178
41 Partially correct 28 ms 1872 KB Partially correct - number of queries: 5238
42 Partially correct 19 ms 1868 KB Partially correct - number of queries: 5238
43 Correct 17 ms 1864 KB Output is correct
44 Correct 32 ms 1872 KB Output is correct
45 Correct 21 ms 1872 KB Output is correct
46 Correct 2 ms 1872 KB Output is correct
47 Correct 46 ms 1872 KB Output is correct
48 Partially correct 51 ms 1872 KB Partially correct - number of queries: 6334
49 Correct 5 ms 1868 KB Output is correct
50 Partially correct 78 ms 1872 KB Partially correct - number of queries: 8379
51 Correct 13 ms 1868 KB Output is correct
52 Correct 6 ms 1860 KB Output is correct
53 Correct 3 ms 2000 KB Output is correct
54 Correct 33 ms 1872 KB Output is correct
55 Correct 5 ms 1872 KB Output is correct
56 Partially correct 36 ms 1868 KB Partially correct - number of queries: 8374
57 Partially correct 43 ms 1872 KB Partially correct - number of queries: 6238
58 Partially correct 47 ms 1872 KB Partially correct - number of queries: 6320
59 Partially correct 40 ms 1872 KB Partially correct - number of queries: 5235
60 Correct 34 ms 1872 KB Output is correct
61 Correct 4 ms 1876 KB Output is correct
62 Correct 5 ms 1872 KB Output is correct
63 Correct 4 ms 1868 KB Output is correct
64 Correct 3 ms 1872 KB Output is correct
65 Correct 6 ms 1872 KB Output is correct
66 Correct 6 ms 1868 KB Output is correct
67 Correct 5 ms 1872 KB Output is correct
68 Correct 4 ms 1872 KB Output is correct
69 Correct 8 ms 1864 KB Output is correct
70 Correct 5 ms 1876 KB Output is correct
71 Partially correct 47 ms 1872 KB Partially correct - number of queries: 8270
72 Correct 10 ms 1744 KB Output is correct
73 Partially correct 61 ms 1872 KB Partially correct - number of queries: 8159
74 Partially correct 64 ms 1872 KB Partially correct - number of queries: 8219
75 Correct 6 ms 1872 KB Output is correct
76 Partially correct 59 ms 1920 KB Partially correct - number of queries: 7113
77 Partially correct 45 ms 1872 KB Partially correct - number of queries: 7051
78 Correct 10 ms 1872 KB Output is correct
79 Correct 30 ms 1872 KB Output is correct
80 Partially correct 70 ms 1872 KB Partially correct - number of queries: 8409
81 Partially correct 51 ms 1872 KB Partially correct - number of queries: 8420
82 Partially correct 55 ms 1872 KB Partially correct - number of queries: 8353
83 Correct 6 ms 1872 KB Output is correct
84 Partially correct 43 ms 1872 KB Partially correct - number of queries: 6970
85 Partially correct 45 ms 1872 KB Partially correct - number of queries: 8433
86 Correct 6 ms 1872 KB Output is correct
87 Correct 8 ms 1872 KB Output is correct
88 Correct 3 ms 1876 KB Output is correct
89 Correct 5 ms 1868 KB Output is correct
90 Correct 6 ms 1872 KB Output is correct
91 Correct 4 ms 1872 KB Output is correct
92 Correct 6 ms 1872 KB Output is correct
93 Correct 8 ms 1872 KB Output is correct
94 Correct 8 ms 1872 KB Output is correct
95 Correct 7 ms 1872 KB Output is correct
96 Correct 8 ms 1872 KB Output is correct
97 Correct 5 ms 1872 KB Output is correct