oj.uz

Submission #765665

# Submission time Handle Problem Language Result Execution time Memory
765665 2023-06-25T02:10:55 Z marvinthang The Big Prize (IOI17_prize) C++17
20 / 100
 1000 ms 5344 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 find_best(int n) {
	int cnt = 0;
	int ma = 0;
	vector <vector <int>> res(n);
	auto ASK = [&] (int i) {
		if (res[i].empty()) res[i] = ask(i);
		return res[i];
	};
	REP(t, 10) {
		int i = rand(n);
		vector <int> a = ASK(i);
		if (!a[0] && !a[1]) return i;
		maximize(ma, a[0] + a[1]);
	}
	priority_queue <int, vector <int>, greater <int>> pq;
	REP(i, n) if (!res[i].empty() && res[i][0] + res[i][1] < ma) pq.push(i);
	pq.push(n);
	for (int i = 0; i < n; ) {
		while (pq.top() < i) pq.pop();
		int l = i, r = pq.top() - 1;
		while (l <= r) {
			int m = l + r >> 1;
			vector <int> a = ASK(m);
			if (a[0] + a[1] < ma) {
				r = m - 1;
				pq.push(m);
			} else {
				if (a[0] == cnt) l = m + 1;
				else r = m - 1;
			}
		}
		while (++r < n) {
			vector <int> a = ASK(r);
			if (a[0] + a[1] == ma) break;
			++cnt;
			if (!a[0] && !a[1]) return r;
		}
		i = r;
	}
	return -1;
}

#ifdef LOCAL
#include "prize.h"

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

using namespace std;

static const int max_q = 10000;
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);
	cout << res << endl << "Query count: " << query_count << endl;

	return 0;
}
#endif

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:73:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   73 |    int m = l + r >> 1;
      |            ~~^~~

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4944 KB Output is correct
2 Correct 3 ms 4904 KB Output is correct
3 Correct 3 ms 4904 KB Output is correct
4 Correct 3 ms 4904 KB Output is correct
5 Correct 3 ms 4944 KB Output is correct
6 Correct 2 ms 4944 KB Output is correct
7 Correct 3 ms 4904 KB Output is correct
8 Correct 3 ms 4904 KB Output is correct
9 Correct 4 ms 4904 KB Output is correct
10 Correct 3 ms 4944 KB Output is correct
11 Correct 4 ms 5016 KB Output is correct
12 Correct 3 ms 4896 KB Output is correct
13 Correct 5 ms 5068 KB Output is correct
14 Correct 3 ms 720 KB Output is correct
15 Correct 14 ms 4944 KB Output is correct
16 Partially correct 26 ms 5196 KB Partially correct - number of queries: 6732
17 Correct 3 ms 4908 KB Output is correct
18 Partially correct 53 ms 5124 KB Partially correct - number of queries: 7357
19 Correct 3 ms 4904 KB Output is correct
20 Correct 12 ms 2640 KB Output is correct
21 Correct 28 ms 4992 KB Output is correct
22 Correct 7 ms 4900 KB Output is correct
23 Correct 3 ms 4944 KB Output is correct
24 Correct 3 ms 4944 KB Output is correct
25 Correct 35 ms 5040 KB Output is correct
26 Correct 21 ms 5088 KB Output is correct
27 Correct 3 ms 4944 KB Output is correct
28 Partially correct 29 ms 5196 KB Partially correct - number of queries: 6589
29 Correct 20 ms 5156 KB Output is correct
30 Partially correct 65 ms 5192 KB Partially correct - number of queries: 7822
31 Correct 3 ms 4900 KB Output is correct
32 Correct 5 ms 5016 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Correct 15 ms 5188 KB Output is correct
35 Correct 3 ms 5008 KB Output is correct
36 Correct 18 ms 5024 KB Output is correct
37 Correct 3 ms 5016 KB Output is correct
38 Correct 3 ms 4900 KB Output is correct
39 Correct 34 ms 5036 KB Output is correct
40 Partially correct 40 ms 5180 KB Partially correct - number of queries: 6695
41 Correct 26 ms 5096 KB Output is correct
42 Correct 37 ms 5060 KB Output is correct
43 Correct 17 ms 5124 KB Output is correct
44 Correct 13 ms 5084 KB Output is correct
45 Correct 19 ms 5008 KB Output is correct
46 Correct 3 ms 4896 KB Output is correct
47 Correct 25 ms 5088 KB Output is correct
48 Partially correct 51 ms 5080 KB Partially correct - number of queries: 5852
49 Correct 7 ms 4900 KB Output is correct
50 Partially correct 79 ms 5220 KB Partially correct - number of queries: 7898
51 Correct 13 ms 5096 KB Output is correct
52 Correct 3 ms 4944 KB Output is correct
53 Correct 3 ms 5048 KB Output is correct
54 Correct 20 ms 5060 KB Output is correct
55 Correct 3 ms 4896 KB Output is correct
56 Partially correct 43 ms 5164 KB Partially correct - number of queries: 7893
57 Partially correct 22 ms 5168 KB Partially correct - number of queries: 5713
58 Correct 35 ms 5024 KB Output is correct
59 Correct 19 ms 5136 KB Output is correct
60 Correct 39 ms 5028 KB Output is correct
61 Correct 4 ms 4880 KB Output is correct
62 Correct 3 ms 4900 KB Output is correct
63 Correct 4 ms 4996 KB Output is correct
64 Correct 3 ms 4892 KB Output is correct
65 Correct 3 ms 5016 KB Output is correct
66 Correct 5 ms 5004 KB Output is correct
67 Correct 3 ms 4944 KB Output is correct
68 Correct 5 ms 4900 KB Output is correct
69 Correct 6 ms 4936 KB Output is correct
70 Correct 3 ms 4896 KB Output is correct
71 Partially correct 70 ms 5184 KB Partially correct - number of queries: 7859
72 Correct 7 ms 4944 KB Output is correct
73 Partially correct 44 ms 5228 KB Partially correct - number of queries: 7695
74 Partially correct 49 ms 5144 KB Partially correct - number of queries: 7749
75 Correct 3 ms 4944 KB Output is correct
76 Partially correct 34 ms 5316 KB Partially correct - number of queries: 6631
77 Partially correct 67 ms 5188 KB Partially correct - number of queries: 7522
78 Correct 6 ms 4944 KB Output is correct
79 Correct 30 ms 5044 KB Output is correct
80 Partially correct 44 ms 5324 KB Partially correct - number of queries: 7422
81 Partially correct 49 ms 5164 KB Partially correct - number of queries: 7513
82 Partially correct 49 ms 5192 KB Partially correct - number of queries: 7308
83 Correct 3 ms 5016 KB Output is correct
84 Partially correct 34 ms 5344 KB Partially correct - number of queries: 6247
85 Partially correct 71 ms 5184 KB Partially correct - number of queries: 7460
86 Execution timed out 3053 ms 5020 KB Time limit exceeded
87 Halted 0 ms 0 KB -