oj.uz

답안 #936641

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
936641 2024-03-02T12:34:16 Z Ghetto 커다란 상품 (IOI17_prize) C++17
20 / 100
 39 ms 960 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;

int n;

int v_sum;
int find_v_sum() {
	unordered_map<int, int> sum_freq;
	for (int i = 0; i < min(n, 900); i++) {
		vector<int> res = ask(i);
		sum_freq[res[0] + res[1]]++;
	}

	for (pii sf : sum_freq)
		if (sf.second >= min(n / 2, 450)) return sf.first;
	assert(true == false); 
}

bool is_v(int res_sum) {
	return res_sum == v_sum;
}

vector<int> append(vector<int> v1, vector<int> v2) {
	v1.insert(v1.end(), v2.begin(), v2.end());
	return v1;
}

int one;
vector<int> find_non_vs(int lo, int hi, int l, int r) {
	// cout << "CALL " << lo << " " << hi << " " << l << " " << r << endl;
	if (lo > hi) return {}; 

	vector<int> ans, res;
	int l_mid = (lo + hi) / 2, r_mid = (lo + hi) / 2;
	while (r_mid <= hi) {
		res = ask(r_mid);
		if (is_v(res[0] + res[1])) break;
		
		ans.push_back(r_mid);
		r_mid++;
	}
	if (r_mid == hi + 1) return append(ans, find_non_vs(lo, l_mid - 1, l, r + r_mid - l_mid));

	int l_size = res[0] - l - (r_mid - l_mid);
	int r_size = res[1] - r;
	// cout << "DETAILS " << l_mid << " " << r_mid << " " << l_size << " " << r_size << endl;
	assert(min(l_size, r_size) >= 0);	

	if (l_size == 0 && r_size == 0) return ans;
	else if (l_size == 0) return append(ans, find_non_vs(r_mid + 1, hi, l + r_mid - l_mid, r));
	else if (r_size == 0) return append(ans, find_non_vs(lo, l_mid - 1, l, r + r_mid - l_mid));
	else {
		vector<int> l_ans = find_non_vs(lo, l_mid - 1, l, r + r_size + r_mid - l_mid);
		vector<int> r_ans = find_non_vs(r_mid + 1, hi, l + l_size + r_mid - l_mid, r);
		return append(ans, append(l_ans, r_ans));
	}
}

