oj.uz

Submission #761707

# Submission time Handle Problem Language Result Execution time Memory
761707 2023-06-20T07:23:29 Z minhcool The Big Prize (IOI17_prize) C++17
20 / 100
 51 ms 1840 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;
		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){
                if(!(temp.fi + temp.se)) return mid;
            	ri = mid;
            }
			else if(temp.fi >= num) ri = mid;
			else le = mid + 1;
		}
		ii temp = cal(le);
		if(!(temp.fi + temp.se)) return le;
        if(le == (n - 1)) 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 424 KB Output is correct
2 Correct 1 ms 440 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 1 ms 444 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 1 ms 448 KB Output is correct
9 Correct 1 ms 436 KB Output is correct
10 Correct 1 ms 464 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 436 KB Output is correct
2 Correct 1 ms 428 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 472 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 440 KB Output is correct
8 Correct 1 ms 444 KB Output is correct
9 Correct 1 ms 444 KB Output is correct
10 Correct 1 ms 464 KB Output is correct
11 Correct 2 ms 800 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 7 ms 1164 KB Output is correct
14 Correct 3 ms 320 KB Output is correct
15 Correct 5 ms 588 KB Output is correct
16 Correct 31 ms 1656 KB Output is correct
17 Correct 1 ms 312 KB Output is correct
18 Correct 45 ms 1736 KB Output is correct
19 Correct 1 ms 436 KB Output is correct
20 Correct 6 ms 576 KB Output is correct
21 Correct 11 ms 840 KB Output is correct
22 Correct 4 ms 836 KB Output is correct
23 Correct 1 ms 444 KB Output is correct
24 Correct 1 ms 412 KB Output is correct
25 Correct 20 ms 1444 KB Output is correct
26 Correct 20 ms 1352 KB Output is correct
27 Correct 1 ms 436 KB Output is correct
28 Partially correct 38 ms 1788 KB Partially correct - number of queries: 5440
29 Correct 35 ms 1640 KB Output is correct
30 Correct 39 ms 1788 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 4 ms 1004 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 14 ms 808 KB Output is correct
35 Correct 1 ms 700 KB Output is correct
36 Correct 10 ms 720 KB Output is correct
37 Correct 2 ms 592 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 14 ms 964 KB Output is correct
40 Correct 16 ms 1816 KB Output is correct
41 Correct 12 ms 1160 KB Output is correct
42 Correct 20 ms 1124 KB Output is correct
43 Correct 21 ms 1096 KB Output is correct
44 Correct 7 ms 880 KB Output is correct
45 Correct 17 ms 1060 KB Output is correct
46 Correct 1 ms 316 KB Output is correct
47 Correct 24 ms 1216 KB Output is correct
48 Correct 28 ms 1372 KB Output is correct
49 Correct 2 ms 496 KB Output is correct
50 Correct 18 ms 1792 KB Output is correct
51 Correct 16 ms 840 KB Output is correct
52 Correct 1 ms 432 KB Output is correct
53 Correct 3 ms 592 KB Output is correct
54 Correct 18 ms 932 KB Output is correct
55 Correct 1 ms 296 KB Output is correct
56 Correct 18 ms 1784 KB Output is correct
57 Correct 15 ms 1360 KB Output is correct
58 Correct 22 ms 1328 KB Output is correct
59 Correct 25 ms 1136 KB Output is correct
60 Correct 11 ms 1124 KB Output is correct
61 Correct 2 ms 508 KB Output is correct
62 Correct 1 ms 336 KB Output is correct
63 Correct 2 ms 556 KB Output is correct
64 Correct 2 ms 560 KB Output is correct
65 Correct 2 ms 436 KB Output is correct
66 Correct 4 ms 428 KB Output is correct
67 Correct 1 ms 432 KB Output is correct
68 Correct 5 ms 432 KB Output is correct
69 Correct 4 ms 432 KB Output is correct
70 Correct 1 ms 336 KB Output is correct
71 Partially correct 51 ms 1836 KB Partially correct - number of queries: 5750
72 Correct 6 ms 1204 KB Output is correct
73 Partially correct 38 ms 1840 KB Partially correct - number of queries: 5671
74 Partially correct 49 ms 1736 KB Partially correct - number of queries: 5730
75 Correct 2 ms 592 KB Output is correct
76 Partially correct 34 ms 1732 KB Partially correct - number of queries: 5407
77 Partially correct 41 ms 1836 KB Partially correct - number of queries: 5643
78 Correct 7 ms 1232 KB Output is correct
79 Correct 29 ms 1724 KB Output is correct
80 Partially correct 50 ms 1732 KB Partially correct - number of queries: 5555
81 Partially correct 36 ms 1804 KB Partially correct - number of queries: 5781
82 Partially correct 46 ms 1804 KB Partially correct - number of queries: 5639
83 Correct 2 ms 640 KB Output is correct
84 Partially correct 40 ms 1788 KB Partially correct - number of queries: 5276
85 Partially correct 50 ms 1808 KB Partially correct - number of queries: 5701
86 Incorrect 10 ms 472 KB answer is not correct
87 Halted 0 ms 0 KB -