oj.uz

답안 #102763

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
102763 2019-03-27T12:22:10 Z bert30702 커다란 상품 (IOI17_prize) C++17
100 / 100
 49 ms 708 KB 
#include <bits/stdc++.h>
#include "prize.h"
#define pii pair<int, int>
#define F first
#define S second
using namespace std;
//vector<int> ask(int p) {
//	// cout << p << endl;
//	int a = 0, b = 0; 
//	int v[] = {3, 2, 3, 1, 3, 3, 2, 3};
//	for(int i =     0; i < p; i ++) a += (v[i] < v[p]);
//	for(int i = p + 1; i < 8; i ++) b += (v[i] < v[p]);
//	return {a, b};
//}
unordered_map<int, pii> mp;
pii query(int p) {
	if(mp.find(p) != mp.end()) return mp[p];
	vector<int> v = ask(p);
	return mp[p] = {v[0], v[1]};
}
vector<pii> ans;
void dfs(int l, int r, pii a, pii b, int mx) {
	// cout << l << ' ' << r << endl;
	if(l == r) {
		if(b.F + b.S != mx) ans.push_back({b.F + b.S, l});
		return;
	}
	if(a == b) return;
	int m = l + r >> 1;
	pii v = query(m);
	if(v.F + v.S != mx) {
		ans.push_back({v.F + v.S, m});
		if(m != l) dfs(l, m - 1, a, query(m - 1), mx);
		if(m != r) dfs(m + 1, r, query(m + 1), b, mx);
	}
	else {
		if(v == a) return dfs(m + 1, r, v, b, mx);
		if(v == b) return dfs(    l, m, a, v, mx);
		dfs(    l, m, a, v, mx);
		dfs(m + 1, r, v, b, mx);
	}
}
int find_best(int n) {
	srand(time(0));
	int mx = 0;
	for(int i = 0; i < 10; i ++) {
		pii tmp = query(rand() % n);
		mx = max(mx, tmp.F + tmp.S);
	}
	dfs(0, n - 1, query(0), query(n - 1), mx);
	pii mn = {mx, -1};
	// for(auto it: ans) cout << it.S << ' '; cout << endl;
	for(auto it: ans) mn = min(mn, it);
	return mn.S;
}
//main () {
//	cout << find_best(8);
//}

Compilation message

prize.cpp: In function 'void dfs(int, int, std::pair<int, int>, std::pair<int, int>, int)':
prize.cpp:29:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int m = l + r >> 1;
          ~~^~~

Subtask #1
20.0 / 20.0

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

Subtask #2
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 392 KB Output is correct
3 Correct 2 ms 396 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 2 ms 392 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 2 ms 304 KB Output is correct
10 Correct 3 ms 256 KB Output is correct
11 Correct 4 ms 400 KB Output is correct
12 Correct 6 ms 256 KB Output is correct
13 Correct 6 ms 256 KB Output is correct
14 Correct 10 ms 256 KB Output is correct
15 Correct 43 ms 412 KB Output is correct
16 Correct 36 ms 504 KB Output is correct
17 Correct 18 ms 580 KB Output is correct
18 Correct 45 ms 504 KB Output is correct
19 Correct 35 ms 504 KB Output is correct
20 Correct 13 ms 452 KB Output is correct
21 Correct 20 ms 708 KB Output is correct
22 Correct 34 ms 376 KB Output is correct
23 Correct 4 ms 384 KB Output is correct
24 Correct 5 ms 396 KB Output is correct
25 Correct 25 ms 608 KB Output is correct
26 Correct 19 ms 584 KB Output is correct
27 Correct 4 ms 384 KB Output is correct
28 Correct 27 ms 616 KB Output is correct
29 Correct 24 ms 440 KB Output is correct
30 Correct 36 ms 504 KB Output is correct
31 Correct 21 ms 592 KB Output is correct
32 Correct 7 ms 384 KB Output is correct
33 Correct 2 ms 328 KB Output is correct
34 Correct 23 ms 580 KB Output is correct
35 Correct 4 ms 256 KB Output is correct
36 Correct 34 ms 504 KB Output is correct
37 Correct 7 ms 256 KB Output is correct
38 Correct 3 ms 384 KB Output is correct
39 Correct 19 ms 592 KB Output is correct
40 Correct 38 ms 440 KB Output is correct
41 Correct 43 ms 496 KB Output is correct
42 Correct 19 ms 564 KB Output is correct
43 Correct 35 ms 500 KB Output is correct
44 Correct 42 ms 424 KB Output is correct
45 Correct 31 ms 492 KB Output is correct
46 Correct 49 ms 504 KB Output is correct
47 Correct 38 ms 516 KB Output is correct
48 Correct 33 ms 528 KB Output is correct
49 Correct 19 ms 508 KB Output is correct
50 Correct 45 ms 580 KB Output is correct
51 Correct 18 ms 580 KB Output is correct
52 Correct 31 ms 616 KB Output is correct
53 Correct 2 ms 256 KB Output is correct
54 Correct 40 ms 556 KB Output is correct
55 Correct 35 ms 500 KB Output is correct
56 Correct 21 ms 512 KB Output is correct
57 Correct 40 ms 524 KB Output is correct
58 Correct 39 ms 432 KB Output is correct
59 Correct 21 ms 580 KB Output is correct
60 Correct 18 ms 516 KB Output is correct
61 Correct 3 ms 256 KB Output is correct
62 Correct 3 ms 384 KB Output is correct
63 Correct 3 ms 256 KB Output is correct
64 Correct 3 ms 312 KB Output is correct
65 Correct 4 ms 384 KB Output is correct
66 Correct 3 ms 384 KB Output is correct
67 Correct 2 ms 396 KB Output is correct
68 Correct 2 ms 376 KB Output is correct
69 Correct 3 ms 256 KB Output is correct
70 Correct 2 ms 256 KB Output is correct
71 Correct 42 ms 508 KB Output is correct
72 Correct 5 ms 256 KB Output is correct
73 Correct 42 ms 504 KB Output is correct
74 Correct 24 ms 592 KB Output is correct
75 Correct 4 ms 256 KB Output is correct
76 Correct 39 ms 504 KB Output is correct
77 Correct 19 ms 512 KB Output is correct
78 Correct 6 ms 256 KB Output is correct
79 Correct 23 ms 304 KB Output is correct
80 Correct 47 ms 504 KB Output is correct
81 Correct 19 ms 512 KB Output is correct
82 Correct 38 ms 504 KB Output is correct
83 Correct 3 ms 256 KB Output is correct
84 Correct 18 ms 524 KB Output is correct
85 Correct 20 ms 512 KB Output is correct
86 Correct 14 ms 376 KB Output is correct
87 Correct 5 ms 392 KB Output is correct
88 Correct 6 ms 520 KB Output is correct
89 Correct 12 ms 256 KB Output is correct
90 Correct 3 ms 256 KB Output is correct
91 Correct 5 ms 392 KB Output is correct
92 Correct 3 ms 256 KB Output is correct
93 Correct 5 ms 256 KB Output is correct
94 Correct 6 ms 384 KB Output is correct
95 Correct 4 ms 332 KB Output is correct
96 Correct 4 ms 384 KB Output is correct
97 Correct 2 ms 384 KB Output is correct