oj.uz

답안 #1036248

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1036248 2024-07-27T06:58:26 Z Alihan_8 커다란 상품 (IOI17_prize) C++17
0 / 100
 6 ms 10324 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;
}


mt19937 rng(chrono::steady_clock().now().time_since_epoch().count());
#define rnd(l, r) uniform_int_distribution <int> (l, r)(rng)

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 ans = -1;
	
	int K = rnd(0, n - 1);
	
	for ( int i = n - 1; i > K; i-- ){
		auto c = f(i);
		
		if ( c[0] + c[1] == 0 ){
			ans = i;
			
			return ans;
		}
		
		int l = K + 1, r = i;
		
		while ( l < r ){
			int m = (l + r) / 2;
			
			if ( f(m) != c ){
				l = m + 1;
			} else r = m;
		}
		
		i = l; 
	}
	
	for ( int i = K; i < n; i++ ){
		auto c = f(i);
		
		if ( c[0] + c[1] == 0 ){
			ans = i;
			
			return ans;
		}
		
		int l = i, r = n;
		
		while ( l + 1 < r ){
			int m = (l + r) / 2;
			
			if ( f(m) != c ){
				r = m;
			} else l = m;
		}
		
		i = l; 
	}
	
	assert(false);
}

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 6 ms 10324 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 6 ms 10072 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -