oj.uz

답안 #351230

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
351230 2021-01-19T16:50:20 Z ryansee 커다란 상품 (IOI17_prize) C++14
99.4 / 100
 72 ms 3172 KB 
#include "prize.h"
 
#include "bits/stdc++.h"
using namespace std;
 
#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());    //can be used by calling rng() or shuffle(A, A+n, rng)
inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusivesss
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }
 
using ll=long long; 
using ld=long double;
#define FOR(i,s,e) for(int i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>; 
 
long long LLINF = 1e18;
int INF = 1e9+1e6;
#define MAXN (200006)
 
int n, others, ans=-1, l, r, co2, choice;
int memo[MAXN][2];

vector<int> my_ask(int ind) {
	if(memo[ind][0]==-1) {
		vector<int> tmp = ask(ind);
		memo[ind][0] = tmp[0], memo[ind][1] = tmp[1];
	}
	return vector<int>{memo[ind][0], memo[ind][1]};
}

void dnc(int s,int e,int many,int infront,int co) {
    s = max(s, l), e = min(e, r);
	if(s > e || many == 0) return;
	++ co2;
	if(many == 1) {
		int st = s-1, en = e;
		vector<int> memo=my_ask(en);
		while(en-st>1) {
			int mid = (st+en) >> 1;
			vector<int> res = my_ask(mid);
			if(res[0]+res[1] != others || res[0] - infront) en = mid, memo = res;
			else st = mid;
		}
		if(memo[0]+memo[1]==0) ans=en;
		if(memo[0]==0) l=en+1;
		if(memo[1]==0) r=en-1;
		return;
	}
	int mid = (s+e) >> 1, omid = mid;
	vector<int> res = my_ask(mid);
	if(res[0] == 0) l=max(l, mid+1);
	if(res[1] == 0) r=min(r, mid-1);
	while(res[0]+res[1] != others) {
		if(res[0]+res[1]==0) ans=mid;
		if(res[0] == 0) l=max(l, mid+1);
		if(res[1] == 0) r=min(r, mid-1);
		if(mid == s) {
			dnc(omid+1, e, many - (omid - s + 1), infront + (omid - s + 1), co+1);
			return;
		}
		-- mid;
		res = my_ask(mid);
	}
	if((choice == 1 && co%2==0) || (choice == 0 && (co2 & 1))) {
	    dnc(s, mid-1, res[0] - infront, infront, co);
	
	    dnc(omid+1, e, many - (res[0] - infront) - (omid - mid), res[0] + (omid - mid), !co);
	} else {
	    dnc(omid+1, e, many - (res[0] - infront) - (omid - mid), res[0] + (omid - mid), !co);
	
	    dnc(s, mid-1, res[0] - infront, infront, co);
	}
}
 
int find_best(int N) { n = N, r = n-1, mmst(memo, -1);
    vector<int> p;
    FOR(i,0,n-1) p.eb(i);
    FOR(i,0,3) shuffle(all(p), rng);
    
    choice = rand(0, 1);
    
	FOR(ii,0,min(n-1,473)) {
	    int i=p[ii];
		vector<int> res = my_ask(i);
		others = max(res[0]+res[1], others);
		if(res[0] == 0) l=max(l, i+1);
		if(res[1] == 0) r=min(r, i-1);
		if(res[0]==res[1]&&res[0]==0) return i;
	}
	dnc(0, n-1, others, 0, 0), assert(~ans);
	return ans;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 3044 KB Output is correct
2 Correct 28 ms 3044 KB Output is correct
3 Correct 28 ms 3044 KB Output is correct
4 Correct 29 ms 3044 KB Output is correct
5 Correct 30 ms 3044 KB Output is correct
6 Correct 29 ms 3044 KB Output is correct
7 Correct 29 ms 3044 KB Output is correct
8 Correct 26 ms 3044 KB Output is correct
9 Correct 31 ms 3044 KB Output is correct
10 Correct 29 ms 3044 KB Output is correct

Subtask #2
79.4 / 80.0

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