제출 #965928

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
965928		Nahian9696	커다란 상품 (IOI17_prize)	C++17	100 / 100	28 ms	4932 KiB

prize

#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;
 
    response.resize(n+5, {-1,-1});
	priority_queue<pair<ll,ll>, vector<pair<ll,ll>>, greater<pair<ll,ll>>> pq;

	// queue<int> lolipops;


	{
		vector<int> v = askk(0);
		ll a = v[0];
		ll b = v[1];
		mx = a+b;
		if(mx == 0) return 0;
		// lolipops.push(0);
	}

	

 
    max_updated:
    int cur_lolipop = 0, left, right;
	while(!pq.empty()) pq.pop();
 


    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});
			} else if(mx < c) {
				mx = c;
				goto max_updated;
			}
 
		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});
			} else if(mx < c) {
				mx = c;
				goto max_updated;
			}
 
            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});
			} else if(mx < c) {
				mx = c;
				goto max_updated;
			}
 
 
        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});
			} else if(mx < c) {
				mx = c;
				goto max_updated;
			}
    		if(c != mx){
    			gems[cur_lolipop] = true;
                cur_lolipop++;
    		} else {
                left = a, right = b;
                break;
            }
        }
      
    }
 
 
 
    
    
 
    
 
 
 
 
 
}

컴파일 시 표준 에러 (stderr) 메시지

prize.cpp: In function 'int find_best(int)':
prize.cpp:132:27: warning: statement has no effect [-Wunused-value]
  132 |                 gems[mid] == true;
      |                 ~~~~~~~~~~^~~~~~~
prize.cpp:39:73: warning: control reaches end of non-void function [-Wreturn-type]
   39 |  priority_queue<pair<ll,ll>, vector<pair<ll,ll>>, greater<pair<ll,ll>>> pq;
      |                                                                         ^~

• Subtask 1: 20 / 20
• Subtask 2: 80 / 80