oj.uz

Submission #965750

# Submission time Handle Problem Language Result Execution time Memory
965750 2024-04-19T06:52:40 Z Nahian9696 The Big Prize (IOI17_prize) C++17
95.45 / 100
 37 ms 4904 KB 
#include "prize.h"
 
#include <bits/stdc++.h>
 
#define endl                                "\n"
#define yeap                                cout<<"YES"<<endl
#define nope                                cout<<"NO"<<endl
#define ll                                  long long
 
using namespace std;
 
const ll max_gems = 480;
bool gems[200005];
std::vector<pair<ll,ll>> response;
 
 
 
vector<int> askk(int i) {
    if(response[i] == make_pair(-1ll, -1ll)) {
        vector<int> res = ask(i);
        response[i] = make_pair(res[0], res[1]);
        return res;
    }
 
    vector<int> res;
 
    res.push_back(response[i].first);
    res.push_back(response[i].second);
	
 
	return res;
}
 
 
int find_best(int n) {
	ll mx = 0;
	ll mxind = 0;
 
    response.resize(n+5, {-1,-1});
	priority_queue<pair<ll,ll>, vector<pair<ll,ll>>, greater<pair<ll,ll>>> pq;

 
  
	for(int i=1; i<=max_gems; i++){
		std::vector<int> v = askk(i-1);
		ll a = v[0];
		ll b = v[1];
		ll c = a+b;
		if(c==0){
			return i-1;
		}
		if(c >= mx){
			mx = c;
			mxind = i-1;
		}
	}
 
 
    for(int i=1; i<=max_gems; i++){
		std::vector<int> v = askk(i-1);
		ll a = v[0];
		ll b = v[1];
		ll c = a+b;
		if(c==0){
			return (i-1);
		} else if(c == mx) {
				pq.push({a, i-1});
			}
		if(c != mx){
			gems[i-1] = true;
		}
	}
 
  ////////////////////////////////// Thik ache /////////////////////////////////
 
 
    
 
    int cur_lolipop = max_gems, left, right;
 
    while(true) {
		// cout << cur_lolipop << " " << 79 << endl;
        vector<int> v = askk(cur_lolipop);
		ll a = v[0];
		ll b = v[1];
		ll c = a+b;
		if(c==0){
			return cur_lolipop;
		} else if(c == mx) {
				pq.push({a, cur_lolipop});
			}
 
		if(c != mx){
			gems[cur_lolipop] = true;
            cur_lolipop++;
		} else {
            left = a, right = b;
            break;
        }
    }

	

 
 
    while(right != 0) {
 
		// cout << l << " " << r << endl;
 
        int l = cur_lolipop+1, r = -1;

		while(!pq.empty()) {
			int x = pq.top().first;
			if(x <= left) {
				pq.pop();
				continue;
			}
			r = pq.top().second;
			break;
		}

		if(r == -1) r = n-1;
 
		// cout << l << " " << r << endl;
 
        while(l < r) {
 
            int mid = (l+r)/2;
			// cout << mid << " " << 105 << endl;
            vector<int> v = askk(mid);
 
            ll a = v[0];
    		ll b = v[1];
    		ll c = a+b;
 
			// cout << c << endl;
 
			if(c==0){
				return mid;
			} else if(c == mx) {
				pq.push({a, mid});
			}
 
            if(c < left + right) {
                gems[mid] == true;
                r = mid;
            } else if(a == left) {
                l = mid+1;
                for(int i = l; i <= mid; i++) {
                    response[i] = {left, right};
                }
            } else {
                r = mid - 1;
            }
 
        }
 
		vector<int> v = askk(l);
 
            ll a = v[0];
    		ll b = v[1];
    		ll c = a+b;
 
			// cout << c << endl;
 
			if(c==0){
				return l;
			} else if(c == mx) {
				pq.push({a, l});
			}
 
 
        gems[l] = true;
        cur_lolipop = l+1;
 
 
		// if(cur_lolipop==n){
		// 	return cur_lolipop;
		// }
 
        while(true) {
			// cout << cur_lolipop << " " << 134 << endl;
            vector<int> v = askk(cur_lolipop);
    		ll a = v[0];
    		ll b = v[1];
    		ll c = a+b;
			if(c==0){
				return cur_lolipop;
			} else if(c == mx) {
				pq.push({a, cur_lolipop});
			}
    		if(c != mx){
    			gems[cur_lolipop] = true;
                cur_lolipop++;
    		} else {
                left = a, right = b;
                break;
            }
        }
      
    }
 
 
 
    
    
 
    
 
 
 
 
 
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:145:27: warning: statement has no effect [-Wunused-value]
  145 |                 gems[mid] == true;
      |                 ~~~~~~~~~~^~~~~~~
prize.cpp:37:5: warning: variable 'mxind' set but not used [-Wunused-but-set-variable]
   37 |  ll mxind = 0;
      |     ^~~~~
prize.cpp:40:73: warning: control reaches end of non-void function [-Wreturn-type]
   40 |  priority_queue<pair<ll,ll>, vector<pair<ll,ll>>, greater<pair<ll,ll>>> pq;
      |                                                                         ^~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3588 KB Output is correct
2 Correct 3 ms 3588 KB Output is correct
3 Correct 3 ms 3592 KB Output is correct
4 Correct 4 ms 3584 KB Output is correct
5 Correct 3 ms 3756 KB Output is correct
6 Correct 1 ms 3416 KB Output is correct
7 Correct 4 ms 3584 KB Output is correct
8 Correct 3 ms 3588 KB Output is correct
9 Correct 3 ms 3588 KB Output is correct
10 Correct 4 ms 3592 KB Output is correct

Subtask #2
75.45 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3588 KB Output is correct
2 Correct 3 ms 3592 KB Output is correct
3 Correct 3 ms 3580 KB Output is correct
4 Correct 3 ms 3592 KB Output is correct
5 Correct 4 ms 3844 KB Output is correct
6 Correct 2 ms 3616 KB Output is correct
7 Correct 3 ms 3588 KB Output is correct
8 Correct 3 ms 3584 KB Output is correct
9 Correct 3 ms 3844 KB Output is correct
10 Correct 4 ms 3592 KB Output is correct
11 Correct 4 ms 3868 KB Output is correct
12 Correct 3 ms 3588 KB Output is correct
13 Correct 5 ms 3868 KB Output is correct
14 Correct 3 ms 788 KB Output is correct
15 Correct 6 ms 3620 KB Output is correct
16 Correct 20 ms 4696 KB Output is correct
17 Correct 3 ms 3416 KB Output is correct
18 Partially correct 29 ms 4248 KB Partially correct - number of queries: 5452
19 Correct 3 ms 3416 KB Output is correct
20 Correct 8 ms 2312 KB Output is correct
21 Correct 9 ms 4568 KB Output is correct
22 Correct 5 ms 3844 KB Output is correct
23 Correct 3 ms 3596 KB Output is correct
24 Correct 3 ms 3596 KB Output is correct
25 Correct 14 ms 4412 KB Output is correct
26 Correct 12 ms 4120 KB Output is correct
27 Correct 4 ms 3612 KB Output is correct
28 Correct 24 ms 4200 KB Output is correct
29 Correct 19 ms 4404 KB Output is correct
30 Partially correct 30 ms 4392 KB Partially correct - number of queries: 5455
31 Correct 3 ms 3416 KB Output is correct
32 Correct 5 ms 3860 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 10 ms 4040 KB Output is correct
35 Correct 3 ms 3608 KB Output is correct
36 Correct 8 ms 3648 KB Output is correct
37 Correct 4 ms 3600 KB Output is correct
38 Correct 3 ms 3588 KB Output is correct
39 Correct 16 ms 3864 KB Output is correct
40 Correct 28 ms 3896 KB Output is correct
41 Correct 16 ms 4196 KB Output is correct
42 Correct 18 ms 4648 KB Output is correct
43 Correct 12 ms 4200 KB Output is correct
44 Correct 13 ms 3608 KB Output is correct
45 Correct 8 ms 4120 KB Output is correct
46 Correct 3 ms 3416 KB Output is correct
47 Correct 18 ms 4632 KB Output is correct
48 Correct 18 ms 4148 KB Output is correct
49 Correct 5 ms 3856 KB Output is correct
50 Partially correct 35 ms 4464 KB Partially correct - number of queries: 5444
51 Correct 12 ms 3864 KB Output is correct
52 Correct 4 ms 3592 KB Output is correct
53 Correct 4 ms 3608 KB Output is correct
54 Correct 11 ms 4424 KB Output is correct
55 Correct 3 ms 3416 KB Output is correct
56 Partially correct 32 ms 4192 KB Partially correct - number of queries: 5453
57 Correct 20 ms 3588 KB Output is correct
58 Correct 25 ms 4132 KB Output is correct
59 Correct 23 ms 3636 KB Output is correct
60 Correct 15 ms 4192 KB Output is correct
61 Correct 3 ms 3612 KB Output is correct
62 Correct 3 ms 3592 KB Output is correct
63 Correct 4 ms 3868 KB Output is correct
64 Correct 3 ms 3608 KB Output is correct
65 Correct 3 ms 3584 KB Output is correct
66 Correct 5 ms 3592 KB Output is correct
67 Correct 3 ms 3592 KB Output is correct
68 Correct 3 ms 3416 KB Output is correct
69 Correct 5 ms 3588 KB Output is correct
70 Correct 3 ms 3588 KB Output is correct
71 Partially correct 37 ms 4160 KB Partially correct - number of queries: 5336
72 Correct 5 ms 3964 KB Output is correct
73 Partially correct 29 ms 3876 KB Partially correct - number of queries: 5271
74 Partially correct 25 ms 4224 KB Partially correct - number of queries: 5282
75 Correct 3 ms 3852 KB Output is correct
76 Correct 20 ms 4504 KB Output is correct
77 Partially correct 23 ms 4396 KB Partially correct - number of queries: 5416
78 Correct 5 ms 3848 KB Output is correct
79 Correct 15 ms 4408 KB Output is correct
80 Partially correct 29 ms 4368 KB Partially correct - number of queries: 5420
81 Partially correct 25 ms 4732 KB Partially correct - number of queries: 5389
82 Partially correct 24 ms 4904 KB Partially correct - number of queries: 5352
83 Correct 4 ms 3588 KB Output is correct
84 Correct 20 ms 4400 KB Output is correct
85 Partially correct 31 ms 4360 KB Partially correct - number of queries: 5380
86 Correct 3 ms 3416 KB Output is correct
87 Correct 3 ms 3588 KB Output is correct
88 Correct 3 ms 3592 KB Output is correct
89 Correct 4 ms 3416 KB Output is correct
90 Correct 3 ms 3584 KB Output is correct
91 Correct 3 ms 3592 KB Output is correct
92 Correct 3 ms 3588 KB Output is correct
93 Correct 4 ms 3848 KB Output is correct
94 Correct 4 ms 3848 KB Output is correct
95 Correct 4 ms 3592 KB Output is correct
96 Correct 4 ms 3600 KB Output is correct
97 Correct 3 ms 3588 KB Output is correct