oj.uz

답안 #1048262

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1048262 2024-08-08T06:06:51 Z pcc 커다란 상품 (IOI17_prize) C++17
97.41 / 100
 106 ms 2848 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 sq = 5;
#else
const int lim = 5000;
const int sq = 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;
	dfs(l,mid);
	dfs(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;
	}
	for(int i = 0;i<sq;i++){
		auto tmp = req(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 4 ms 1880 KB Output is correct
2 Correct 4 ms 1880 KB Output is correct
3 Correct 3 ms 1880 KB Output is correct
4 Correct 3 ms 1880 KB Output is correct
5 Correct 3 ms 1880 KB Output is correct
6 Correct 2 ms 1880 KB Output is correct
7 Correct 3 ms 1788 KB Output is correct
8 Correct 3 ms 1880 KB Output is correct
9 Correct 3 ms 1972 KB Output is correct
10 Correct 2 ms 1880 KB Output is correct

Subtask #2
77.41 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1880 KB Output is correct
2 Correct 3 ms 1880 KB Output is correct
3 Correct 3 ms 1880 KB Output is correct
4 Correct 4 ms 1880 KB Output is correct
5 Correct 4 ms 1880 KB Output is correct
6 Correct 4 ms 1880 KB Output is correct
7 Correct 4 ms 1880 KB Output is correct
8 Correct 3 ms 1880 KB Output is correct
9 Correct 2 ms 1880 KB Output is correct
10 Correct 2 ms 1880 KB Output is correct
11 Correct 5 ms 1880 KB Output is correct
12 Correct 3 ms 1880 KB Output is correct
13 Correct 13 ms 2136 KB Output is correct
14 Correct 5 ms 1880 KB Output is correct
15 Correct 14 ms 2024 KB Output is correct
16 Correct 70 ms 2172 KB Output is correct
17 Correct 3 ms 1880 KB Output is correct
18 Partially correct 101 ms 2128 KB Partially correct - number of queries: 5112
19 Correct 3 ms 1880 KB Output is correct
20 Correct 21 ms 1880 KB Output is correct
21 Correct 38 ms 2264 KB Output is correct
22 Correct 8 ms 1880 KB Output is correct
23 Correct 4 ms 1880 KB Output is correct
24 Correct 3 ms 1880 KB Output is correct
25 Correct 55 ms 2260 KB Output is correct
26 Correct 47 ms 2128 KB Output is correct
27 Correct 3 ms 1880 KB Output is correct
28 Correct 73 ms 2304 KB Output is correct
29 Correct 66 ms 2160 KB Output is correct
30 Partially correct 84 ms 2128 KB Partially correct - number of queries: 5086
31 Correct 2 ms 1880 KB Output is correct
32 Correct 8 ms 2008 KB Output is correct
33 Correct 1 ms 1880 KB Output is correct
34 Correct 35 ms 2136 KB Output is correct
35 Correct 7 ms 1880 KB Output is correct
36 Correct 20 ms 2024 KB Output is correct
37 Correct 6 ms 1880 KB Output is correct
38 Correct 3 ms 1880 KB Output is correct
39 Correct 36 ms 2028 KB Output is correct
40 Correct 88 ms 2164 KB Output is correct
41 Correct 58 ms 2204 KB Output is correct
42 Correct 53 ms 2328 KB Output is correct
43 Correct 45 ms 2284 KB Output is correct
44 Correct 32 ms 1880 KB Output is correct
45 Correct 24 ms 1880 KB Output is correct
46 Correct 3 ms 1880 KB Output is correct
47 Correct 37 ms 2136 KB Output is correct
48 Correct 60 ms 2316 KB Output is correct
49 Correct 8 ms 1880 KB Output is correct
50 Partially correct 105 ms 2008 KB Partially correct - number of queries: 5121
51 Correct 33 ms 2144 KB Output is correct
52 Correct 4 ms 1880 KB Output is correct
53 Correct 6 ms 2008 KB Output is correct
54 Correct 49 ms 2040 KB Output is correct
55 Correct 4 ms 1880 KB Output is correct
56 Partially correct 81 ms 2272 KB Partially correct - number of queries: 5093
57 Correct 60 ms 2040 KB Output is correct
58 Correct 71 ms 2396 KB Output is correct
59 Correct 47 ms 2128 KB Output is correct
60 Correct 43 ms 1880 KB Output is correct
61 Correct 6 ms 1880 KB Output is correct
62 Correct 3 ms 1880 KB Output is correct
63 Correct 5 ms 1880 KB Output is correct
64 Correct 3 ms 1880 KB Output is correct
65 Correct 3 ms 1972 KB Output is correct
66 Correct 3 ms 1880 KB Output is correct
67 Correct 5 ms 1880 KB Output is correct
68 Correct 3 ms 2136 KB Output is correct
69 Correct 3 ms 1880 KB Output is correct
70 Correct 4 ms 1880 KB Output is correct
71 Partially correct 101 ms 2468 KB Partially correct - number of queries: 5259
72 Correct 11 ms 1880 KB Output is correct
73 Partially correct 106 ms 2212 KB Partially correct - number of queries: 5196
74 Partially correct 96 ms 2516 KB Partially correct - number of queries: 5223
75 Correct 7 ms 1880 KB Output is correct
76 Correct 86 ms 2848 KB Output is correct
77 Partially correct 92 ms 2128 KB Partially correct - number of queries: 5197
78 Correct 15 ms 2028 KB Output is correct
79 Correct 45 ms 2056 KB Output is correct
80 Partially correct 92 ms 2608 KB Partially correct - number of queries: 5218
81 Partially correct 94 ms 2128 KB Partially correct - number of queries: 5174
82 Partially correct 97 ms 2520 KB Partially correct - number of queries: 5160
83 Correct 5 ms 2136 KB Output is correct
84 Correct 70 ms 2272 KB Output is correct
85 Partially correct 102 ms 2384 KB Partially correct - number of queries: 5223
86 Correct 3 ms 1880 KB Output is correct
87 Correct 2 ms 1876 KB Output is correct
88 Correct 4 ms 1880 KB Output is correct
89 Correct 4 ms 2136 KB Output is correct
90 Correct 2 ms 1880 KB Output is correct
91 Correct 4 ms 1880 KB Output is correct
92 Correct 2 ms 1880 KB Output is correct
93 Correct 12 ms 1880 KB Output is correct
94 Correct 9 ms 1880 KB Output is correct
95 Correct 13 ms 2032 KB Output is correct
96 Correct 8 ms 1880 KB Output is correct
97 Correct 5 ms 1880 KB Output is correct