oj.uz

Submission #1036516

# Submission time Handle Problem Language Result Execution time Memory
1036516 2024-07-27T13:28:36 Z Alihan_8 The Big Prize (IOI17_prize) C++17
20 / 100
 48 ms 5668 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 = 500;

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];
	};
	
	int mx = -1, k = -1;
	
	for ( int i = 0; i < min(n, B); i++ ){
		auto c = f(i);
		
		int x = c[0] + c[1];
		
		if ( chmax(mx, x) || mx == x ){
			k = i;
		}
		
		if ( x == 0 ){
			return i;
		}
	}
	
	int s = k;
	
	while ( k < n ){
		int t = k;
		
		while ( k < min(n, t + B) && f(k) != f(s) ){
			int x = f(k)[0] + f(k)[1];
			
			if ( x == 0 ){
				return k;
			} k++;
		}
		
		int l = k, r = min(n, t + B) - 1;
		
		if ( f(l) == f(r) ){
			k = t + B;
			
			continue;
		}
		
		while ( l + 1 < r ){
			int m = (l + r) / 2;
			
			if ( f(m) != f(k) ){
				r = m;
			} else l = m;
		}
		
		for ( int i = r; i < min(n, i + B); i++ ){
			if ( f(i)[0] + f(i)[1] == 0 ){
				return i;
			}
		}
		
		k = t + B;
	}
	
	return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4952 KB Output is correct
2 Correct 8 ms 4952 KB Output is correct
3 Correct 5 ms 4952 KB Output is correct
4 Correct 7 ms 4952 KB Output is correct
5 Correct 5 ms 4952 KB Output is correct
6 Correct 2 ms 4952 KB Output is correct
7 Correct 5 ms 4952 KB Output is correct
8 Correct 6 ms 5404 KB Output is correct
9 Correct 6 ms 5160 KB Output is correct
10 Correct 7 ms 5168 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4952 KB Output is correct
2 Correct 6 ms 5172 KB Output is correct
3 Correct 9 ms 5288 KB Output is correct
4 Correct 7 ms 4952 KB Output is correct
5 Correct 6 ms 5024 KB Output is correct
6 Correct 2 ms 5032 KB Output is correct
7 Correct 5 ms 4948 KB Output is correct
8 Correct 6 ms 5168 KB Output is correct
9 Correct 6 ms 5668 KB Output is correct
10 Correct 10 ms 5160 KB Output is correct
11 Incorrect 48 ms 5616 KB Incorrect
12 Halted 0 ms 0 KB -