oj.uz

답안 #1080240

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1080240 2024-08-29T08:15:27 Z Elias 커다란 상품 (IOI17_prize) C++17
20 / 100
 48 ms 596 KB 
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>

using namespace std;

#define ll long long

#ifdef _DEBUG

int find_best(int n);
std::vector<int> ask(int i);
#else
#include "prize.h"
#endif

vector<int> a;
vector<int> b;

int N;

int segSet(int l, int r, int i, int k, int x)
{
	if (l > k || r <= k)
		return b[i];
	if (l + 1 == r)
		return a[l] = b[i] = x;
	int m = (l + r) / 2;
	return b[i] = segSet(l, m, i * 2 + 1, k, x) + segSet(m, r, i * 2 + 2, k, x);
}

int segGet(int l, int r, int i, int ql, int qr)
{
	if (ql <= l && qr >= r)
		return b[i];
	if (ql >= r || qr <= l)
		return 0;
	int m = (l + r) / 2;
	return segGet(l, m, i * 2 + 1, ql, qr) + segGet(m, r, i * 2 + 2, ql, qr);
}

int getRecursive(int l, int r, int cnt_here, int cnt_l, int cnt_r)
{
	if (l >= r)
		return -1;

	if (cnt_here <= 0)
		return -1;

	int m = (l + r) / 2;
	int i = m;

	vector<int> answer;
	bool is_special = false;
	int diff_l = 0;
	int diff_r = 0;

	do
	{
		if (i == r)
			break;

		is_special = false;
		answer = ask(i);

		if (answer[0] + answer[1] == 0)
			return i;

		answer[0] -= cnt_l;
		answer[1] -= cnt_r;

		if (answer[0] + answer[1] != cnt_here)
		{
			is_special = true;
			i++;
		}
		else
		{
			answer[0] -= i - m;
			diff_l += i - m;
			diff_r += i - m;
		}
	} while (is_special);

	int left = -1;
	if (i == r)
		left = getRecursive(l, m, cnt_here - (i - m), cnt_l, cnt_r + (i - m));
	else
		left = getRecursive(l, m, answer[0], cnt_l, cnt_r + answer[1] + diff_r);

	if (left != -1)
		return left;

	return getRecursive(i + 1, r, answer[1], cnt_l + answer[0] + diff_l, cnt_r);
}

int find_best(int n)
{
	vector<int> cnt_here;

	for (int k = 0; k < 10; k++)
	{
		int i = rand() % n;

		vector<int> answer = ask(i);

		cnt_here.push_back(answer[0] + answer[1]);
	}

	sort(cnt_here.begin(), cnt_here.end());

	return getRecursive(0, n, cnt_here.back(), 0, 0);
}

#ifdef _DEBUG

#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()
{
	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

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 3 ms 428 KB Output is correct
16 Correct 10 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 22 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 4 ms 344 KB Output is correct
21 Correct 10 ms 424 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 9 ms 344 KB Output is correct
26 Correct 14 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 25 ms 344 KB Output is correct
29 Correct 14 ms 344 KB Output is correct
30 Correct 20 ms 344 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 2 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 7 ms 428 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 6 ms 424 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 9 ms 344 KB Output is correct
40 Correct 18 ms 356 KB Output is correct
41 Correct 14 ms 352 KB Output is correct
42 Correct 12 ms 344 KB Output is correct
43 Correct 12 ms 344 KB Output is correct
44 Correct 8 ms 344 KB Output is correct
45 Correct 6 ms 344 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 8 ms 344 KB Output is correct
48 Correct 13 ms 344 KB Output is correct
49 Correct 2 ms 344 KB Output is correct
50 Correct 17 ms 344 KB Output is correct
51 Correct 10 ms 344 KB Output is correct
52 Correct 1 ms 344 KB Output is correct
53 Correct 1 ms 344 KB Output is correct
54 Correct 8 ms 344 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 19 ms 344 KB Output is correct
57 Correct 11 ms 344 KB Output is correct
58 Correct 14 ms 344 KB Output is correct
59 Correct 11 ms 344 KB Output is correct
60 Correct 13 ms 344 KB Output is correct
61 Correct 1 ms 344 KB Output is correct
62 Correct 1 ms 344 KB Output is correct
63 Correct 1 ms 344 KB Output is correct
64 Correct 1 ms 344 KB Output is correct
65 Correct 1 ms 344 KB Output is correct
66 Correct 2 ms 344 KB Output is correct
67 Correct 2 ms 344 KB Output is correct
68 Correct 1 ms 344 KB Output is correct
69 Correct 2 ms 344 KB Output is correct
70 Correct 1 ms 344 KB Output is correct
71 Correct 18 ms 344 KB Output is correct
72 Correct 3 ms 344 KB Output is correct
73 Correct 27 ms 344 KB Output is correct
74 Correct 22 ms 344 KB Output is correct
75 Correct 1 ms 344 KB Output is correct
76 Correct 24 ms 344 KB Output is correct
77 Correct 20 ms 344 KB Output is correct
78 Correct 3 ms 344 KB Output is correct
79 Correct 7 ms 344 KB Output is correct
80 Correct 17 ms 344 KB Output is correct
81 Correct 31 ms 344 KB Output is correct
82 Correct 33 ms 344 KB Output is correct
83 Correct 1 ms 344 KB Output is correct
84 Correct 24 ms 344 KB Output is correct
85 Correct 17 ms 344 KB Output is correct
86 Incorrect 48 ms 344 KB Incorrect
87 Halted 0 ms 0 KB -