oj.uz

답안 #260505

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
260505 2020-08-10T11:51:07 Z b00n0rp 커다란 상품 (IOI17_prize) C++17
100 / 100
 72 ms 5268 KB 
#include "prize.h"
#include<bits/stdc++.h>
using namespace std;

#define vi vector<int>
#define pb push_back
#define F first
#define S second
#define pii pair<int,int>
#define all(v) v.begin(),v.end()

mt19937 RNG(2898); 

vector<pii> possible;
int mx;

vi done[200005];

vi asky(int ind){
	// cout << ind << endl;
	if(done[ind].size()) return done[ind];
	return done[ind] = ask(ind);
}

int solve(int l,int r,int lcnt,int rcnt){
	// cout << l << " " << r << " " << lcnt << " " << rcnt << endl;
	if(l > r) return -1;
	if(lcnt+rcnt == mx) return -1;
	int mid = (l+r)/2;
	int m = mid;
	int bizz = 0;
	while(mid >= l){
		vi gg = asky(mid);
		if(gg[0]+gg[1] == mx){
			if(RNG()%2){
				int pos = solve(l,mid-1,lcnt,gg[1]);
				if(pos != -1) return pos;
				return solve(m+1,r,gg[0]+bizz,rcnt);
			}
			else{
				int pos = solve(m+1,r,gg[0]+bizz,rcnt);
				if(pos != -1) return pos;
				return solve(l,mid-1,lcnt,gg[1]);
			}
		}
		if(gg[0]+gg[1] == 0) return mid;
		possible.pb({gg[0]+gg[1],mid});
		bizz++;
		mid--;
	}
	return solve(m+1,r,lcnt+bizz,rcnt);
}

