oj.uz

답안 #731869

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
731869 2023-04-28T06:13:08 Z sentheta 커다란 상품 (IOI17_prize) C++17
100 / 100
 54 ms 5256 KB 
#include "prize.h"
// author : sentheta aka vanwij
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<cassert>
#include<random>
#include<chrono>
#include<cmath>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;

#define Int long long
#define V vector
#define pii pair<int,int>
#define ff first
#define ss second

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

#define pow2(x) (1LL<<(x))
#define msb(x) (63-__builtin_clzll(x))
#define bitcnt(x) (__builtin_popcountll(x))

#define nl '\n'
#define _ << ' ' <<
#define all(x) (x).begin(), (x).end()
#define rep(i,a,b) for(int i = (int)(a); i < (int)(b); i++)
#define dbg(x) if(1) cout << "?" << #x << " : " << (x) << endl << flush;


const int N = 2e5+5;
V<int> memo[N];
pii query(int i){
	if(memo[i].empty()) memo[i] = ask(i);
	return {memo[i][0], memo[i][1]};
}

int n;

#define mid (tl+tr)/2
#define lc (v+1)
#define rc (v+2*(mid-tl+1))
struct Segtree{
	int cnt[2*N];
	void upd(int i,int v=0,int tl=0,int tr=n-1){
		if(tl==tr){
			cnt[v] = 1; return;
		}
		if(i<=mid) upd(i, lc,tl,mid);
		else upd(i, rc,mid+1,tr);
		cnt[v] = cnt[lc] + cnt[rc];
	}
	int qry(int l,int r,int v=0,int tl=0,int tr=n-1){
		if(r<tl || tr<l) return 0;
		if(l<=tl && tr<=r) return cnt[v];
		return qry(l,r, lc,tl,mid) + qry(l,r, rc,mid+1,tr);
	}
} segtree;
#undef mid



int mx = 0;
int dnc(int lout=0,int rout=0,int l=0,int r=n-1){
	if(l > r) return -1;
	if(lout+rout+segtree.qry(l,r) == mx){
		// assert(0);
		return -1;
	}

	int midcnt = 0;
	for(int m=(l+r)/2; m<=r; m++){
		auto[lcnt,rcnt] = query(m);
		if(lcnt+rcnt==0) return m;
		if(lcnt+rcnt < mx){
			midcnt++; continue;
		}

		if(lcnt > lout+midcnt){
			int i = dnc(lout,midcnt+rcnt, l,(l+r)/2-1);
			if(i!=-1) return i;
		}
		if(rcnt > rout){
			int i = dnc(lcnt,rout, m+1,r);
			if(i!=-1) return i;
		}
		return -1;
	}

	for(int m=(l+r)/2-1; m>=l; m--){
		auto[lcnt,rcnt] = query(m);
		if(lcnt+rcnt==0) return m;
		if(lcnt+rcnt < mx){
			midcnt++; continue;
		}
		// assert(rcnt == midcnt + rout);

		if(lcnt > lout){
			int i = dnc(lout,rcnt, l,m-1);
			if(i!=-1) return i;
		}
		return -1;
	}

	return -1;
}


