Submission #247373

#	Time	Username	Problem	Language	Result	Execution time	Memory
247373		hhh07	커다란 상품 (IOI17_prize)	C++14	100 / 100	62 ms	5436 KiB

prize

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <utility>
#include <set>
#include <cmath>
#include <cstring>
#include "prize.h"
 
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef pair<ll, ll> ii;

vi mem[(int)2e5 + 1];
bool done[(int)2e5 + 1];

vi pitaj(int idx){
    if (done[idx])
        return mem[idx];
    done[idx] = true;
    return mem[idx] = ask(idx);
}

int bin_search(int lijevo, int beg, int end, int maxi){
    if (beg > end)
        return -1;
    int l = beg, r = end;
    vi t;
    while(l < r){
        int mid = (l + r)/2;
        t = pitaj(mid);
        if (t[0] + t[1] == 0)
            return mid;
        if (t[0] + t[1] == maxi){
            if (lijevo - t[1])
                r = mid - 1;
            else
                l = mid + 1;
        }
        else
            r = mid;
    }
    
    while(end >= l){
        t = pitaj(l);
        if (t[0] + t[1] == 0)
            return l;
        if (t[0] + t[1] == maxi)
            break;
        l++;
    }
    if (mem[l][1] - mem[end + 1][1])
        return bin_search(mem[l][1], l + 1, end, maxi);
    return -1;
}


int find_best(int n){
    memset(done, 0, sizeof(done));
    int maxi = 0;
    int grupa = 460, br = n/460;
    int curr = 0;
    vi idx;
    for (int i = 0; i < grupa; i++){
        if (curr >= n)
            break;
        vi res = pitaj(curr);
        maxi = max(maxi, res[0] + res[1]);
        if (res[0] + res[1] == 0)
            return curr;
        idx.push_back(curr);
        if (i < (n%460))
            curr += br + 1;
        else
            curr += br;
        
    }
    done[n] = true; mem[n] = {maxi, 0}; idx.push_back(n);
    for (int i = 0; i < idx.size() - 1; i++){
        int x = idx[i], y = idx[i + 1];
        int res = -1;
        vi r;
        if (mem[x][0] + mem[x][1] < maxi){
            while(y >= x){
                r = pitaj(x);
                if (r[0] + r[1] == 0)
                    return x;
                if (r[0] + r[1] == maxi)
                    break;
                x++;
            }
        }
        if (mem[y][0] + mem[y][1] < maxi){
            while(y >= x){
                r = pitaj(y);
                if (r[0] + r[1] == 0)
                    return y;
                if (r[0] + r[1] == maxi)
                    break;
                y--;
            }
        }
        
        if (x <= y)
            if ((mem[x][1] - mem[y][1]) > 0)
                res = bin_search(mem[x][1], x + 1, y - 1, maxi);
        if (res != -1)
            return res;
    }
}

Compilation message (stderr)

prize.cpp: In function 'int find_best(int)':
prize.cpp:82:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < idx.size() - 1; i++){
                     ~~^~~~~~~~~~~~~~~~
prize.cpp:113:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

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