oj.uz

Submission #1043235

# Submission time Handle Problem Language Result Execution time Memory
1043235 2024-08-04T05:40:40 Z Alihan_8 The Big Prize (IOI17_prize) C++17
0 / 100
 1000 ms 5208 KB 
#include "prize.h"

#include <bits/stdc++.h>

using namespace std;

#define all(x) x.begin(), x.end()
#define ar array
#define pb push_back
#define ln '\n'
//#define int long long

using i64 = long long;

template <class F, class _S>
bool chmin(F &u, const _S &v){
    bool flag = false;
    if ( u > v ){
        u = v; flag |= true;
    }
    return flag;
}

template <class F, class _S>
bool chmax(F &u, const _S &v){
    bool flag = false;
    if ( u < v ){
        u = v; flag |= true;
    }
    return flag;
}

const int B = 474;

int find_best(int n){
	vector <vector<int>> dp(n);	
	
	auto f = [&](int j){
		if ( dp[j].empty() ){
			dp[j] = ask(j);
		}
		
		return dp[j];
	};
	
	auto g = [&](int j){
		return f(j)[0] + f(j)[1];
	};
	
	int mx = -1, k = -1;
	
	for ( int i = 0; i < min(n, B); i++ ){
		if ( chmax(mx, g(i)) ){
			k = i;
		}
		
		if ( g(i) == 0 ){
			return i;
		}
	}
	
	for ( int i = k; i < n;){
		int l = i, r = min(n, l + B);
		
		if ( f(r - 1)[1] == f(l)[1] ){
			l = r; continue;
		}
		
		while ( l + 1 < r ){
			int m = (l + r) / 2;
			
			if ( f(m)[1] != f(i)[1] ){
				r = m;
			} else l = m;
		}
		
		int j = r;
		
		while ( j < n && g(j) != g(i) ){
			if ( g(j) == 0 ){
				return j;
			} j++;
		}
		
		i = j;
	}
	
	assert(false);
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3065 ms 5208 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3062 ms 4952 KB Time limit exceeded
2 Halted 0 ms 0 KB -