답안 #721445

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
721445 2023-04-11T01:40:46 Z minhcool 커다란 상품 (IOI17_prize) C++17
20 / 100
102 ms 336 KB
#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
 
#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;
 
int n;
 
mt19937_64 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;
}
 
vector<int> askk(int pos){
	return ask(pos - 1);
}
 
int find_best(int N){
	n = N;
	if(n <= 5000){
		for(int i = 1; i <= n; i++){
			vector<int> res = askk(i);
			if(res[0] == 0 && res[1] == 0) return i - 1;
		}
	}
	//cout << "OK\n";
	int mx = -1;
	for(int i = 1; i <= 5; i++){
		vector<int> v = askk(rnd(1, n));
		mx = max(mx, v[0] + v[1]);
	}
	int itr = 0, tot = 0;
	while(1){
		int l = itr + 1, r = n;
		while(l < r){
			int mid = (l + r) >> 1;
			vector<int> a = askk(mid);
			if(a[0] + a[1] != mx) r = mid;
			else if(a[0] > tot) r = mid;
			else l = mid + 1;
		}
		vector<int> v = askk(l);
		if(!(v[0] + v[1])) return l - 1;
		itr = l;
        tot++;
		/*
		assert(l != n);
		vector<int> v = ask(l + 1);
		assert(v[0] + v[1] != mx);
		if(!(v[0] + v[1])) return l + 1;
		int temp = l + 1;
		set<int> se;
		se.insert(mx);
		se.insert(v[0] + v[1]);*/
	}
}
 
 
/*
void process(){
 
}
 
signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t;
	cin >> t;
	while(t--) process();
}
*/

Compilation message

prize.cpp:16:21: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   16 | const int oo = 1e18 + 7, mod = 1e9 + 7;
      |                ~~~~~^~~
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 0 ms 292 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 1 ms 292 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 296 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 1 ms 292 KB Output is correct
5 Correct 1 ms 292 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 292 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 4 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 4 ms 208 KB Output is correct
14 Correct 4 ms 208 KB Output is correct
15 Correct 13 ms 208 KB Output is correct
16 Partially correct 70 ms 208 KB Partially correct - number of queries: 6959
17 Correct 1 ms 336 KB Output is correct
18 Partially correct 75 ms 296 KB Partially correct - number of queries: 8164
19 Correct 1 ms 284 KB Output is correct
20 Correct 9 ms 296 KB Output is correct
21 Correct 34 ms 208 KB Output is correct
22 Correct 4 ms 272 KB Output is correct
23 Correct 1 ms 208 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 37 ms 208 KB Output is correct
26 Correct 18 ms 272 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Partially correct 39 ms 332 KB Partially correct - number of queries: 7780
29 Partially correct 55 ms 272 KB Partially correct - number of queries: 5882
30 Partially correct 89 ms 208 KB Partially correct - number of queries: 8076
31 Correct 1 ms 208 KB Output is correct
32 Correct 2 ms 276 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 21 ms 208 KB Output is correct
35 Correct 2 ms 208 KB Output is correct
36 Correct 14 ms 288 KB Output is correct
37 Correct 1 ms 208 KB Output is correct
38 Correct 1 ms 272 KB Output is correct
39 Correct 29 ms 208 KB Output is correct
40 Partially correct 27 ms 272 KB Partially correct - number of queries: 6905
41 Correct 33 ms 208 KB Output is correct
42 Correct 40 ms 208 KB Output is correct
43 Correct 33 ms 276 KB Output is correct
44 Correct 28 ms 208 KB Output is correct
45 Correct 27 ms 276 KB Output is correct
46 Correct 1 ms 276 KB Output is correct
47 Correct 40 ms 300 KB Output is correct
48 Partially correct 47 ms 208 KB Partially correct - number of queries: 6034
49 Correct 7 ms 208 KB Output is correct
50 Partially correct 77 ms 208 KB Partially correct - number of queries: 8159
51 Correct 37 ms 208 KB Output is correct
52 Correct 2 ms 296 KB Output is correct
53 Correct 2 ms 208 KB Output is correct
54 Correct 19 ms 280 KB Output is correct
55 Correct 1 ms 300 KB Output is correct
56 Partially correct 61 ms 208 KB Partially correct - number of queries: 8146
57 Partially correct 62 ms 296 KB Partially correct - number of queries: 5945
58 Partially correct 63 ms 208 KB Partially correct - number of queries: 6059
59 Correct 26 ms 208 KB Output is correct
60 Correct 43 ms 208 KB Output is correct
61 Correct 2 ms 208 KB Output is correct
62 Correct 1 ms 208 KB Output is correct
63 Correct 2 ms 208 KB Output is correct
64 Correct 1 ms 208 KB Output is correct
65 Correct 5 ms 276 KB Output is correct
66 Correct 23 ms 208 KB Output is correct
67 Correct 1 ms 292 KB Output is correct
68 Partially correct 78 ms 208 KB Partially correct - number of queries: 8498
69 Correct 16 ms 308 KB Output is correct
70 Correct 2 ms 208 KB Output is correct
71 Partially correct 75 ms 208 KB Partially correct - number of queries: 8352
72 Correct 5 ms 208 KB Output is correct
73 Partially correct 66 ms 296 KB Partially correct - number of queries: 8224
74 Partially correct 68 ms 208 KB Partially correct - number of queries: 8271
75 Correct 2 ms 208 KB Output is correct
76 Partially correct 68 ms 208 KB Partially correct - number of queries: 7064
77 Partially correct 34 ms 296 KB Partially correct - number of queries: 8210
78 Correct 5 ms 208 KB Output is correct
79 Correct 22 ms 208 KB Output is correct
80 Partially correct 81 ms 292 KB Partially correct - number of queries: 8206
81 Partially correct 33 ms 208 KB Partially correct - number of queries: 8197
82 Partially correct 81 ms 208 KB Partially correct - number of queries: 8152
83 Correct 2 ms 208 KB Output is correct
84 Partially correct 52 ms 208 KB Partially correct - number of queries: 6673
85 Partially correct 69 ms 208 KB Partially correct - number of queries: 8221
86 Partially correct 50 ms 208 KB Partially correct - number of queries: 7716
87 Incorrect 102 ms 208 KB Incorrect
88 Halted 0 ms 0 KB -