oj.uz

답안 #103164

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
103164 2019-03-29T07:08:11 Z bert30702 커다란 상품 (IOI17_prize) C++17
100 / 100
 58 ms 636 KB 
#include <bits/stdc++.h>
#include "prize.h"
#define pii pair<int, int>
#define F first
#define S second
using namespace std;
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) {
	if(l == r) return ans.push_back({b.F + b.S, l});
	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 = query(0).F + query(0).S;
	if(mx == 0) return 0;
	dfs(0, n - 1, query(0), query(n - 1), mx);
	for(auto it: ans) if(it.F == 0) return it.S;
}

Compilation message

prize.cpp: In function 'void dfs(int, int, std::pair<int, int>, std::pair<int, int>, int)':
prize.cpp:17:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int m = l + r >> 1;
          ~~^~~
prize.cpp: In function 'int find_best(int)':
prize.cpp:37:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
20.0 / 20.0

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

Subtask #2
80.0 / 80.0

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