oj.uz

답안 #1048444

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1048444 2024-08-08T07:39:35 Z pcc 커다란 상품 (IOI17_prize) C++17
97.61 / 100
 109 ms 2624 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 = 480;
#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) {
	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 3 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 4 ms 1880 KB Output is correct
6 Correct 3 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 5 ms 1880 KB Output is correct

Subtask #2
77.61 / 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 1876 KB Output is correct
4 Correct 3 ms 1880 KB Output is correct
5 Correct 4 ms 1880 KB Output is correct
6 Correct 2 ms 1880 KB Output is correct
7 Correct 3 ms 1880 KB Output is correct
8 Correct 3 ms 1880 KB Output is correct
9 Correct 4 ms 2132 KB Output is correct
10 Correct 3 ms 1880 KB Output is correct
11 Correct 6 ms 1880 KB Output is correct
12 Correct 3 ms 1880 KB Output is correct
13 Correct 16 ms 1880 KB Output is correct
14 Correct 6 ms 2136 KB Output is correct
15 Correct 20 ms 1880 KB Output is correct
16 Correct 82 ms 2156 KB Output is correct
17 Correct 5 ms 1880 KB Output is correct
18 Partially correct 98 ms 2056 KB Partially correct - number of queries: 5093
19 Correct 4 ms 1880 KB Output is correct
20 Correct 21 ms 2008 KB Output is correct
21 Correct 32 ms 2136 KB Output is correct
22 Correct 12 ms 1880 KB Output is correct
23 Correct 2 ms 1880 KB Output is correct
24 Correct 3 ms 1880 KB Output is correct
25 Correct 39 ms 2012 KB Output is correct
26 Correct 43 ms 2136 KB Output is correct
27 Correct 3 ms 1880 KB Output is correct
28 Correct 74 ms 2008 KB Output is correct
29 Correct 84 ms 2136 KB Output is correct
30 Partially correct 92 ms 2496 KB Partially correct - number of queries: 5067
31 Correct 3 ms 1880 KB Output is correct
32 Correct 8 ms 2004 KB Output is correct
33 Correct 1 ms 1880 KB Output is correct
34 Correct 31 ms 2268 KB Output is correct
35 Correct 7 ms 2136 KB Output is correct
36 Correct 19 ms 2136 KB Output is correct
37 Correct 6 ms 1964 KB Output is correct
38 Correct 3 ms 1880 KB Output is correct
39 Correct 38 ms 2128 KB Output is correct
40 Correct 85 ms 2128 KB Output is correct
41 Correct 46 ms 2128 KB Output is correct
42 Correct 48 ms 2136 KB Output is correct
43 Correct 47 ms 1880 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 34 ms 1880 KB Output is correct
48 Correct 68 ms 2128 KB Output is correct
49 Correct 8 ms 2008 KB Output is correct
50 Partially correct 96 ms 2484 KB Partially correct - number of queries: 5102
51 Correct 32 ms 1880 KB Output is correct
52 Correct 3 ms 1880 KB Output is correct
53 Correct 5 ms 2008 KB Output is correct
54 Correct 35 ms 1880 KB Output is correct
55 Correct 3 ms 1880 KB Output is correct
56 Partially correct 83 ms 2044 KB Partially correct - number of queries: 5074
57 Correct 58 ms 2128 KB Output is correct
58 Correct 72 ms 2624 KB Output is correct
59 Correct 58 ms 2136 KB Output is correct
60 Correct 50 ms 2128 KB Output is correct
61 Correct 6 ms 1880 KB Output is correct
62 Correct 3 ms 1876 KB Output is correct
63 Correct 6 ms 2136 KB Output is correct
64 Correct 5 ms 1972 KB Output is correct
65 Correct 3 ms 1880 KB Output is correct
66 Correct 3 ms 1968 KB Output is correct
67 Correct 5 ms 1880 KB Output is correct
68 Correct 4 ms 1880 KB Output is correct
69 Correct 3 ms 1972 KB Output is correct
70 Correct 3 ms 1880 KB Output is correct
71 Partially correct 92 ms 2344 KB Partially correct - number of queries: 5239
72 Correct 18 ms 2136 KB Output is correct
73 Partially correct 101 ms 2324 KB Partially correct - number of queries: 5176
74 Partially correct 106 ms 2048 KB Partially correct - number of queries: 5203
75 Correct 5 ms 1880 KB Output is correct
76 Correct 84 ms 2296 KB Output is correct
77 Partially correct 86 ms 2324 KB Partially correct - number of queries: 5196
78 Correct 16 ms 1880 KB Output is correct
79 Correct 42 ms 1880 KB Output is correct
80 Partially correct 109 ms 2584 KB Partially correct - number of queries: 5184
81 Partially correct 93 ms 2340 KB Partially correct - number of queries: 5194
82 Partially correct 85 ms 2292 KB Partially correct - number of queries: 5158
83 Correct 5 ms 1880 KB Output is correct
84 Correct 72 ms 2164 KB Output is correct
85 Partially correct 88 ms 2128 KB Partially correct - number of queries: 5217
86 Correct 3 ms 1880 KB Output is correct
87 Correct 3 ms 1880 KB Output is correct
88 Correct 4 ms 1880 KB Output is correct
89 Correct 3 ms 1880 KB Output is correct
90 Correct 3 ms 1880 KB Output is correct
91 Correct 3 ms 1880 KB Output is correct
92 Correct 3 ms 1880 KB Output is correct
93 Correct 10 ms 2132 KB Output is correct
94 Correct 8 ms 1880 KB Output is correct
95 Correct 8 ms 1880 KB Output is correct
96 Correct 8 ms 1880 KB Output is correct
97 Correct 3 ms 1880 KB Output is correct