oj.uz

답안 #761717

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
761717 2023-06-20T07:40:12 Z minhcool 커다란 상품 (IOI17_prize) C++17
90 / 100
 59 ms 1872 KB 
#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 <= 500; 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);
            assert((temp.fi + temp.se) <= maxi);
			if((temp.fi + temp.se) != maxi) ri = mid;
			else if(temp.fi >= num) ri = mid;
			else le = mid + 1;
		}
		ii temp = cal(le);
        assert((temp.fi + temp.se) <= maxi);
		if(!(temp.fi + temp.se)) return le;
		lst = le;
	}
	assert(0);
}
 
/*
200000 5
1 2 5 26 199966
*/
 
//#define local
#ifdef local
void process(){
	int m;
	cin >> n >> m;
	int sum = 0;
	for(int i = 1; i <= m; i++){
		int x;
		cin >> x;
		for(int j = sum; j <= sum + x - 1; j++) arr[j] = i;
		sum += x;
	}
	reverse(arr, arr + n);
	//shuffle(arr + 1, arr + n + 1, default_random_engine(rnd(1, 7405)));
	cout << find_best(n) << "\n";
}
 
signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	process();
}
#endif

Compilation message

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

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1324 KB Output is correct
2 Correct 4 ms 1360 KB Output is correct
3 Correct 5 ms 1416 KB Output is correct
4 Correct 7 ms 1360 KB Output is correct
5 Correct 6 ms 1420 KB Output is correct
6 Correct 5 ms 1360 KB Output is correct
7 Correct 3 ms 1356 KB Output is correct
8 Correct 3 ms 1360 KB Output is correct
9 Correct 3 ms 1344 KB Output is correct
10 Correct 5 ms 1380 KB Output is correct

Subtask #2
70.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1352 KB Output is correct
2 Correct 3 ms 1312 KB Output is correct
3 Correct 5 ms 1384 KB Output is correct
4 Correct 6 ms 1328 KB Output is correct
5 Correct 4 ms 1360 KB Output is correct
6 Correct 6 ms 1364 KB Output is correct
7 Correct 3 ms 1416 KB Output is correct
8 Correct 6 ms 1464 KB Output is correct
9 Correct 3 ms 1336 KB Output is correct
10 Correct 6 ms 1360 KB Output is correct
11 Correct 4 ms 1424 KB Output is correct
12 Correct 5 ms 1420 KB Output is correct
13 Correct 6 ms 1656 KB Output is correct
14 Correct 4 ms 452 KB Output is correct
15 Correct 5 ms 1456 KB Output is correct
16 Correct 49 ms 1680 KB Output is correct
17 Correct 4 ms 1332 KB Output is correct
18 Partially correct 34 ms 1872 KB Partially correct - number of queries: 5209
19 Correct 7 ms 1316 KB Output is correct
20 Correct 13 ms 1028 KB Output is correct
21 Correct 9 ms 1604 KB Output is correct
22 Correct 11 ms 1492 KB Output is correct
23 Correct 4 ms 1360 KB Output is correct
24 Correct 6 ms 1404 KB Output is correct
25 Correct 23 ms 1652 KB Output is correct
26 Correct 30 ms 1664 KB Output is correct
27 Correct 6 ms 1360 KB Output is correct
28 Partially correct 33 ms 1840 KB Partially correct - number of queries: 5897
29 Correct 27 ms 1864 KB Output is correct
30 Partially correct 32 ms 1788 KB Partially correct - number of queries: 5167
31 Correct 3 ms 1328 KB Output is correct
32 Correct 10 ms 1572 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 18 ms 1556 KB Output is correct
35 Correct 4 ms 1396 KB Output is correct
36 Correct 12 ms 1464 KB Output is correct
37 Correct 5 ms 1424 KB Output is correct
38 Correct 5 ms 1376 KB Output is correct
39 Correct 22 ms 1560 KB Output is correct
40 Correct 21 ms 1812 KB Output is correct
41 Correct 19 ms 1608 KB Output is correct
42 Correct 23 ms 1580 KB Output is correct
43 Correct 11 ms 1664 KB Output is correct
44 Correct 21 ms 1520 KB Output is correct
45 Correct 10 ms 1612 KB Output is correct
46 Correct 5 ms 1360 KB Output is correct
47 Correct 33 ms 1616 KB Output is correct
48 Correct 14 ms 1708 KB Output is correct
49 Correct 4 ms 1428 KB Output is correct
50 Partially correct 30 ms 1740 KB Partially correct - number of queries: 5212
51 Correct 10 ms 1636 KB Output is correct
52 Correct 6 ms 1360 KB Output is correct
53 Correct 6 ms 1352 KB Output is correct
54 Correct 24 ms 1596 KB Output is correct
55 Correct 5 ms 1312 KB Output is correct
56 Partially correct 32 ms 1796 KB Partially correct - number of queries: 5207
57 Correct 16 ms 1824 KB Output is correct
58 Correct 18 ms 1716 KB Output is correct
59 Correct 13 ms 1636 KB Output is correct
60 Correct 24 ms 1588 KB Output is correct
61 Correct 6 ms 1368 KB Output is correct
62 Correct 3 ms 1332 KB Output is correct
63 Correct 7 ms 1316 KB Output is correct
64 Correct 6 ms 1344 KB Output is correct
65 Correct 7 ms 1360 KB Output is correct
66 Correct 5 ms 1364 KB Output is correct
67 Correct 4 ms 1384 KB Output is correct
68 Correct 14 ms 1488 KB Output is correct
69 Correct 9 ms 1360 KB Output is correct
70 Correct 6 ms 1428 KB Output is correct
71 Partially correct 56 ms 1736 KB Partially correct - number of queries: 6279
72 Correct 10 ms 1616 KB Output is correct
73 Partially correct 59 ms 1744 KB Partially correct - number of queries: 6270
74 Partially correct 40 ms 1780 KB Partially correct - number of queries: 6203
75 Correct 7 ms 1480 KB Output is correct
76 Partially correct 29 ms 1852 KB Partially correct - number of queries: 5960
77 Partially correct 37 ms 1756 KB Partially correct - number of queries: 6145
78 Correct 11 ms 1652 KB Output is correct
79 Correct 34 ms 1736 KB Output is correct
80 Partially correct 55 ms 1772 KB Partially correct - number of queries: 6289
81 Partially correct 40 ms 1780 KB Partially correct - number of queries: 6213
82 Partially correct 42 ms 1832 KB Partially correct - number of queries: 6244
83 Correct 7 ms 1484 KB Output is correct
84 Partially correct 50 ms 1820 KB Partially correct - number of queries: 5730
85 Partially correct 30 ms 1768 KB Partially correct - number of queries: 6224
86 Partially correct 45 ms 1824 KB Partially correct - number of queries: 5297
87 Correct 6 ms 1488 KB Output is correct
88 Correct 18 ms 1756 KB Output is correct
89 Correct 40 ms 1744 KB Output is correct
90 Correct 8 ms 1488 KB Output is correct
91 Correct 24 ms 1680 KB Output is correct
92 Correct 43 ms 1704 KB Output is correct
93 Partially correct 34 ms 1728 KB Partially correct - number of queries: 5479
94 Partially correct 40 ms 1844 KB Partially correct - number of queries: 5711
95 Partially correct 49 ms 1736 KB Partially correct - number of queries: 5832
96 Partially correct 41 ms 1716 KB Partially correct - number of queries: 5720
97 Partially correct 32 ms 1724 KB Partially correct - number of queries: 5190