oj.uz

답안 #103104

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
103104 2019-03-29T03:28:00 Z username 커다란 상품 (IOI17_prize) C++14
20 / 100
 47 ms 560 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-1, 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 3 ms 308 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 396 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 3 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 308 KB Output is correct
10 Correct 3 ms 256 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 412 KB Output is correct
2 Correct 2 ms 388 KB Output is correct
3 Correct 3 ms 256 KB Output is correct
4 Correct 3 ms 312 KB Output is correct
5 Correct 3 ms 256 KB Output is correct
6 Correct 2 ms 320 KB Output is correct
7 Correct 2 ms 320 KB Output is correct
8 Correct 2 ms 400 KB Output is correct
9 Correct 3 ms 320 KB Output is correct
10 Correct 2 ms 316 KB Output is correct
11 Correct 4 ms 332 KB Output is correct
12 Correct 5 ms 324 KB Output is correct
13 Correct 6 ms 324 KB Output is correct
14 Correct 8 ms 328 KB Output is correct
15 Correct 18 ms 504 KB Output is correct
16 Correct 35 ms 512 KB Output is correct
17 Correct 35 ms 496 KB Output is correct
18 Correct 20 ms 508 KB Output is correct
19 Correct 18 ms 496 KB Output is correct
20 Correct 19 ms 560 KB Output is correct
21 Correct 35 ms 508 KB Output is correct
22 Correct 30 ms 424 KB Output is correct
23 Correct 3 ms 436 KB Output is correct
24 Correct 4 ms 324 KB Output is correct
25 Correct 25 ms 496 KB Output is correct
26 Correct 18 ms 504 KB Output is correct
27 Correct 4 ms 256 KB Output is correct
28 Correct 24 ms 496 KB Output is correct
29 Correct 21 ms 528 KB Output is correct
30 Correct 34 ms 508 KB Output is correct
31 Correct 38 ms 496 KB Output is correct
32 Correct 4 ms 384 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 23 ms 516 KB Output is correct
35 Correct 4 ms 308 KB Output is correct
36 Correct 30 ms 504 KB Output is correct
37 Correct 8 ms 324 KB Output is correct
38 Correct 3 ms 316 KB Output is correct
39 Correct 21 ms 508 KB Output is correct
40 Correct 21 ms 444 KB Output is correct
41 Correct 24 ms 516 KB Output is correct
42 Correct 23 ms 520 KB Output is correct
43 Correct 26 ms 504 KB Output is correct
44 Correct 47 ms 520 KB Output is correct
45 Correct 39 ms 496 KB Output is correct
46 Correct 44 ms 408 KB Output is correct
47 Correct 39 ms 500 KB Output is correct
48 Correct 23 ms 512 KB Output is correct
49 Correct 43 ms 512 KB Output is correct
50 Correct 46 ms 436 KB Output is correct
51 Correct 26 ms 524 KB Output is correct
52 Correct 20 ms 520 KB Output is correct
53 Correct 2 ms 400 KB Output is correct
54 Correct 38 ms 512 KB Output is correct
55 Correct 25 ms 560 KB Output is correct
56 Correct 26 ms 512 KB Output is correct
57 Correct 25 ms 500 KB Output is correct
58 Correct 19 ms 508 KB Output is correct
59 Correct 20 ms 516 KB Output is correct
60 Correct 18 ms 504 KB Output is correct
61 Correct 3 ms 308 KB Output is correct
62 Correct 4 ms 384 KB Output is correct
63 Correct 3 ms 256 KB Output is correct
64 Correct 2 ms 384 KB Output is correct
65 Correct 2 ms 316 KB Output is correct
66 Correct 2 ms 312 KB Output is correct
67 Correct 3 ms 308 KB Output is correct
68 Correct 3 ms 384 KB Output is correct
69 Correct 2 ms 256 KB Output is correct
70 Correct 3 ms 316 KB Output is correct
71 Incorrect 20 ms 492 KB answer is not correct
72 Halted 0 ms 0 KB -