oj.uz

답안 #949747

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
949747 2024-03-19T15:36:48 Z qin 커다란 상품 (IOI17_prize) C++17
100 / 100
 33 ms 688 KB 
#include <bits/stdc++.h>
#include "prize.h"
#define fi first
#define se second
#define ssize(x) int(x.size())
#define pn printf("\n")
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(), x.rend()
#define vv vector
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int inf = 2e09; ll infll = 2e18; int mod = 119<<23|1;
//~ #ifdef LOCAL
//~ vector<int> ask(int i){ return vector<int>(2, 0); }
//~ #endif
int SUM; // bound na checka, czy to jest gosc z lepszej, czy nie
mt19937 rng(34);
int f(int l, int r, int resl, int resr){
		//~ printf("%d %d\n", l, r);
		int midl = (l+r)/2, midr = (l+r)/2;
		int result = 0;
		
		vv<int> tmp = ask(midl), tmp2 = tmp; int sum = tmp[0]+tmp[1];
		while(sum != SUM && l < midl-1){
				if(!sum){ return midl;}
				--midl;
				tmp = ask(midl); sum = tmp[0]+tmp[1];
		}
		if(!sum) return midl;
		if(sum == SUM && resl != tmp[0]) result = max(result, f(l, midl, resl, tmp[0]));
		
		sum = tmp2[0]+tmp2[1];
		while(sum != SUM && midr+1 < r){
				if(!sum) return midr;
				++midr;
				tmp = ask(midr); sum = tmp[0]+tmp[1];
		}
		if(!sum) return midr;
		if(sum == SUM && resr != tmp[0]) result = max(result, f(midr, r, tmp[0], resr));
		
		return result;
}
int find_best(int n){
		//~ if(n <= 5000){
				//~ vv<int> tmp; int result = 0;
				//~ for(int i = 0; i < n; ++i){
						//~ tmp = ask(i);
						//~ if(!(tmp[0]+tmp[1])){ result = i; break; }
				//~ } return result;
		//~ }
		for(int i = 0; i < 50; ++i){
				int x = rng()%n;
				vv<int> tmp = ask(x); int sum = tmp[0]+tmp[1];
				SUM = max(SUM, sum);
				if(!sum) return x;
		}
		int l = 0, r = n-1, resl = 0, resr = 0;
		vv<int> tmp;
		for(int i = 0; i < n; ++i){
				tmp = ask(i); int sum = tmp[0]+tmp[1];
				if(sum == SUM){ l = i, resl = tmp[0]; break; }
				else if(!sum) return i;
		}
		for(int i = n-1; ~i; --i){
				tmp = ask(i); int sum = tmp[0]+tmp[1];
				if(sum == SUM){ r = i, resr = tmp[0]; break; }
				else if(!sum) return i;
		}
		return f(l, r, resl, resr);
}
//~ #ifdef LOCAL
//~ int main(){
		//~ int T = 1;
		//~ for(++T; --T; ) find_best(T);
		//~ return 0;
//~ }
//~ #endif

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 436 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 436 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct

Subtask #2
80.0 / 80.0

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