int find_best(int _n){
	n = _n;

	V<int> ord;
	for(int i=0; i<min(n,237); i++){
		ord.push_back(i);
	}
	for(int i=n-1; i>=max(n-237,0); i--){
		ord.push_back(i);
	}
	rep(i,0,ord.size()){
		swap(ord[i], ord[rng()%(i+1)]);
	}


	map<int,V<int>> mp;
	for(int j=0; j<ord.size(); j++){
		int i = ord[j];
	// for(int i=max(0,n/2-240); i<=min(n-1,n/2+240); i++){
	// rep(i,0,474){
		auto[lcnt,rcnt] = query(i);
		if(lcnt+rcnt==0) return i;

		mp[lcnt+rcnt].push_back(i);
		mx = max(mx, lcnt+rcnt);
		if(mp.size()==4) break;
		if(lcnt+rcnt>300) break;
	}
	assert((int)mp.size()<=4);

	for(auto&[x,v] : mp){
		if(x==mx){

		}
		else{
			for(int i : v){
				segtree.upd(i);
			}
		}
	}

	int ans = dnc();
	return ans;
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:132:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  132 |  for(int j=0; j<ord.size(); j++){
      |               ~^~~~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 5116 KB Output is correct
2 Correct 6 ms 4944 KB Output is correct
3 Correct 8 ms 4996 KB Output is correct
4 Correct 8 ms 4944 KB Output is correct
5 Correct 7 ms 4944 KB Output is correct
6 Correct 7 ms 4944 KB Output is correct
7 Correct 9 ms 4944 KB Output is correct
8 Correct 5 ms 5020 KB Output is correct
9 Correct 5 ms 4996 KB Output is correct
10 Correct 7 ms 5020 KB Output is correct
11 Correct 11 ms 4992 KB Output is correct
12 Correct 7 ms 4944 KB Output is correct
13 Correct 12 ms 4996 KB Output is correct
14 Correct 11 ms 4944 KB Output is correct
15 Correct 10 ms 4988 KB Output is correct
16 Correct 41 ms 5064 KB Output is correct
17 Correct 3 ms 4944 KB Output is correct
18 Correct 54 ms 5000 KB Output is correct
19 Correct 3 ms 4944 KB Output is correct
20 Correct 8 ms 5020 KB Output is correct
21 Correct 18 ms 5000 KB Output is correct
22 Correct 5 ms 5004 KB Output is correct
23 Correct 8 ms 5000 KB Output is correct
24 Correct 5 ms 4944 KB Output is correct
25 Correct 22 ms 4992 KB Output is correct
26 Correct 26 ms 5108 KB Output is correct
27 Correct 11 ms 5116 KB Output is correct
28 Correct 41 ms 4988 KB Output is correct
29 Correct 35 ms 5076 KB Output is correct
30 Correct 46 ms 5116 KB Output is correct
31 Correct 3 ms 4944 KB Output is correct
32 Correct 11 ms 4944 KB Output is correct
33 Correct 3 ms 4944 KB Output is correct
34 Correct 14 ms 4996 KB Output is correct
35 Correct 8 ms 4944 KB Output is correct
36 Correct 14 ms 5008 KB Output is correct
37 Correct 9 ms 4996 KB Output is correct
38 Correct 8 ms 5120 KB Output is correct
39 Correct 19 ms 5008 KB Output is correct
40 Correct 34 ms 4996 KB Output is correct
41 Correct 25 ms 5028 KB Output is correct
42 Correct 26 ms 5000 KB Output is correct
43 Correct 23 ms 4996 KB Output is correct
44 Correct 14 ms 4944 KB Output is correct
45 Correct 24 ms 4944 KB Output is correct
46 Correct 4 ms 4944 KB Output is correct
47 Correct 11 ms 5036 KB Output is correct
48 Correct 38 ms 5028 KB Output is correct
49 Correct 6 ms 4988 KB Output is correct
50 Correct 46 ms 5124 KB Output is correct
51 Correct 18 ms 4972 KB Output is correct
52 Correct 6 ms 4944 KB Output is correct
53 Correct 10 ms 4980 KB Output is correct
54 Correct 14 ms 5256 KB Output is correct
55 Correct 3 ms 4944 KB Output is correct
56 Correct 40 ms 5084 KB Output is correct
57 Correct 20 ms 5076 KB Output is correct
58 Correct 45 ms 5064 KB Output is correct
59 Correct 31 ms 5016 KB Output is correct
60 Correct 27 ms 5024 KB Output is correct
61 Correct 10 ms 4996 KB Output is correct
62 Correct 5 ms 5008 KB Output is correct
63 Correct 6 ms 5020 KB Output is correct
64 Correct 6 ms 4988 KB Output is correct
65 Correct 5 ms 4996 KB Output is correct
66 Correct 7 ms 4992 KB Output is correct
67 Correct 5 ms 5012 KB Output is correct
68 Correct 5 ms 4996 KB Output is correct
69 Correct 6 ms 4944 KB Output is correct
70 Correct 9 ms 4996 KB Output is correct
71 Correct 46 ms 5168 KB Output is correct
72 Correct 13 ms 4944 KB Output is correct
73 Correct 48 ms 5048 KB Output is correct
74 Correct 51 ms 5204 KB Output is correct
75 Correct 9 ms 5008 KB Output is correct
76 Correct 31 ms 5172 KB Output is correct
77 Correct 52 ms 5064 KB Output is correct
78 Correct 13 ms 5024 KB Output is correct
79 Correct 28 ms 5000 KB Output is correct
80 Correct 42 ms 5012 KB Output is correct
81 Correct 52 ms 5072 KB Output is correct
82 Correct 44 ms 5192 KB Output is correct
83 Correct 9 ms 4996 KB Output is correct
84 Correct 31 ms 5024 KB Output is correct
85 Correct 51 ms 5028 KB Output is correct
86 Correct 8 ms 4944 KB Output is correct
87 Correct 11 ms 4992 KB Output is correct
88 Correct 7 ms 4944 KB Output is correct
89 Correct 6 ms 4996 KB Output is correct
90 Correct 8 ms 4944 KB Output is correct
91 Correct 10 ms 5064 KB Output is correct
92 Correct 7 ms 4944 KB Output is correct
93 Correct 10 ms 4944 KB Output is correct
94 Correct 6 ms 5060 KB Output is correct
95 Correct 12 ms 5016 KB Output is correct
96 Correct 8 ms 4944 KB Output is correct
97 Correct 7 ms 5020 KB Output is correct