oj.uz

답안 #761683

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
761683 2023-06-20T07:13:30 Z minhcool 커다란 상품 (IOI17_prize) C++17
20 / 100
 52 ms 1952 KB 
//#define local
#ifndef local
#include "prize.h"
#endif
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
 
//#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair
 
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
 
const int N = 3e5 + 5;
 
const int oo = 1e18 + 7, mod = 1e9 + 7;
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
int rnd(int l, int r){
	int temp = rng() % (r - l + 1);
	return abs(temp) + l;
}
 
#ifdef local
 
int n, arr[N];
 
vector<int> ask(int x){
	vector<int> v;
	int num = 0;
	for(int i = x - 1; i >= 0; i--) num += (arr[i] < arr[x]);
	v.pb(num);
	num = 0;
	for(int i = x + 1; i < n; i++) num += (arr[i] < arr[x]);
	v.pb(num);
	return v;
}
#endif 
 
ii gett[N];
 
ii cal(int x){
	if(gett[x].fi || gett[x].se) return gett[x];
	vector<int> v = ask(x);
	return gett[x] = {v[0], v[1]};
}
 
int find_best(int n){
	if(n <= 1000){
	//	exit(0);
		for(int i = 0; i < n; i++){
			ii temp = cal(i);
		//	cout << temp.fi << " " << temp.se << "\n";
			if(!(temp.fi + temp.se)) return i;
		}
		exit(0);
	}
	int maxi = -oo;
	for(int itr = 1; itr <= 30; itr++){
		int pos = rnd(0, n - 1);
		ii temp = cal(pos);
		maxi = max(maxi, temp.fi + temp.se);
	}
	int lst = -1, num = 0;
	while(1){
		int le = lst + 1, ri = n - 1;
        assert(le < n && ri < n);
		num++;
		int troll = 0;
		while(le < ri){
			int mid = (le + ri) >> 1;
			if(!troll){
				mid = min(mid, le + 500);
				troll = 1;
			}
			assert(le < n && ri < n && mid < n);
			ii temp = cal(mid);
			if((temp.fi + temp.se) != maxi) ri = mid;
			else if(temp.fi >= num) ri = mid;
			else le = mid + 1;
		}
		ii temp = cal(le);
		if(!(temp.fi + temp.se)) return le;
		lst = le;
	}
	assert(0);
}
 
//#define local
#ifdef local
void process(){
	cin >> n;
	for(int i = 0; i < n; i++) cin >> arr[i];
	cout << find_best(n) << "\n";
}
 
signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	process();
}
#endif

Compilation message

prize.cpp:22:21: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   22 | const int oo = 1e18 + 7, mod = 1e9 + 7;
      |                ~~~~~^~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 444 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 1 ms 452 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 432 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 1 ms 428 KB Output is correct
9 Correct 1 ms 432 KB Output is correct
10 Correct 1 ms 436 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 432 KB Output is correct
2 Correct 1 ms 440 KB Output is correct
3 Correct 1 ms 440 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Correct 1 ms 444 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 432 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 456 KB Output is correct
10 Correct 1 ms 464 KB Output is correct
11 Correct 3 ms 816 KB Output is correct
12 Correct 1 ms 464 KB Output is correct
13 Correct 6 ms 1196 KB Output is correct
14 Correct 2 ms 336 KB Output is correct
15 Correct 3 ms 596 KB Output is correct
16 Correct 35 ms 1492 KB Output is correct
17 Correct 1 ms 308 KB Output is correct
18 Correct 42 ms 1792 KB Output is correct
19 Correct 1 ms 296 KB Output is correct
20 Correct 9 ms 560 KB Output is correct
21 Correct 14 ms 920 KB Output is correct
22 Correct 4 ms 812 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 2 ms 464 KB Output is correct
25 Correct 22 ms 1456 KB Output is correct
26 Correct 28 ms 1364 KB Output is correct
27 Correct 2 ms 420 KB Output is correct
28 Partially correct 35 ms 1816 KB Partially correct - number of queries: 5441
29 Correct 38 ms 1708 KB Output is correct
30 Correct 46 ms 1816 KB Output is correct
31 Correct 1 ms 432 KB Output is correct
32 Correct 3 ms 908 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Correct 15 ms 780 KB Output is correct
35 Correct 2 ms 720 KB Output is correct
36 Correct 7 ms 700 KB Output is correct
37 Correct 3 ms 580 KB Output is correct
38 Correct 1 ms 436 KB Output is correct
39 Correct 16 ms 980 KB Output is correct
40 Correct 40 ms 1768 KB Output is correct
41 Correct 10 ms 1164 KB Output is correct
42 Correct 22 ms 1124 KB Output is correct
43 Correct 22 ms 1092 KB Output is correct
44 Correct 15 ms 904 KB Output is correct
45 Correct 7 ms 1032 KB Output is correct
46 Correct 1 ms 432 KB Output is correct
47 Correct 16 ms 1192 KB Output is correct
48 Correct 24 ms 1384 KB Output is correct
49 Correct 5 ms 464 KB Output is correct
50 Correct 40 ms 1828 KB Output is correct
51 Correct 12 ms 944 KB Output is correct
52 Correct 1 ms 440 KB Output is correct
53 Correct 1 ms 576 KB Output is correct
54 Correct 7 ms 996 KB Output is correct
55 Correct 1 ms 336 KB Output is correct
56 Correct 50 ms 1780 KB Output is correct
57 Correct 17 ms 1368 KB Output is correct
58 Correct 13 ms 1360 KB Output is correct
59 Correct 14 ms 1188 KB Output is correct
60 Correct 21 ms 1140 KB Output is correct
61 Correct 3 ms 556 KB Output is correct
62 Correct 1 ms 440 KB Output is correct
63 Correct 1 ms 576 KB Output is correct
64 Correct 1 ms 452 KB Output is correct
65 Correct 2 ms 336 KB Output is correct
66 Correct 2 ms 424 KB Output is correct
67 Correct 1 ms 440 KB Output is correct
68 Correct 8 ms 336 KB Output is correct
69 Correct 4 ms 424 KB Output is correct
70 Correct 1 ms 436 KB Output is correct
71 Partially correct 35 ms 1848 KB Partially correct - number of queries: 5639
72 Correct 6 ms 1208 KB Output is correct
73 Partially correct 52 ms 1776 KB Partially correct - number of queries: 5725
74 Partially correct 22 ms 1952 KB Partially correct - number of queries: 5661
75 Correct 2 ms 592 KB Output is correct
76 Partially correct 46 ms 1780 KB Partially correct - number of queries: 5401
77 Partially correct 30 ms 1736 KB Partially correct - number of queries: 5708
78 Correct 3 ms 1208 KB Output is correct
79 Correct 29 ms 1820 KB Output is correct
80 Partially correct 21 ms 1824 KB Partially correct - number of queries: 5686
81 Partially correct 37 ms 1836 KB Partially correct - number of queries: 5615
82 Partially correct 38 ms 1740 KB Partially correct - number of queries: 5567
83 Correct 1 ms 572 KB Output is correct
84 Partially correct 48 ms 1756 KB Partially correct - number of queries: 5322
85 Partially correct 34 ms 1844 KB Partially correct - number of queries: 5688
86 Runtime error 11 ms 732 KB Execution killed with signal 6
87 Halted 0 ms 0 KB -