oj.uz

Submission #765691

# Submission time Handle Problem Language Result Execution time Memory
765691 2023-06-25T03:12:56 Z marvinthang The Big Prize (IOI17_prize) C++17
98.33 / 100
 49 ms 5180 KB 
/*************************************
*    author: marvinthang             *
*    created: 25.06.2023 08:50:11    *
*************************************/

#include "prize.h"
#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
template <class A, class B> bool minimize(A &a, B b)  { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b)  { if (a < b) { a = b; return true; } return false; }

// end of template

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); 
template <class T> T rand(T l, T h) { return uniform_int_distribution <T> (l, h) (rng); } 
template <class T> T rand(T h) { return uniform_int_distribution <T> (0, h - 1) (rng); } 

int ma, res;
vector <vector <int>> f;
vector <int> ASK(int i) {
	if (f[i].empty()) f[i] = ask(i);
	return f[i];
}
void solve(int l, int r, int cl, int cr) {
	if (~res || l > r || cl + cr == ma) return;
	int m = l + r >> 1;
	vector <int> a = ASK(m);
	if (!a[0] && !a[1]) {
		res = m;
		return;
	}
	if (a[0] + a[1] == ma) {
		int x = ma - cl - a[1];
		int y = ma - cr - a[0];
		if (x >= y) {
			solve(l, m - 1, cl, a[1]);
			if (~res) return;
			solve(m + 1, r, a[0], cr);
		} else {
			solve(m + 1, r, a[0], cr);
			if (~res) return;
			solve(l, m - 1, cl, a[1]);
		}
		return;
	}
	int i = m;
	while (--i >= l) {
		a = ASK(i);
		if (!a[0] && !a[1]) {
			res = i;
			return;
		}
		if (a[0] + a[1] == ma) break;
	}
	if (i < l) {
		solve(m + 1, r, cl + m - l + 1, cr);
	} else {
		int x = ma - cl - a[1];
		int y = ma - a[0] - m + i - cr;
		if (x >= y) {
			solve(l, i - 1, cl, a[1]);
			if (~res) return;
			solve(m + 1, r, a[0] + m - i, cr);
		} else {
			solve(m + 1, r, a[0] + m - i, cr);
			if (~res) return;
			solve(l, i - 1, cl, a[1]);
		}
	}
}

int find_best(int n) {
	res = -1;
	f.assign(n, vector<int>());
	ma = 0;
	REP(t, 450) {
		int i = rand(n);
		vector <int> a = ASK(i);
		if (!a[0] && !a[1]) return i;
		maximize(ma, a[0] + a[1]);
	}
	solve(0, n - 1, 0, 0);
	return res;
}

#ifdef LOCAL
#include "prize.h"

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

static const int max_q = 5000;
static int n;
static int query_count = 0;
static vector<int> g;
static vector<vector<int> > rank_count;

vector<int> ask(int i) {
	query_count++;
	if(query_count > max_q) {
		cerr << "Query limit exceeded" << endl;
		exit(0);
	}

	if(i < 0 || i >= n) {
		cerr << "Bad index: " << i << endl;
		exit(0);
	}

	vector<int> res(2);
	res[0] = rank_count[g[i] - 1][i + 1];
	res[1] = rank_count[g[i] - 1][n] - res[0];
	return res;
}

int main() {
	file("prize");
	cin >> n;

	g.resize(n);
	for(int i = 0; i < n; i++) {
		cin >> g[i];
		if(g[i] < 1) {
			cerr << "Invalid rank " << g[i] << " at index " << i << endl;
			exit(0);
		}
	}

	int max_rank = *max_element(g.begin(), g.end());

	rank_count.resize(max_rank + 1, vector<int>(n + 1, 0));
	for(int r = 0; r <= max_rank; r++) {
		for(int i = 1; i <= n; i++) {
			rank_count[r][i] = rank_count[r][i - 1];
			if(g[i - 1] == r)
			  rank_count[r][i]++;
		}
	}

	for(int i = 0; i <= n; i++)
		for(int r = 1; r <= max_rank; r++)
			rank_count[r][i] += rank_count[r - 1][i];

	int res = find_best(n);
	if (g[res] != 1) return !(cout << "WA!\n");
	cout << res << endl << "Query count: " << query_count << endl;

	return 0;
}
#endif

Compilation message

prize.cpp: In function 'void solve(int, int, int, int)':
prize.cpp:60:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   60 |  int m = l + r >> 1;
      |          ~~^~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4944 KB Output is correct
2 Correct 5 ms 5016 KB Output is correct
3 Correct 6 ms 4936 KB Output is correct
4 Correct 6 ms 4944 KB Output is correct
5 Correct 7 ms 5072 KB Output is correct
6 Correct 7 ms 4900 KB Output is correct
7 Correct 4 ms 5028 KB Output is correct
8 Correct 4 ms 5064 KB Output is correct
9 Correct 4 ms 5064 KB Output is correct
10 Correct 7 ms 4944 KB Output is correct

