oj.uz

답안 #1036391

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1036391 2024-07-27T10:26:22 Z Alihan_8 커다란 상품 (IOI17_prize) C++17
20 / 100
 34 ms 5532 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 = 1;

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

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 2 ms 4952 KB Output is correct
3 Correct 2 ms 4952 KB Output is correct
4 Correct 2 ms 4952 KB Output is correct
5 Correct 2 ms 4952 KB Output is correct
6 Correct 2 ms 4952 KB Output is correct
7 Correct 1 ms 4952 KB Output is correct
8 Correct 2 ms 4952 KB Output is correct
9 Correct 2 ms 4932 KB Output is correct
10 Correct 2 ms 4952 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 2 ms 4952 KB Output is correct
3 Correct 2 ms 4952 KB Output is correct
4 Correct 2 ms 4952 KB Output is correct
5 Correct 2 ms 4952 KB Output is correct
6 Correct 2 ms 4952 KB Output is correct
7 Correct 2 ms 4952 KB Output is correct
8 Correct 1 ms 4952 KB Output is correct
9 Correct 2 ms 4952 KB Output is correct
10 Correct 2 ms 4952 KB Output is correct
11 Correct 4 ms 4952 KB Output is correct
12 Correct 2 ms 5156 KB Output is correct
13 Correct 6 ms 5208 KB Output is correct
14 Correct 3 ms 856 KB Output is correct
15 Correct 11 ms 5208 KB Output is correct
16 Incorrect 34 ms 5532 KB Incorrect
17 Halted 0 ms 0 KB -