oj.uz

답안 #1048635

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1048635 2024-08-08T08:53:00 Z pcc 커다란 상품 (IOI17_prize) C++17
20 / 100
 120 ms 6192 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 = 440;
#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)>>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);
		if(!tmp.fs&&!tmp.sc){
			return perm[i];
		}
	}
	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 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 5 ms 3024 KB Output is correct
6 Correct 5 ms 3024 KB Output is correct
7 Correct 6 ms 3020 KB Output is correct
8 Correct 5 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
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 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 6 ms 3024 KB Output is correct
5 Correct 5 ms 3024 KB Output is correct
6 Correct 5 ms 3116 KB Output is correct
7 Correct 5 ms 3024 KB Output is correct
8 Correct 5 ms 3112 KB Output is correct
9 Correct 8 ms 3024 KB Output is correct
10 Correct 5 ms 3024 KB Output is correct
11 Correct 8 ms 3024 KB Output is correct
12 Correct 7 ms 3024 KB Output is correct
13 Correct 18 ms 3116 KB Output is correct
14 Correct 5 ms 2136 KB Output is correct
15 Correct 22 ms 3024 KB Output is correct
16 Correct 77 ms 3100 KB Output is correct
17 Correct 5 ms 3024 KB Output is correct
18 Partially correct 85 ms 3220 KB Partially correct - number of queries: 5058
19 Correct 5 ms 3024 KB Output is correct
20 Correct 23 ms 2544 KB Output is correct
21 Correct 38 ms 3024 KB Output is correct
22 Correct 11 ms 3024 KB Output is correct
23 Correct 6 ms 3024 KB Output is correct
24 Correct 5 ms 3024 KB Output is correct
25 Correct 48 ms 3024 KB Output is correct
26 Correct 5 ms 3024 KB Output is correct
27 Correct 9 ms 3024 KB Output is correct
28 Correct 78 ms 3212 KB Output is correct
29 Correct 61 ms 3024 KB Output is correct
30 Partially correct 114 ms 3108 KB Partially correct - number of queries: 5004
31 Correct 6 ms 3024 KB Output is correct
32 Correct 10 ms 3024 KB Output is correct
33 Correct 1 ms 1880 KB Output is correct
34 Correct 36 ms 3192 KB Output is correct
35 Correct 8 ms 3024 KB Output is correct
36 Correct 23 ms 3024 KB Output is correct
37 Correct 9 ms 3024 KB Output is correct
38 Correct 7 ms 3276 KB Output is correct
39 Correct 40 ms 3024 KB Output is correct
40 Correct 81 ms 3200 KB Output is correct
41 Correct 52 ms 3276 KB Output is correct
42 Correct 71 ms 3244 KB Output is correct
43 Correct 44 ms 3024 KB Output is correct
44 Correct 42 ms 3276 KB Output is correct
45 Correct 26 ms 3024 KB Output is correct
46 Correct 7 ms 3024 KB Output is correct
47 Correct 36 ms 3024 KB Output is correct
48 Correct 62 ms 3276 KB Output is correct
49 Correct 15 ms 3024 KB Output is correct
50 Partially correct 87 ms 3240 KB Partially correct - number of queries: 5036
51 Correct 35 ms 3024 KB Output is correct
52 Correct 5 ms 3024 KB Output is correct
53 Correct 9 ms 3024 KB Output is correct
54 Correct 37 ms 3024 KB Output is correct
55 Correct 7 ms 3024 KB Output is correct
56 Partially correct 102 ms 3320 KB Partially correct - number of queries: 5067
57 Correct 68 ms 3024 KB Output is correct
58 Correct 72 ms 3024 KB Output is correct
59 Correct 68 ms 3024 KB Output is correct
60 Correct 70 ms 3024 KB Output is correct
61 Correct 6 ms 3024 KB Output is correct
62 Correct 5 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 5 ms 3024 KB Output is correct
67 Correct 9 ms 3024 KB Output is correct
68 Correct 7 ms 3024 KB Output is correct
69 Correct 5 ms 3024 KB Output is correct
70 Correct 7 ms 3024 KB Output is correct
71 Partially correct 120 ms 3252 KB Partially correct - number of queries: 5180
72 Correct 13 ms 3024 KB Output is correct
73 Partially correct 96 ms 3024 KB Partially correct - number of queries: 5121
74 Partially correct 112 ms 3200 KB Partially correct - number of queries: 5142
75 Correct 7 ms 3024 KB Output is correct
76 Correct 80 ms 3024 KB Output is correct
77 Partially correct 111 ms 3024 KB Partially correct - number of queries: 5164
78 Correct 13 ms 3024 KB Output is correct
79 Correct 33 ms 3024 KB Output is correct
80 Partially correct 93 ms 3224 KB Partially correct - number of queries: 5132
81 Partially correct 87 ms 3532 KB Partially correct - number of queries: 5126
82 Partially correct 88 ms 3276 KB Partially correct - number of queries: 5071
83 Correct 8 ms 3024 KB Output is correct
84 Correct 75 ms 3264 KB Output is correct
85 Partially correct 116 ms 3032 KB Partially correct - number of queries: 5155
86 Correct 64 ms 3024 KB Output is correct
87 Correct 9 ms 3024 KB Output is correct
88 Correct 59 ms 3276 KB Output is correct
89 Correct 51 ms 3024 KB Output is correct
90 Correct 6 ms 3020 KB Output is correct
91 Correct 36 ms 3024 KB Output is correct
92 Correct 24 ms 3024 KB Output is correct
93 Runtime error 48 ms 6192 KB Execution killed with signal 6
94 Halted 0 ms 0 KB -