답안 #119883

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
119883	2019-06-22T14:34:58 Z	TuGSGeReL	커다란 상품 (IOI17_prize)	C++14	100 / 100	58 ms	512 KB

prize

#include "prize.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

#define ll long long
#define mp make_pair
#define pub push_back
#define pob pop_back()
#define ss second
#define ff first
#define mt make_tuple
#define pof pop_front()
#define fbo find_by_order
#define ook order_of_key
#define lb lower_bound
#define ub upper_bound

typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
using pll = pair <ll, ll>;
using pii = pair <int, int>;

int ans = -1;

void solve(int l, int r, vector <int> resl, vector <int> resr) {	
	if ( ans != -1 )
		return;
	
	if ( resl[0] + resl[1] == 0 ) {
		ans = l;
		return;
	}
	
	if ( resr[0] + resr[1] == 0 ) {
		ans = r;
		return;
	}
	
	if ( l + 1 >= r )
		return;
	
	if (resl[0] + resl[1] < resr[0] + resr[1]) {
		solve(l + 1, r, ask(l + 1), resr);
		return;
	}
	
	if (resl[0] + resl[1] > resr[0] + resr[1]) {
		solve(l, r - 1, ask(l), ask(r - 1));
		return;
	}
	
	if ( resl[0] == resr[0] && resl[1] == resr[1] )
		return;
	
	
	int mid = (l + r) / 2;
	vector <int> resm = ask(mid);
	solve(l, mid, resl, resm);
	solve(mid, r, resm, resr);
}

int find_best(int n) {
	
	solve(0, n - 1, ask(0), ask(n - 1));
	
	return ans;
}

Subtask #1

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	440 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	512 KB	Output is correct
4	Correct	2 ms	320 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	3 ms	388 KB	Output is correct
7	Correct	2 ms	316 KB	Output is correct
8	Correct	2 ms	392 KB	Output is correct
9	Correct	2 ms	256 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	256 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	2 ms	256 KB	Output is correct
9	Correct	7 ms	376 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	2 ms	256 KB	Output is correct
13	Correct	3 ms	512 KB	Output is correct
14	Correct	6 ms	384 KB	Output is correct
15	Correct	6 ms	256 KB	Output is correct
16	Correct	45 ms	512 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	47 ms	384 KB	Output is correct
19	Correct	3 ms	384 KB	Output is correct
20	Correct	11 ms	404 KB	Output is correct
21	Correct	13 ms	256 KB	Output is correct
22	Correct	7 ms	256 KB	Output is correct
23	Correct	2 ms	256 KB	Output is correct
24	Correct	2 ms	384 KB	Output is correct
25	Correct	10 ms	376 KB	Output is correct
26	Correct	10 ms	384 KB	Output is correct
27	Correct	2 ms	324 KB	Output is correct
28	Correct	44 ms	384 KB	Output is correct
29	Correct	13 ms	388 KB	Output is correct
30	Correct	20 ms	384 KB	Output is correct
31	Correct	2 ms	384 KB	Output is correct
32	Correct	5 ms	308 KB	Output is correct
33	Correct	2 ms	384 KB	Output is correct
34	Correct	12 ms	256 KB	Output is correct
35	Correct	3 ms	384 KB	Output is correct
36	Correct	9 ms	256 KB	Output is correct
37	Correct	3 ms	384 KB	Output is correct
38	Correct	2 ms	384 KB	Output is correct
39	Correct	18 ms	392 KB	Output is correct
40	Correct	38 ms	256 KB	Output is correct
41	Correct	26 ms	256 KB	Output is correct
42	Correct	22 ms	384 KB	Output is correct
43	Correct	10 ms	384 KB	Output is correct
44	Correct	17 ms	256 KB	Output is correct
45	Correct	7 ms	384 KB	Output is correct
46	Correct	2 ms	384 KB	Output is correct
47	Correct	12 ms	392 KB	Output is correct
48	Correct	37 ms	384 KB	Output is correct
49	Correct	4 ms	308 KB	Output is correct
50	Correct	58 ms	384 KB	Output is correct
51	Correct	8 ms	396 KB	Output is correct
52	Correct	2 ms	384 KB	Output is correct
53	Correct	2 ms	256 KB	Output is correct
54	Correct	8 ms	384 KB	Output is correct
55	Correct	2 ms	384 KB	Output is correct
56	Correct	22 ms	308 KB	Output is correct
57	Correct	32 ms	256 KB	Output is correct
58	Correct	20 ms	256 KB	Output is correct
59	Correct	17 ms	304 KB	Output is correct
60	Correct	19 ms	316 KB	Output is correct
61	Correct	4 ms	256 KB	Output is correct
62	Correct	2 ms	384 KB	Output is correct
63	Correct	2 ms	504 KB	Output is correct
64	Correct	2 ms	392 KB	Output is correct
65	Correct	2 ms	388 KB	Output is correct
66	Correct	2 ms	384 KB	Output is correct
67	Correct	10 ms	316 KB	Output is correct
68	Correct	6 ms	412 KB	Output is correct
69	Correct	2 ms	384 KB	Output is correct
70	Correct	6 ms	308 KB	Output is correct
71	Correct	47 ms	256 KB	Output is correct
72	Correct	7 ms	256 KB	Output is correct
73	Correct	35 ms	256 KB	Output is correct
74	Correct	45 ms	256 KB	Output is correct
75	Correct	2 ms	384 KB	Output is correct
76	Correct	38 ms	384 KB	Output is correct
77	Correct	20 ms	384 KB	Output is correct
78	Correct	12 ms	304 KB	Output is correct
79	Correct	16 ms	384 KB	Output is correct
80	Correct	57 ms	256 KB	Output is correct
81	Correct	19 ms	384 KB	Output is correct
82	Correct	31 ms	256 KB	Output is correct
83	Correct	2 ms	512 KB	Output is correct
84	Correct	46 ms	256 KB	Output is correct
85	Correct	33 ms	384 KB	Output is correct
86	Correct	5 ms	384 KB	Output is correct
87	Correct	3 ms	316 KB	Output is correct
88	Correct	5 ms	256 KB	Output is correct
89	Correct	5 ms	256 KB	Output is correct
90	Correct	3 ms	256 KB	Output is correct
91	Correct	2 ms	512 KB	Output is correct
92	Correct	2 ms	256 KB	Output is correct
93	Correct	4 ms	384 KB	Output is correct
94	Correct	4 ms	256 KB	Output is correct
95	Correct	4 ms	256 KB	Output is correct
96	Correct	5 ms	256 KB	Output is correct
97	Correct	2 ms	256 KB	Output is correct