oj.uz

답안 #1048461

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1048461 2024-08-08T07:46:27 Z pcc 커다란 상품 (IOI17_prize) C++17
97.67 / 100
 131 ms 3544 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

#ifdef LOCAL
const int lim = 3;
const int dt = 5;
#else
const int lim = 5000;
const int dt = 500;
#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;
	}
}

void dfs(int l,int r){
	if(done)return;
	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;
	if(check(mid) == 0){
		ans = mid;
		done = true;
		return;
	}
	if(l == r)return;
	if(l != mid)dfs(l,mid);
	if(mid != r)dfs(mid,r);
	return;
}

int find_best(int nn) {
	mt19937 seed(time(NULL));
#define rnd(l,r) uniform_int_distribution<int>(l,r)(seed)
	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);
	}
	cerr<<"BIG: "<<big<<endl;
	dfs(0,N-1);
	if(!done)exit(0);
	return ans;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 3024 KB Output is correct
2 Correct 7 ms 3024 KB Output is correct
3 Correct 7 ms 3020 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 7 ms 3024 KB Output is correct

Subtask #2
77.67 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 3024 KB Output is correct
2 Correct 5 ms 3024 KB Output is correct
3 Correct 6 ms 3024 KB Output is correct
4 Correct 5 ms 3024 KB Output is correct
5 Correct 6 ms 3116 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 3036 KB Output is correct
10 Correct 5 ms 3024 KB Output is correct
11 Correct 11 ms 3024 KB Output is correct
12 Correct 5 ms 3024 KB Output is correct
13 Correct 19 ms 3024 KB Output is correct
14 Correct 5 ms 2392 KB Output is correct
15 Correct 17 ms 3116 KB Output is correct
16 Correct 68 ms 3024 KB Output is correct
17 Correct 5 ms 3024 KB Output is correct
18 Partially correct 82 ms 3264 KB Partially correct - number of queries: 5110
19 Correct 5 ms 3020 KB Output is correct
20 Correct 22 ms 2572 KB Output is correct
21 Correct 36 ms 3024 KB Output is correct
22 Correct 10 ms 3024 KB Output is correct
23 Correct 5 ms 3024 KB Output is correct
24 Correct 5 ms 3024 KB Output is correct
25 Correct 42 ms 3024 KB Output is correct
26 Correct 43 ms 3188 KB Output is correct
27 Correct 6 ms 3024 KB Output is correct
28 Correct 78 ms 3024 KB Output is correct
29 Correct 57 ms 3024 KB Output is correct
30 Partially correct 107 ms 3024 KB Partially correct - number of queries: 5087
31 Correct 6 ms 3024 KB Output is correct
32 Correct 15 ms 3024 KB Output is correct
33 Correct 1 ms 1880 KB Output is correct
34 Correct 28 ms 3024 KB Output is correct
35 Correct 8 ms 3024 KB Output is correct
36 Correct 28 ms 3024 KB Output is correct
37 Correct 7 ms 3024 KB Output is correct
38 Correct 5 ms 3112 KB Output is correct
39 Correct 45 ms 3024 KB Output is correct
40 Correct 90 ms 3024 KB Output is correct
41 Correct 54 ms 3512 KB Output is correct
42 Correct 51 ms 3024 KB Output is correct
43 Correct 48 ms 3024 KB Output is correct
44 Correct 36 ms 3024 KB Output is correct
45 Correct 41 ms 3024 KB Output is correct
46 Correct 7 ms 3276 KB Output is correct
47 Correct 51 ms 3024 KB Output is correct
48 Correct 66 ms 3024 KB Output is correct
49 Correct 13 ms 3024 KB Output is correct
50 Partially correct 95 ms 3212 KB Partially correct - number of queries: 5113
51 Correct 35 ms 3024 KB Output is correct
52 Correct 6 ms 3024 KB Output is correct
53 Correct 7 ms 3024 KB Output is correct
54 Correct 39 ms 3024 KB Output is correct
55 Correct 6 ms 3024 KB Output is correct
56 Partially correct 92 ms 3228 KB Partially correct - number of queries: 5093
57 Correct 74 ms 3164 KB Output is correct
58 Correct 64 ms 3024 KB Output is correct
59 Correct 52 ms 3040 KB Output is correct
60 Correct 47 ms 3024 KB Output is correct
61 Correct 7 ms 3024 KB Output is correct
62 Correct 6 ms 3024 KB Output is correct
63 Correct 8 ms 3024 KB Output is correct
64 Correct 6 ms 3024 KB Output is correct
65 Correct 5 ms 3024 KB Output is correct
66 Correct 7 ms 3024 KB Output is correct
67 Correct 9 ms 3116 KB Output is correct
68 Correct 7 ms 3024 KB Output is correct
69 Correct 6 ms 3024 KB Output is correct
70 Correct 6 ms 3024 KB Output is correct
71 Partially correct 96 ms 3024 KB Partially correct - number of queries: 5233
72 Correct 14 ms 3020 KB Output is correct
73 Partially correct 131 ms 3180 KB Partially correct - number of queries: 5170
74 Partially correct 106 ms 3180 KB Partially correct - number of queries: 5195
75 Correct 7 ms 3024 KB Output is correct
76 Correct 82 ms 3308 KB Output is correct
77 Partially correct 110 ms 3336 KB Partially correct - number of queries: 5204
78 Correct 13 ms 3024 KB Output is correct
79 Correct 45 ms 3024 KB Output is correct
80 Partially correct 95 ms 3044 KB Partially correct - number of queries: 5190
81 Partially correct 91 ms 3024 KB Partially correct - number of queries: 5193
82 Partially correct 103 ms 3280 KB Partially correct - number of queries: 5221
83 Correct 9 ms 3024 KB Output is correct
84 Correct 49 ms 3228 KB Output is correct
85 Partially correct 95 ms 3024 KB Partially correct - number of queries: 5175
86 Correct 64 ms 3172 KB Output is correct
87 Correct 10 ms 3024 KB Output is correct
88 Correct 69 ms 3208 KB Output is correct
89 Correct 26 ms 3276 KB Output is correct
90 Correct 7 ms 3024 KB Output is correct
91 Correct 34 ms 3184 KB Output is correct
92 Correct 42 ms 3024 KB Output is correct
93 Correct 80 ms 3268 KB Output is correct
94 Correct 88 ms 3260 KB Output is correct
95 Correct 88 ms 3544 KB Output is correct
96 Correct 77 ms 3208 KB Output is correct
97 Correct 67 ms 3220 KB Output is correct