int find_best(int tmp_n) {
	n = tmp_n;

	v_sum = find_v_sum();

	vector<int> non_vs = find_non_vs(0, n - 1, 0, 0);
	for (int non_v : non_vs) {
		vector<int> res = ask(non_v);
		if (res[0] + res[1] == 0) return non_v;
	}
	assert(true == false);
}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 432 KB Output is correct
2 Correct 4 ms 688 KB Output is correct
3 Correct 4 ms 436 KB Output is correct
4 Correct 5 ms 428 KB Output is correct
5 Correct 3 ms 436 KB Output is correct
6 Correct 5 ms 432 KB Output is correct
7 Correct 4 ms 344 KB Output is correct
8 Correct 3 ms 436 KB Output is correct
9 Correct 4 ms 596 KB Output is correct
10 Correct 3 ms 436 KB Output is correct
11 Correct 7 ms 432 KB Output is correct
12 Correct 5 ms 436 KB Output is correct
13 Correct 6 ms 436 KB Output is correct
14 Correct 9 ms 436 KB Output is correct
15 Partially correct 22 ms 692 KB Partially correct - number of queries: 5207
16 Partially correct 25 ms 696 KB Partially correct - number of queries: 5781
17 Partially correct 25 ms 928 KB Partially correct - number of queries: 5356
18 Partially correct 20 ms 448 KB Partially correct - number of queries: 5842
19 Partially correct 28 ms 436 KB Partially correct - number of queries: 5102
20 Correct 16 ms 436 KB Output is correct
21 Partially correct 27 ms 688 KB Partially correct - number of queries: 5524
22 Correct 20 ms 436 KB Output is correct
23 Correct 4 ms 596 KB Output is correct
24 Correct 5 ms 436 KB Output is correct
25 Partially correct 27 ms 596 KB Partially correct - number of queries: 5210
26 Partially correct 21 ms 448 KB Partially correct - number of queries: 5207
27 Correct 4 ms 432 KB Output is correct
28 Partially correct 20 ms 676 KB Partially correct - number of queries: 5304
29 Correct 18 ms 692 KB Output is correct
30 Partially correct 22 ms 444 KB Partially correct - number of queries: 5799
31 Partially correct 28 ms 436 KB Partially correct - number of queries: 5337
32 Correct 6 ms 432 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Partially correct 20 ms 440 KB Partially correct - number of queries: 5532
35 Correct 5 ms 440 KB Output is correct
36 Partially correct 23 ms 444 KB Partially correct - number of queries: 5405
37 Correct 5 ms 436 KB Output is correct
38 Correct 4 ms 436 KB Output is correct
39 Partially correct 26 ms 440 KB Partially correct - number of queries: 5496
40 Partially correct 24 ms 436 KB Partially correct - number of queries: 5180
41 Partially correct 27 ms 688 KB Partially correct - number of queries: 5605
42 Partially correct 26 ms 432 KB Partially correct - number of queries: 5605
43 Partially correct 25 ms 440 KB Partially correct - number of queries: 5497
44 Partially correct 24 ms 696 KB Partially correct - number of queries: 5562
45 Partially correct 19 ms 960 KB Partially correct - number of queries: 5085
46 Partially correct 22 ms 440 KB Partially correct - number of queries: 5367
47 Partially correct 22 ms 696 KB Partially correct - number of queries: 5253
48 Partially correct 29 ms 696 KB Partially correct - number of queries: 5686
49 Partially correct 24 ms 436 KB Partially correct - number of queries: 5373
50 Partially correct 30 ms 668 KB Partially correct - number of queries: 5836
51 Partially correct 23 ms 680 KB Partially correct - number of queries: 5539
52 Partially correct 25 ms 692 KB Partially correct - number of queries: 5372
53 Correct 4 ms 432 KB Output is correct
54 Partially correct 29 ms 688 KB Partially correct - number of queries: 5547
55 Partially correct 26 ms 684 KB Partially correct - number of queries: 5366
56 Partially correct 24 ms 436 KB Partially correct - number of queries: 5847
57 Partially correct 22 ms 692 KB Partially correct - number of queries: 5671
58 Partially correct 25 ms 440 KB Partially correct - number of queries: 5681
59 Partially correct 25 ms 692 KB Partially correct - number of queries: 5609
60 Partially correct 26 ms 696 KB Partially correct - number of queries: 5575
61 Correct 6 ms 436 KB Output is correct
62 Correct 4 ms 436 KB Output is correct
63 Correct 5 ms 608 KB Output is correct
64 Correct 5 ms 432 KB Output is correct
65 Correct 4 ms 608 KB Output is correct
66 Correct 8 ms 544 KB Output is correct
67 Correct 8 ms 444 KB Output is correct
68 Correct 7 ms 688 KB Output is correct
69 Correct 10 ms 440 KB Output is correct
70 Correct 6 ms 440 KB Output is correct
71 Partially correct 34 ms 676 KB Partially correct - number of queries: 6130
72 Correct 6 ms 436 KB Output is correct
73 Partially correct 26 ms 684 KB Partially correct - number of queries: 6060
74 Partially correct 39 ms 436 KB Partially correct - number of queries: 6090
75 Correct 4 ms 436 KB Output is correct
76 Partially correct 29 ms 688 KB Partially correct - number of queries: 5410
77 Partially correct 32 ms 848 KB Partially correct - number of queries: 5846
78 Correct 5 ms 432 KB Output is correct
79 Correct 17 ms 440 KB Output is correct
80 Partially correct 25 ms 692 KB Partially correct - number of queries: 5851
81 Partially correct 34 ms 676 KB Partially correct - number of queries: 5869
82 Partially correct 31 ms 692 KB Partially correct - number of queries: 5757
83 Correct 5 ms 436 KB Output is correct
84 Partially correct 23 ms 692 KB Partially correct - number of queries: 5006
85 Partially correct 26 ms 692 KB Partially correct - number of queries: 5862
86 Runtime error 4 ms 432 KB Execution killed with signal 6
87 Halted 0 ms 0 KB -