oj.uz

답안 #1048652

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1048652 2024-08-08T08:56:50 Z pcc 커다란 상품 (IOI17_prize) C++17
98.32 / 100
 107 ms 3324 KB 
#include "prize.h"
#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
#define pii pair<int,int>
#define fs first
#define sc second
mt19937 seed(time(NULL));
#define rnd(l,r) uniform_int_distribution<int>(l,r)(seed)

#ifdef LOCAL
const int lim = 3;
const int dt = 5;
#else
const int lim = 5000;
const int dt = 470;
#endif

const int mxn = 2e5+10;
pii dp[mxn];
int N;
int big = 1e9;
int ans = 0;
bool done = false;
int C = 0;
ordered_set<int> st;

pii req(int p){
	if(dp[p].fs != -1)return dp[p];
	C++;
	assert(C<=10000);
	auto re = ask(p);
	return (dp[p] = pii(re[0],re[1]));
}

int check(int p){
	auto re = req(p);
	if(!re.fs&&!re.sc)return 0;
	else if(N-re.fs-re.sc == big)return 2;
	else{
		st.insert(p);
		return 1;
	}
}

deque<pii> q;

void calc(){
	if(done)return;
	int l,r;
	if(rnd(0,1)){
		auto [a,b] = q.front();q.pop_front();
		l = a,r = b;
	}
	else{
		auto [a,b] = q.back();q.pop_back();
		l = a,r = b;
	}
	cerr<<"DFS: "<<l<<','<<r<<endl;
	while(l<=r){
		if(!check(l)){
			ans = l;
			done = true;
			return;
		}
		else if(check(l) == 1){
			l++;
		}
		else break;
	}
	while(l<=r){
		if(!check(r)){
			ans = r;
			done = true;
			return;
		}
		else if(check(r) == 1){
			r--;
		}
		else break;
	}
	if(l>=r)return;
	int cnt = req(r).fs+req(l).sc-(N-big);
	if(!cnt)return;
	cerr<<"CHECK: "<<l<<','<<r<<','<<cnt<<endl;
	assert(cnt>0);
	int mid = (l+r+1)>>1;
	if(check(mid) == 0){
		ans = mid;
		done = true;
		return;
	}
	if(l == r)return;
	if(l != mid)q.push_back(pii(l,mid));
	if(mid != r)q.push_back(pii(mid,r));
	return;
}