int find_best(int n){
	int ind;
	for(int i = 0; i < 500; i++){
		ind = RNG()%n;
		vi gg = asky(ind);
		mx = max(mx,gg[0]+gg[1]);
		if(mx > 100) break;
	}
	return solve(0,n-1,0,0);
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 4992 KB Output is correct
2 Correct 8 ms 4992 KB Output is correct
3 Correct 10 ms 4992 KB Output is correct
4 Correct 6 ms 5092 KB Output is correct
5 Correct 6 ms 5084 KB Output is correct
6 Correct 8 ms 4992 KB Output is correct
7 Correct 8 ms 4992 KB Output is correct
8 Correct 8 ms 4992 KB Output is correct
9 Correct 8 ms 4992 KB Output is correct
10 Correct 10 ms 5120 KB Output is correct

Subtask #2
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 4992 KB Output is correct
2 Correct 9 ms 4992 KB Output is correct
3 Correct 7 ms 5132 KB Output is correct
4 Correct 8 ms 4992 KB Output is correct
5 Correct 7 ms 4992 KB Output is correct
6 Correct 8 ms 4992 KB Output is correct
7 Correct 7 ms 4992 KB Output is correct
8 Correct 8 ms 5112 KB Output is correct
9 Correct 10 ms 4992 KB Output is correct
10 Correct 9 ms 4992 KB Output is correct
11 Correct 11 ms 4992 KB Output is correct
12 Correct 10 ms 4992 KB Output is correct
13 Correct 8 ms 4992 KB Output is correct
14 Correct 11 ms 4992 KB Output is correct
15 Correct 24 ms 5240 KB Output is correct
16 Correct 16 ms 4992 KB Output is correct
17 Correct 21 ms 5160 KB Output is correct
18 Correct 12 ms 5172 KB Output is correct
19 Correct 54 ms 5112 KB Output is correct
20 Correct 25 ms 5112 KB Output is correct
21 Correct 41 ms 5112 KB Output is correct
22 Correct 30 ms 5112 KB Output is correct
23 Correct 12 ms 4992 KB Output is correct
24 Correct 9 ms 5092 KB Output is correct
25 Correct 11 ms 4992 KB Output is correct
26 Correct 11 ms 4992 KB Output is correct
27 Correct 7 ms 4992 KB Output is correct
28 Correct 14 ms 5224 KB Output is correct
29 Correct 19 ms 4992 KB Output is correct
30 Correct 28 ms 5112 KB Output is correct
31 Correct 52 ms 5112 KB Output is correct
32 Correct 13 ms 4992 KB Output is correct
33 Correct 5 ms 4992 KB Output is correct
34 Correct 44 ms 5112 KB Output is correct
35 Correct 9 ms 4992 KB Output is correct
36 Correct 31 ms 5112 KB Output is correct
37 Correct 17 ms 4992 KB Output is correct
38 Correct 12 ms 4992 KB Output is correct
39 Correct 36 ms 5112 KB Output is correct
40 Correct 25 ms 4992 KB Output is correct
41 Correct 11 ms 4992 KB Output is correct
42 Correct 9 ms 5072 KB Output is correct
43 Correct 12 ms 4992 KB Output is correct
44 Correct 37 ms 5112 KB Output is correct
45 Correct 26 ms 5112 KB Output is correct
46 Correct 34 ms 5224 KB Output is correct
47 Correct 25 ms 5112 KB Output is correct
48 Correct 10 ms 4992 KB Output is correct
49 Correct 62 ms 5112 KB Output is correct
50 Correct 25 ms 5112 KB Output is correct
51 Correct 39 ms 5112 KB Output is correct
52 Correct 49 ms 5112 KB Output is correct
53 Correct 8 ms 4992 KB Output is correct
54 Correct 55 ms 5112 KB Output is correct
55 Correct 44 ms 5112 KB Output is correct
56 Correct 17 ms 5112 KB Output is correct
57 Correct 7 ms 4992 KB Output is correct
58 Correct 9 ms 4992 KB Output is correct
59 Correct 9 ms 4992 KB Output is correct
60 Correct 12 ms 4992 KB Output is correct
61 Correct 11 ms 4992 KB Output is correct
62 Correct 11 ms 4992 KB Output is correct
63 Correct 10 ms 5112 KB Output is correct
64 Correct 12 ms 4992 KB Output is correct
65 Correct 9 ms 4992 KB Output is correct
66 Correct 8 ms 5112 KB Output is correct
67 Correct 4 ms 4992 KB Output is correct
68 Correct 10 ms 5104 KB Output is correct
69 Correct 10 ms 4992 KB Output is correct
70 Correct 5 ms 4992 KB Output is correct
71 Correct 72 ms 5116 KB Output is correct
72 Correct 10 ms 5236 KB Output is correct
73 Correct 69 ms 5112 KB Output is correct
74 Correct 71 ms 5112 KB Output is correct
75 Correct 10 ms 4992 KB Output is correct
76 Correct 61 ms 5112 KB Output is correct
77 Correct 67 ms 5112 KB Output is correct
78 Correct 10 ms 4992 KB Output is correct
79 Correct 20 ms 5112 KB Output is correct
80 Correct 66 ms 5116 KB Output is correct
81 Correct 68 ms 5112 KB Output is correct
82 Correct 48 ms 5216 KB Output is correct
83 Correct 13 ms 4992 KB Output is correct
84 Correct 52 ms 5204 KB Output is correct
85 Correct 41 ms 5112 KB Output is correct
86 Correct 15 ms 5112 KB Output is correct
87 Correct 10 ms 4992 KB Output is correct
88 Correct 12 ms 4992 KB Output is correct
89 Correct 9 ms 4992 KB Output is correct
90 Correct 9 ms 4992 KB Output is correct
91 Correct 13 ms 4992 KB Output is correct
92 Correct 13 ms 5112 KB Output is correct
93 Correct 36 ms 5120 KB Output is correct
94 Correct 37 ms 5112 KB Output is correct
95 Correct 43 ms 5120 KB Output is correct
96 Correct 41 ms 5120 KB Output is correct
97 Correct 17 ms 5268 KB Output is correct