Subtask #2
78.33 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5024 KB Output is correct
2 Correct 6 ms 4944 KB Output is correct
3 Correct 6 ms 4904 KB Output is correct
4 Correct 4 ms 5028 KB Output is correct
5 Correct 6 ms 5012 KB Output is correct
6 Correct 4 ms 5024 KB Output is correct
7 Correct 6 ms 4904 KB Output is correct
8 Correct 4 ms 4904 KB Output is correct
9 Correct 5 ms 5024 KB Output is correct
10 Correct 7 ms 4944 KB Output is correct
11 Correct 5 ms 5020 KB Output is correct
12 Correct 7 ms 5024 KB Output is correct
13 Correct 6 ms 5036 KB Output is correct
14 Correct 8 ms 812 KB Output is correct
15 Correct 12 ms 5012 KB Output is correct
16 Correct 31 ms 5040 KB Output is correct
17 Correct 10 ms 4944 KB Output is correct
18 Correct 27 ms 5132 KB Output is correct
19 Correct 16 ms 5012 KB Output is correct
20 Correct 13 ms 2680 KB Output is correct
21 Correct 7 ms 4944 KB Output is correct
22 Correct 12 ms 4944 KB Output is correct
23 Correct 7 ms 4900 KB Output is correct
24 Correct 6 ms 5008 KB Output is correct
25 Correct 15 ms 5008 KB Output is correct
26 Correct 15 ms 5120 KB Output is correct
27 Correct 4 ms 5024 KB Output is correct
28 Correct 30 ms 5068 KB Output is correct
29 Correct 33 ms 5064 KB Output is correct
30 Correct 33 ms 5064 KB Output is correct
31 Correct 13 ms 4944 KB Output is correct
32 Correct 11 ms 5016 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Correct 8 ms 5032 KB Output is correct
35 Correct 4 ms 4904 KB Output is correct
36 Correct 9 ms 5100 KB Output is correct
37 Correct 8 ms 5024 KB Output is correct
38 Correct 7 ms 4904 KB Output is correct
39 Correct 21 ms 5024 KB Output is correct
40 Correct 21 ms 5124 KB Output is correct
41 Correct 21 ms 5020 KB Output is correct
42 Correct 12 ms 5080 KB Output is correct
43 Correct 5 ms 4944 KB Output is correct
44 Correct 12 ms 4944 KB Output is correct
45 Correct 10 ms 4944 KB Output is correct
46 Correct 7 ms 5144 KB Output is correct
47 Correct 16 ms 5032 KB Output is correct
48 Correct 30 ms 5052 KB Output is correct
49 Correct 15 ms 5036 KB Output is correct
50 Correct 30 ms 5064 KB Output is correct
51 Correct 7 ms 5060 KB Output is correct
52 Correct 10 ms 5008 KB Output is correct
53 Correct 6 ms 5040 KB Output is correct
54 Correct 11 ms 5008 KB Output is correct
55 Correct 11 ms 4944 KB Output is correct
56 Correct 19 ms 5140 KB Output is correct
57 Correct 19 ms 5180 KB Output is correct
58 Correct 15 ms 5080 KB Output is correct
59 Correct 22 ms 5052 KB Output is correct
60 Correct 30 ms 5032 KB Output is correct
61 Correct 4 ms 5028 KB Output is correct
62 Correct 7 ms 5004 KB Output is correct
63 Correct 5 ms 5012 KB Output is correct
64 Correct 4 ms 5020 KB Output is correct
65 Correct 5 ms 4904 KB Output is correct
66 Correct 6 ms 5032 KB Output is correct
67 Correct 5 ms 5012 KB Output is correct
68 Correct 10 ms 4944 KB Output is correct
69 Correct 6 ms 5072 KB Output is correct
70 Correct 7 ms 5008 KB Output is correct
71 Partially correct 44 ms 5052 KB Partially correct - number of queries: 5167
72 Correct 9 ms 4944 KB Output is correct
73 Partially correct 49 ms 5128 KB Partially correct - number of queries: 5128
74 Partially correct 22 ms 5156 KB Partially correct - number of queries: 5092
75 Correct 7 ms 4944 KB Output is correct
76 Correct 37 ms 5076 KB Output is correct
77 Correct 26 ms 5044 KB Output is correct
78 Correct 9 ms 4944 KB Output is correct
79 Correct 15 ms 4944 KB Output is correct
80 Correct 31 ms 5120 KB Output is correct
81 Correct 26 ms 5064 KB Output is correct
82 Correct 32 ms 5124 KB Output is correct
83 Correct 7 ms 4944 KB Output is correct
84 Correct 37 ms 5032 KB Output is correct
85 Correct 45 ms 5040 KB Output is correct
86 Correct 28 ms 5084 KB Output is correct
87 Correct 7 ms 4944 KB Output is correct
88 Correct 25 ms 5044 KB Output is correct
89 Correct 19 ms 5064 KB Output is correct
90 Correct 6 ms 4944 KB Output is correct
91 Correct 20 ms 5036 KB Output is correct
92 Correct 24 ms 5056 KB Output is correct
93 Correct 35 ms 5024 KB Output is correct
94 Correct 37 ms 5064 KB Output is correct
95 Correct 36 ms 5060 KB Output is correct
96 Correct 21 ms 5068 KB Output is correct
97 Correct 15 ms 5060 KB Output is correct