oj.uz

답안 #1036789

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1036789 2024-07-27T17:10:55 Z ALeonidou 커다란 상품 (IOI17_prize) C++17
20 / 100
 51 ms 596 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

#define ll int
#define endl "\n"
#define sz(x) (ll)x.size()
#define F first
#define S second
#define pb push_back

typedef vector <ll> vi;
typedef pair <ll,ll> ii;
typedef vector <ii> vii;

#define dbg(x) cout<<#x<<": "<<x<<endl;
#define dbg2(x,y) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<endl;
#define dbg3(x,y,z) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<" "<<#z<<": "<<z<<endl;

void printVct(vi &v){
	for (ll i =0; i<sz(v); i++){
		cout<<v[i]<<" ";
	}
	cout<<endl;
}

ll common_val = 0;
ll ans = -1;

void query(ll q, vi &v, ll &s){
	v = ask(q);
	s = v[0] + v[1];
	if (s == 0){
		ans = q;
	}
}

void bs(ll l, ll r, ll x, ll belowL, ll aboveR){
	if (x == 0) return;
	if (l > r) return;
	if (ans != -1) return;

	ll mid = (l+r)/2;
	vi v; ll s;
	query(mid, v, s);

	if (s != common_val){
		ll l_mid = mid-1;
		ll c = 1;
		while (l_mid >= l && s != common_val){
			query(l_mid, v, s);	
			if (s == common_val) break;
			l_mid--;
			c++;
		}
		if (l_mid < l){
			ll val_r = x - c;
			bs(mid+1,r,val_r,c,aboveR);
		}
		else{
			ll val_l = v[0] - belowL;
			ll val_r = v[1] - aboveR - c;
			bs(l,mid-1,val_l,belowL,v[1]);
			bs(mid+1,r,val_r,v[0]+c,aboveR);
		}
	}

	ll val_l = v[0] - belowL;
	ll val_r = v[1] - aboveR;

	//hit on a common val:
	bs(l,mid-1,val_l,belowL,v[1]);
	bs(mid+1,r,val_r,v[0],aboveR);
}

int find_best(int n) {	
	//n < 5000: BF - linear search
	if (n <= 5000){
		for (ll i =0; i<n; i++){	
			vi v = ask(i);
			ll s = v[0] + v[1];
			if (s == 0){
				return i;
			}
		}
	}

	//step 1: Find common value
	for (ll i =0; i<470; i++){
		vi v = ask(i);
		ll s = v[0] + v[1];
		common_val = max(common_val, s);
		if (s == 0){
			return i;
		}
	}

	// common_val = 4;

	//identify all uncommon one by one
	//start from pos = 0, and move like binary lifting
	bs(0, n-1, common_val, 0, 0);

	return ans;
}

/*
6
1 2 2 2 2 2
*/

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Correct 3 ms 344 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 3 ms 344 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 7 ms 344 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 5 ms 344 KB Output is correct
16 Correct 20 ms 428 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Partially correct 24 ms 344 KB Partially correct - number of queries: 5407
19 Correct 2 ms 344 KB Output is correct
20 Correct 5 ms 344 KB Output is correct
21 Correct 9 ms 344 KB Output is correct
22 Correct 5 ms 344 KB Output is correct
23 Correct 2 ms 344 KB Output is correct
24 Correct 3 ms 344 KB Output is correct
25 Correct 19 ms 344 KB Output is correct
26 Correct 15 ms 344 KB Output is correct
27 Correct 3 ms 344 KB Output is correct
28 Correct 17 ms 340 KB Output is correct
29 Correct 24 ms 344 KB Output is correct
30 Partially correct 36 ms 344 KB Partially correct - number of queries: 5208
31 Correct 3 ms 344 KB Output is correct
32 Correct 4 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 11 ms 424 KB Output is correct
35 Correct 3 ms 344 KB Output is correct
36 Correct 7 ms 344 KB Output is correct
37 Correct 4 ms 344 KB Output is correct
38 Correct 2 ms 344 KB Output is correct
39 Correct 12 ms 344 KB Output is correct
40 Correct 15 ms 344 KB Output is correct
41 Correct 15 ms 344 KB Output is correct
42 Correct 18 ms 344 KB Output is correct
43 Correct 8 ms 344 KB Output is correct
44 Correct 16 ms 344 KB Output is correct
45 Correct 8 ms 344 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 8 ms 344 KB Output is correct
48 Correct 15 ms 344 KB Output is correct
49 Correct 5 ms 344 KB Output is correct
50 Partially correct 21 ms 424 KB Partially correct - number of queries: 5267
51 Correct 13 ms 344 KB Output is correct
52 Correct 4 ms 344 KB Output is correct
53 Correct 3 ms 344 KB Output is correct
54 Correct 13 ms 344 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Partially correct 24 ms 344 KB Partially correct - number of queries: 5244
57 Correct 14 ms 340 KB Output is correct
58 Correct 17 ms 344 KB Output is correct
59 Correct 14 ms 344 KB Output is correct
60 Correct 14 ms 344 KB Output is correct
61 Correct 3 ms 344 KB Output is correct
62 Correct 3 ms 344 KB Output is correct
63 Correct 3 ms 344 KB Output is correct
64 Correct 3 ms 344 KB Output is correct
65 Correct 4 ms 344 KB Output is correct
66 Correct 4 ms 344 KB Output is correct
67 Correct 3 ms 344 KB Output is correct
68 Correct 3 ms 344 KB Output is correct
69 Correct 4 ms 344 KB Output is correct
70 Correct 3 ms 344 KB Output is correct
71 Partially correct 38 ms 344 KB Partially correct - number of queries: 5229
72 Correct 4 ms 344 KB Output is correct
73 Partially correct 32 ms 344 KB Partially correct - number of queries: 5166
74 Partially correct 27 ms 344 KB Partially correct - number of queries: 5193
75 Correct 3 ms 344 KB Output is correct
76 Correct 27 ms 344 KB Output is correct
77 Partially correct 21 ms 340 KB Partially correct - number of queries: 5563
78 Correct 3 ms 344 KB Output is correct
79 Correct 14 ms 344 KB Output is correct
80 Partially correct 32 ms 344 KB Partially correct - number of queries: 5439
81 Partially correct 24 ms 344 KB Partially correct - number of queries: 5404
82 Partially correct 32 ms 344 KB Partially correct - number of queries: 5433
83 Correct 3 ms 344 KB Output is correct
84 Correct 27 ms 344 KB Output is correct
85 Partially correct 28 ms 344 KB Partially correct - number of queries: 5425
86 Incorrect 51 ms 344 KB Incorrect
87 Halted 0 ms 0 KB -