oj.uz

답안 #1036244

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

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;
	
	if ( rand() & 1 ){
		for ( int i = n - 1; i >= 0; i-- ){
			auto c = f(i);
			
			if ( c[0] + c[1] == 0 ){
				ans = i;
				
				return ans;
			}
			
			int l = 0, r = i;
			
			while ( l < r ){
				int m = (l + r) / 2;
				
				if ( f(m) != c ){
					l = m + 1;
				} else r = m;
			}
			
			i = l; 
		}
	} else{
		for ( int i = 0; 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
20.0 / 20.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 4908 KB Output is correct
4 Correct 2 ms 4952 KB Output is correct
5 Correct 2 ms 4952 KB Output is correct
6 Correct 3 ms 4952 KB Output is correct
7 Correct 2 ms 4952 KB Output is correct
8 Correct 2 ms 5032 KB Output is correct
9 Correct 2 ms 4952 KB Output is correct
10 Correct 2 ms 4952 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4952 KB Output is correct
2 Correct 2 ms 4952 KB Output is correct
3 Correct 3 ms 4952 KB Output is correct
4 Correct 3 ms 4952 KB Output is correct
5 Correct 3 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 2 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 5 ms 4952 KB Output is correct
12 Correct 6 ms 4952 KB Output is correct
13 Correct 2 ms 4952 KB Output is correct
14 Correct 12 ms 856 KB Output is correct
15 Partially correct 37 ms 5668 KB Partially correct - number of queries: 5920
16 Correct 21 ms 5252 KB Output is correct
17 Incorrect 49 ms 5720 KB Incorrect
18 Halted 0 ms 0 KB -