int find_best(int nn) {
	N = nn;
	int pt = 0;
	for(int i = 1;i*i<2e5;i++)pt = i;
	cerr<<pt<<endl;
	for(auto &i:dp)i = pii(-1,-1);
	if(N<=lim){
		for(int i = 0;i<N;i++){
			auto tmp = req(i);
			if(!tmp.fs&&!tmp.sc)return i;
		}
		assert(false);
		return 0;
	}
	vector<int> perm;
	for(int i = 0;i<N;i++)perm.push_back(i);
	shuffle(perm.begin(),perm.end(),seed);
	for(int i = 0;i<dt;i++){
		auto tmp = req(perm[i]);
		big = min(big,N-tmp.fs-tmp.sc);
		if(!tmp.fs&&!tmp.sc){
			return perm[i];
		}
	}
	cerr<<"BIG: "<<big<<endl;
	q.push_back(pii(0,N-1));
	while(!q.empty()&&!done)calc();
	if(!done)exit(0);
	return ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
78.32 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 3024 KB Output is correct
2 Correct 6 ms 3024 KB Output is correct
3 Correct 6 ms 3024 KB Output is correct
4 Correct 5 ms 3120 KB Output is correct
5 Correct 5 ms 3024 KB Output is correct
6 Correct 6 ms 3024 KB Output is correct
7 Correct 5 ms 3024 KB Output is correct
8 Correct 5 ms 3120 KB Output is correct
9 Correct 5 ms 3024 KB Output is correct
10 Correct 6 ms 3024 KB Output is correct
11 Correct 9 ms 3024 KB Output is correct
12 Correct 10 ms 3024 KB Output is correct
13 Correct 13 ms 3024 KB Output is correct
14 Correct 4 ms 2136 KB Output is correct
15 Correct 66 ms 3024 KB Output is correct
16 Correct 66 ms 3052 KB Output is correct
17 Correct 91 ms 3192 KB Output is correct
18 Correct 58 ms 3276 KB Output is correct
19 Correct 85 ms 3024 KB Output is correct
20 Correct 41 ms 2772 KB Output is correct
21 Correct 83 ms 3268 KB Output is correct
22 Correct 27 ms 3020 KB Output is correct
23 Correct 7 ms 3024 KB Output is correct
24 Correct 13 ms 3024 KB Output is correct
25 Correct 69 ms 3280 KB Output is correct
26 Correct 99 ms 3196 KB Output is correct
27 Correct 9 ms 3124 KB Output is correct
28 Correct 77 ms 3024 KB Output is correct
29 Correct 64 ms 3200 KB Output is correct
30 Correct 80 ms 3024 KB Output is correct
31 Correct 75 ms 3296 KB Output is correct
32 Correct 10 ms 3024 KB Output is correct
33 Correct 1 ms 1880 KB Output is correct
34 Correct 86 ms 3112 KB Output is correct
35 Correct 8 ms 3024 KB Output is correct
36 Correct 84 ms 3024 KB Output is correct
37 Correct 13 ms 3024 KB Output is correct
38 Correct 8 ms 3024 KB Output is correct
39 Correct 81 ms 3136 KB Output is correct
40 Correct 22 ms 3024 KB Output is correct
41 Correct 63 ms 3024 KB Output is correct
42 Correct 82 ms 3168 KB Output is correct
43 Correct 49 ms 3024 KB Output is correct
44 Correct 67 ms 3024 KB Output is correct
45 Correct 64 ms 3024 KB Output is correct
46 Partially correct 84 ms 3024 KB Partially correct - number of queries: 5094
47 Correct 53 ms 3200 KB Output is correct
48 Correct 44 ms 3024 KB Output is correct
49 Correct 61 ms 3024 KB Output is correct
50 Correct 21 ms 3024 KB Output is correct
51 Correct 83 ms 3024 KB Output is correct
52 Partially correct 82 ms 3272 KB Partially correct - number of queries: 5037
53 Correct 7 ms 3024 KB Output is correct
54 Correct 44 ms 3024 KB Output is correct
55 Partially correct 87 ms 3064 KB Partially correct - number of queries: 5024
56 Correct 33 ms 3024 KB Output is correct
57 Correct 48 ms 3264 KB Output is correct
58 Correct 68 ms 3180 KB Output is correct
59 Correct 86 ms 3260 KB Output is correct
60 Correct 91 ms 3324 KB Output is correct
61 Correct 7 ms 3024 KB Output is correct
62 Correct 9 ms 3124 KB Output is correct
63 Correct 7 ms 3024 KB Output is correct
64 Correct 8 ms 3024 KB Output is correct
65 Correct 6 ms 3116 KB Output is correct
66 Correct 6 ms 3024 KB Output is correct
67 Correct 8 ms 3120 KB Output is correct
68 Correct 7 ms 3024 KB Output is correct
69 Correct 5 ms 3116 KB Output is correct
70 Correct 7 ms 3024 KB Output is correct
71 Partially correct 107 ms 3196 KB Partially correct - number of queries: 5168
72 Correct 18 ms 3024 KB Output is correct
73 Partially correct 102 ms 3260 KB Partially correct - number of queries: 5137
74 Partially correct 92 ms 3268 KB Partially correct - number of queries: 5025
75 Correct 7 ms 3024 KB Output is correct
76 Correct 88 ms 3028 KB Output is correct
77 Partially correct 101 ms 3024 KB Partially correct - number of queries: 5061
78 Correct 12 ms 3024 KB Output is correct
79 Correct 43 ms 3024 KB Output is correct
80 Partially correct 96 ms 3024 KB Partially correct - number of queries: 5161
81 Partially correct 87 ms 3192 KB Partially correct - number of queries: 5095
82 Partially correct 96 ms 3232 KB Partially correct - number of queries: 5040
83 Correct 8 ms 3024 KB Output is correct
84 Correct 74 ms 3024 KB Output is correct
85 Correct 83 ms 3024 KB Output is correct
86 Correct 46 ms 3024 KB Output is correct
87 Correct 11 ms 3024 KB Output is correct
88 Correct 62 ms 3268 KB Output is correct
89 Correct 37 ms 3024 KB Output is correct
90 Correct 7 ms 3024 KB Output is correct
91 Correct 33 ms 3320 KB Output is correct
92 Correct 75 ms 3024 KB Output is correct
93 Correct 75 ms 3232 KB Output is correct
94 Correct 77 ms 3276 KB Output is correct
95 Correct 78 ms 3272 KB Output is correct
96 Correct 75 ms 3020 KB Output is correct
97 Correct 61 ms 3024 KB Output is correct