제출 #1306501

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

prize

#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

struct pair_hash{
  size_t operator()(const pair<int,int>&x)const{
    return hash<long long>()(((long long)x.first)^(((long long)x.second)<<32));
  }
};

const int MAXN = 2e5 + 7;
vi res[MAXN];
int n;
int ans = -1;
int mx = 0;

vi Ask(int i){
	if(sz(res[i]) != 0){
		return res[i];
	}

	return res[i] = ask(i);
}

void f(int l, int p, int cnt, int pre){
	if(l > p || ans != -1 || cnt == 0){
		return;
	}

	int mid = (l + p) / 2;
	vi curr = Ask(mid);
	int poczMid = mid;
	while(mid <= p){
		if(curr[0] + curr[1] == mx){
			break;
		}

		if(curr[0] + curr[1] == 0){
			ans = mid;
			return;
		}
		mid++;
		if(mid <= p){
			curr = Ask(mid);
		}
	}

	if(mid == p + 1){
		//nie ma prawego
		f(l, poczMid - 1, cnt - (p - poczMid + 1), pre);
		return;
	}

	f(l, poczMid - 1, curr[0] - (mid - poczMid) - pre, pre);
	if(ans != -1){
		return;
	}
	f(mid + 1, p, cnt - (curr[0] - (mid - poczMid) - pre), curr[0]);
}

int find_best(int N){
	n = N;
	for(int i = 1; i <= 20; i++){
		int ind = rand(0, n - 1);
		vi curr = Ask(ind);
		mx = max(mx, curr[0] + curr[1]);
	}

	f(0, n - 1, mx, 0);
	
	return ans;
}

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