oj.uz

Submission #104234

# Submission time Handle Problem Language Result Execution time Memory
104234 2019-04-04T10:47:44 Z RockyB The Big Prize (IOI17_prize) C++17
20 / 100
 73 ms 1408 KB 
/// In The Name Of God
 
#include <bits/stdc++.h>
#ifndef IOI2018
#include "prize.h"
#endif
 
#define f first
#define s second
 
#define pb push_back
#define pp pop_back
#define mp make_pair
 
#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()
 
#define rep(i, l, r) for (int i = (l); i < (r); i++)
#define per(i, l, r) for (int i = (l); i >= (r); i--)
 
#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);
 
#define nl '\n'
#define ioi exit(0);
 
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
 
const int N = (int)5e5 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;
 
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
 
using namespace std;
 
namespace com {
	static const int max_q = 10000;
	static int n;
	static int query_count = 0;
	static vector<int> g;
	static vector<vector<int> > rank_count;
 
}
 
namespace grader {
	using namespace com;
	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;
	}
}
#ifdef IOI2018
using namespace grader;
#endif
 
int K = 420;
map <int, vector <int > > dp;
  
vector <int> get(int p) {
	if (dp.count(p)) return dp[p];
	return dp[p] = ask(p);
}
int mx;
int tin;
int solve(int p, int n) {
	if (p >= n) assert(0);
	{
		while (1) {
			vector <int> now = get(p);
			if (now[0] + now[1] == 0) return p;
			if (now[0] + now[1] == mx) break;
			p++;
		}
	}
	int l = p / K + 1, r = (n - 1) / K, res = p / K;
	vector <int> cur = get(p);
	while (l <= r) {
		int mid = l + r >> 1;
		vector <int> now = get(K * mid);
		if (cur == now) res = mid, l = mid + 1;
		else r = mid - 1;
	}
	//cerr << p << ' ' << res * K << nl;
	l = max(p, res * K);
	r = min(n - 1, (res + 1) * K - 1);
	int nxt = -1;
	while (l <= r) {
		int mid = l + r >> 1;
		vector <int> now = get(mid);
		if (cur == now) nxt = mid, l = mid + 1;
		else r = mid - 1;
	}
	++nxt;
	return solve(nxt, n);
}
int find_best(int n) {
    K = sqrt(n) + 2;
	int id = -1;
    rep(i, 0, (n - 1) / K + 1) {
      vector <int> cur = ask(i);
      mx = max(mx, cur[0] + cur[1]);
    }
	return solve(0, n);
} 
 
 
namespace read {
	using namespace com;
	void read() {
		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;
		ioi
		cout << res << endl << "Query count: " << query_count << endl;
		ioi
	}
}
 
#ifdef IOI2018
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
		freopen ("slow.out", "w", stdout);
	#endif
	read :: read();
}
#endif

Compilation message

prize.cpp: In function 'int solve(int, int)':
prize.cpp:96:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   int mid = l + r >> 1;
             ~~^~~
prize.cpp:106:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   int mid = l + r >> 1;
             ~~^~~
prize.cpp: In function 'int find_best(int)':
prize.cpp:116:6: warning: unused variable 'id' [-Wunused-variable]
  int id = -1;
      ^~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 256 KB Output is correct
