제출 #1055671

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

prize

#ifndef hwe
	#include "prize.h"
#endif

#include <bits/stdc++.h>
using namespace std;

#define popcount(n) (__builtin_popcountll((n)))
#define clz(n) (__builtin_clzll((n)))
#define ctz(n) (__builtin_ctzll((n)))
#define lg(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))

#define Int __int128
#define fi first
#define se second

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;

template <class T1, class T2>
bool maximize(T1 &x, T2 y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}
template <class T1, class T2>
bool minimize(T1 &x, T2 y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}

template <class T>
void remove_duplicate(vector<T> &ve) {
    sort (ve.begin(), ve.end());
    ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
template <class T> T random(T l, T r) {
    return uniform_int_distribution<T>(l, r)(rng);
}
template <class T> T random(T r) {
    return rng() % r;
}

const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;

map<int, vector<int>> mem;
int ans = -1, not_lolipop = -1;

#ifdef hwe
vector<int> ask(int id) {
    return {0, 1};
}
#endif

vector<int> myask(int id) {
    auto it = mem.find(id);
    if (it != mem.end()) return mem[id];
    vector<int> tmp = ask(id); mem[id] = tmp;
    if (tmp[0] + tmp[1] == 0) ans = id;
    return tmp;
}

void dnc(int l, int r, int prefL, int prefR) {
    if (ans != -1) return;
    if (prefR - prefL == 0) return;
    
    if (l == r) {
        vector<int> tmp = myask(l);
        if (tmp[0] + tmp[1] == 0) ans = l;
        return;
    }

    int mid = l + r + 1 >> 1; int pref_mid = 0;

    for (int i = mid - 1; i >= l; --i) {
        vector<int> tmp = myask(i);
        if (tmp[0] + tmp[1] == not_lolipop) {
            pref_mid += tmp[0];
            break;
        }
        ++pref_mid;
    }

    dnc(l, mid - 1, prefL, pref_mid);
    dnc(mid, r, pref_mid, prefR);
}

int find_best(int n) {
    ans = not_lolipop = -1;
    for (int i = 0; i < min(500, n); ++i) {
        vector<int> tmp = myask(i);
        if (tmp[0] + tmp[1] == 0) return i;
        maximize(not_lolipop, tmp[0] + tmp[1]);
    }

    dnc(0, n - 1, 0, not_lolipop);

    assert(0 <= ans && ans < n);
    return ans;
}

#ifdef hwe
signed main() {


    cerr << '\n'; return 0;
}
#endif

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

prize.cpp: In function 'void dnc(int, int, int, int)':
prize.cpp:97:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   97 |     int mid = l + r + 1 >> 1; int pref_mid = 0;
      |               ~~~~~~^~~

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