oj.uz

답안 #104193

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
104193 2019-04-04T09:40:41 Z RockyB 커다란 상품 (IOI17_prize) C++17
95.33 / 100
 63 ms 1032 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 = 5000;
	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
 
const int K = 287;
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;
 
/// (2e5 - 1) / k + 472 * k
int solve(int p, int n) {
	if (p >= n) return -1;
 
	{
		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 (now[0] + now[1] == 0) return 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 (now[0] + now[1] == 0) return mid;
		if (cur == now) nxt = mid, l = mid + 1;
		else r = mid - 1;
	}
	++nxt;
	return solve(nxt, n);
}
int find_best(int n) {
	int id = -1;
    per(i, min(n - 1, 474), 0) {
		vector <int> cur = ask(i);
		if (!max(cur[0], cur[1])) return i;
		if (mx < cur[0] + cur[1]) mx = cur[0] + cur[1], id = i;
	}
	return solve(id, 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:99:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   int mid = l + r >> 1;
             ~~^~~
prize.cpp:110:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   int mid = l + r >> 1;
             ~~^~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 256 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 7 ms 384 KB Output is correct
6 Correct 8 ms 308 KB Output is correct
7 Correct 7 ms 384 KB Output is correct
8 Correct 7 ms 256 KB Output is correct
9 Correct 10 ms 384 KB Output is correct
10 Correct 6 ms 384 KB Output is correct

Subtask #2
75.33 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 4 ms 404 KB Output is correct
5 Correct 8 ms 376 KB Output is correct
6 Correct 4 ms 504 KB Output is correct
7 Correct 8 ms 256 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 6 ms 256 KB Output is correct
11 Correct 7 ms 256 KB Output is correct
12 Correct 4 ms 392 KB Output is correct
13 Correct 6 ms 516 KB Output is correct
14 Correct 4 ms 404 KB Output is correct
15 Correct 13 ms 416 KB Output is correct
16 Correct 28 ms 908 KB Output is correct
17 Correct 2 ms 392 KB Output is correct
18 Partially correct 46 ms 808 KB Partially correct - number of queries: 5290
19 Correct 2 ms 256 KB Output is correct
20 Correct 14 ms 376 KB Output is correct
21 Correct 27 ms 504 KB Output is correct
22 Correct 11 ms 256 KB Output is correct
23 Correct 7 ms 392 KB Output is correct
24 Correct 6 ms 304 KB Output is correct
25 Correct 24 ms 552 KB Output is correct
26 Correct 15 ms 672 KB Output is correct
27 Correct 4 ms 388 KB Output is correct
28 Correct 28 ms 936 KB Output is correct
29 Correct 20 ms 692 KB Output is correct
30 Partially correct 31 ms 912 KB Partially correct - number of queries: 5250
31 Correct 3 ms 388 KB Output is correct
32 Correct 12 ms 324 KB Output is correct
33 Correct 3 ms 256 KB Output is correct
34 Correct 20 ms 424 KB Output is correct
35 Correct 4 ms 440 KB Output is correct
36 Correct 16 ms 504 KB Output is correct
37 Correct 7 ms 384 KB Output is correct
38 Correct 6 ms 256 KB Output is correct
39 Correct 28 ms 508 KB Output is correct
40 Correct 29 ms 824 KB Output is correct
41 Correct 19 ms 764 KB Output is correct
42 Correct 29 ms 576 KB Output is correct
43 Correct 29 ms 528 KB Output is correct
44 Correct 12 ms 648 KB Output is correct
45 Correct 12 ms 580 KB Output is correct
46 Correct 3 ms 384 KB Output is correct
47 Correct 27 ms 512 KB Output is correct
48 Correct 23 ms 908 KB Output is correct
49 Correct 9 ms 308 KB Output is correct
50 Partially correct 47 ms 952 KB Partially correct - number of queries: 5308
51 Correct 24 ms 504 KB Output is correct
52 Correct 8 ms 256 KB Output is correct
53 Correct 7 ms 384 KB Output is correct
54 Correct 14 ms 760 KB Output is correct
55 Correct 3 ms 256 KB Output is correct
56 Partially correct 47 ms 896 KB Partially correct - number of queries: 5306
57 Correct 38 ms 632 KB Output is correct
58 Correct 38 ms 660 KB Output is correct
59 Correct 16 ms 648 KB Output is correct
60 Correct 29 ms 560 KB Output is correct
61 Correct 4 ms 516 KB Output is correct
62 Correct 4 ms 372 KB Output is correct
63 Correct 7 ms 256 KB Output is correct
64 Correct 4 ms 524 KB Output is correct
65 Correct 7 ms 384 KB Output is correct
66 Correct 11 ms 256 KB Output is correct
67 Correct 4 ms 512 KB Output is correct
68 Correct 2 ms 384 KB Output is correct
69 Correct 9 ms 256 KB Output is correct
70 Correct 4 ms 520 KB Output is correct
71 Partially correct 46 ms 892 KB Partially correct - number of queries: 5410
72 Correct 9 ms 256 KB Output is correct
73 Partially correct 61 ms 1032 KB Partially correct - number of queries: 5347
74 Partially correct 63 ms 888 KB Partially correct - number of queries: 5374
75 Correct 9 ms 284 KB Output is correct
76 Correct 40 ms 880 KB Output is correct
77 Partially correct 61 ms 864 KB Partially correct - number of queries: 5457
78 Correct 11 ms 384 KB Output is correct
79 Correct 17 ms 640 KB Output is correct
80 Partially correct 58 ms 884 KB Partially correct - number of queries: 5464
81 Partially correct 55 ms 888 KB Partially correct - number of queries: 5450
82 Partially correct 46 ms 952 KB Partially correct - number of queries: 5417
83 Correct 8 ms 512 KB Output is correct
84 Correct 43 ms 776 KB Output is correct
85 Partially correct 41 ms 888 KB Partially correct - number of queries: 5467
86 Partially correct 26 ms 912 KB Partially correct - number of queries: 5276
87 Correct 12 ms 256 KB Output is correct
88 Partially correct 30 ms 852 KB Partially correct - number of queries: 5133
89 Partially correct 34 ms 1028 KB Partially correct - number of queries: 5262
90 Correct 5 ms 392 KB Output is correct
91 Correct 34 ms 632 KB Output is correct
92 Partially correct 48 ms 808 KB Partially correct - number of queries: 5141
93 Correct 15 ms 376 KB Output is correct
94 Correct 16 ms 376 KB Output is correct
95 Correct 13 ms 376 KB Output is correct
96 Correct 12 ms 376 KB Output is correct
97 Correct 11 ms 384 KB Output is correct