2 Correct 4 ms 516 KB Output is correct
3 Correct 8 ms 300 KB Output is correct
4 Correct 6 ms 256 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 8 ms 256 KB Output is correct
8 Correct 5 ms 392 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 6 ms 384 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 392 KB Output is correct
2 Correct 4 ms 400 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 7 ms 256 KB Output is correct
6 Correct 8 ms 384 KB Output is correct
7 Correct 7 ms 384 KB Output is correct
8 Correct 7 ms 508 KB Output is correct
9 Correct 6 ms 256 KB Output is correct
10 Correct 5 ms 256 KB Output is correct
11 Correct 6 ms 312 KB Output is correct
12 Correct 4 ms 256 KB Output is correct
13 Correct 12 ms 256 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 14 ms 384 KB Output is correct
16 Correct 39 ms 808 KB Output is correct
17 Correct 6 ms 304 KB Output is correct
18 Partially correct 41 ms 888 KB Partially correct - number of queries: 5347
19 Correct 4 ms 512 KB Output is correct
20 Correct 16 ms 504 KB Output is correct
21 Correct 23 ms 504 KB Output is correct
22 Correct 10 ms 340 KB Output is correct
23 Correct 4 ms 376 KB Output is correct
24 Correct 4 ms 316 KB Output is correct
25 Correct 26 ms 632 KB Output is correct
26 Correct 20 ms 696 KB Output is correct
27 Correct 5 ms 304 KB Output is correct
28 Correct 36 ms 832 KB Output is correct
29 Correct 34 ms 632 KB Output is correct
30 Partially correct 43 ms 860 KB Partially correct - number of queries: 5291
31 Correct 3 ms 384 KB Output is correct
32 Correct 10 ms 256 KB Output is correct
33 Correct 2 ms 256 KB Output is correct
34 Correct 21 ms 504 KB Output is correct
35 Correct 4 ms 400 KB Output is correct
36 Correct 19 ms 552 KB Output is correct
37 Correct 7 ms 384 KB Output is correct
38 Correct 5 ms 400 KB Output is correct
39 Correct 27 ms 552 KB Output is correct
40 Correct 47 ms 828 KB Output is correct
41 Correct 17 ms 652 KB Output is correct
42 Correct 33 ms 552 KB Output is correct
43 Correct 26 ms 632 KB Output is correct
44 Correct 12 ms 632 KB Output is correct
45 Correct 22 ms 504 KB Output is correct
46 Correct 5 ms 256 KB Output is correct
47 Correct 30 ms 592 KB Output is correct
48 Correct 28 ms 688 KB Output is correct
49 Correct 7 ms 384 KB Output is correct
50 Partially correct 41 ms 936 KB Partially correct - number of queries: 5349
51 Correct 26 ms 632 KB Output is correct
52 Correct 8 ms 256 KB Output is correct
53 Correct 9 ms 256 KB Output is correct
54 Correct 26 ms 572 KB Output is correct
55 Correct 8 ms 256 KB Output is correct
56 Partially correct 48 ms 808 KB Partially correct - number of queries: 5341
57 Correct 41 ms 680 KB Output is correct
58 Correct 40 ms 660 KB Output is correct
59 Correct 29 ms 552 KB Output is correct
60 Correct 34 ms 584 KB Output is correct
61 Correct 9 ms 256 KB Output is correct
62 Correct 6 ms 400 KB Output is correct
63 Correct 6 ms 256 KB Output is correct
64 Correct 5 ms 432 KB Output is correct
65 Correct 7 ms 384 KB Output is correct
66 Correct 9 ms 256 KB Output is correct
67 Correct 6 ms 256 KB Output is correct
68 Correct 6 ms 256 KB Output is correct
69 Correct 5 ms 408 KB Output is correct
70 Correct 3 ms 512 KB Output is correct
71 Partially correct 52 ms 820 KB Partially correct - number of queries: 5112
72 Correct 11 ms 384 KB Output is correct
73 Partially correct 39 ms 892 KB Partially correct - number of queries: 5056
74 Partially correct 37 ms 828 KB Partially correct - number of queries: 5080
75 Correct 7 ms 256 KB Output is correct
76 Correct 31 ms 824 KB Output is correct
77 Partially correct 36 ms 920 KB Partially correct - number of queries: 5325
78 Correct 10 ms 384 KB Output is correct
79 Correct 15 ms 568 KB Output is correct
80 Partially correct 33 ms 1208 KB Partially correct - number of queries: 5353
81 Partially correct 47 ms 952 KB Partially correct - number of queries: 5361
82 Partially correct 47 ms 888 KB Partially correct - number of queries: 5331
83 Correct 6 ms 256 KB Output is correct
84 Correct 39 ms 808 KB Output is correct
85 Partially correct 44 ms 888 KB Partially correct - number of queries: 5344
86 Incorrect 73 ms 1408 KB Incorrect
87 Halted 0 ms 0 KB -