oj.uz

답안 #1043245

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1043245 2024-08-04T05:52:07 Z Alihan_8 커다란 상품 (IOI17_prize) C++17
20 / 100
 47 ms 5976 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 = 470;
 
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(l) == f(r - 1) ){
			i = r - 1; 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;
	}
	
	return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5208 KB Output is correct
2 Correct 5 ms 4952 KB Output is correct
3 Correct 4 ms 4952 KB Output is correct
4 Correct 5 ms 4952 KB Output is correct
5 Correct 3 ms 5144 KB Output is correct
6 Correct 1 ms 4952 KB Output is correct
7 Correct 3 ms 4952 KB Output is correct
8 Correct 4 ms 5208 KB Output is correct
9 Correct 6 ms 5204 KB Output is correct
10 Correct 5 ms 4952 KB Output is correct
11 Correct 5 ms 4952 KB Output is correct
12 Correct 4 ms 5208 KB Output is correct
13 Correct 6 ms 4952 KB Output is correct
14 Correct 3 ms 856 KB Output is correct
15 Correct 6 ms 4956 KB Output is correct
16 Correct 19 ms 5208 KB Output is correct
17 Correct 4 ms 4952 KB Output is correct
18 Partially correct 20 ms 5172 KB Partially correct - number of queries: 5474
19 Correct 2 ms 4952 KB Output is correct
20 Correct 11 ms 2904 KB Output is correct
21 Correct 12 ms 5208 KB Output is correct
22 Correct 4 ms 4952 KB Output is correct
23 Correct 3 ms 4952 KB Output is correct
24 Correct 3 ms 4952 KB Output is correct
25 Correct 14 ms 5208 KB Output is correct
26 Correct 14 ms 5456 KB Output is correct
27 Correct 4 ms 4952 KB Output is correct
28 Partially correct 20 ms 5216 KB Partially correct - number of queries: 5301
29 Correct 14 ms 5208 KB Output is correct
30 Partially correct 16 ms 5208 KB Partially correct - number of queries: 5499
31 Correct 4 ms 5148 KB Output is correct
32 Correct 7 ms 4952 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 12 ms 5180 KB Output is correct
35 Correct 6 ms 4952 KB Output is correct
36 Correct 6 ms 5208 KB Output is correct
37 Correct 3 ms 5148 KB Output is correct
38 Correct 4 ms 5148 KB Output is correct
39 Correct 12 ms 4952 KB Output is correct
40 Correct 29 ms 5216 KB Output is correct
41 Correct 12 ms 5208 KB Output is correct
42 Correct 19 ms 5208 KB Output is correct
43 Correct 14 ms 5200 KB Output is correct
44 Correct 10 ms 5196 KB Output is correct
45 Correct 8 ms 4952 KB Output is correct
46 Correct 3 ms 4952 KB Output is correct
47 Correct 13 ms 5220 KB Output is correct
48 Correct 14 ms 5144 KB Output is correct
49 Correct 4 ms 4952 KB Output is correct
50 Partially correct 21 ms 5208 KB Partially correct - number of queries: 5457
51 Correct 11 ms 5188 KB Output is correct
52 Correct 4 ms 4952 KB Output is correct
53 Correct 5 ms 4952 KB Output is correct
54 Correct 11 ms 5208 KB Output is correct
55 Correct 3 ms 4952 KB Output is correct
56 Partially correct 22 ms 5200 KB Partially correct - number of queries: 5469
57 Correct 21 ms 5208 KB Output is correct
58 Correct 21 ms 5208 KB Output is correct
59 Correct 14 ms 5200 KB Output is correct
60 Correct 12 ms 5208 KB Output is correct
61 Correct 5 ms 4952 KB Output is correct
62 Correct 3 ms 4952 KB Output is correct
63 Correct 4 ms 4952 KB Output is correct
64 Correct 4 ms 4952 KB Output is correct
65 Correct 6 ms 4952 KB Output is correct
66 Correct 7 ms 5144 KB Output is correct
67 Correct 6 ms 4952 KB Output is correct
68 Correct 3 ms 5152 KB Output is correct
69 Correct 7 ms 5236 KB Output is correct
70 Correct 5 ms 4952 KB Output is correct
71 Partially correct 21 ms 5464 KB Partially correct - number of queries: 5206
72 Correct 6 ms 4952 KB Output is correct
73 Partially correct 20 ms 5208 KB Partially correct - number of queries: 5145
74 Partially correct 23 ms 5468 KB Partially correct - number of queries: 5171
75 Correct 5 ms 5208 KB Output is correct
76 Correct 21 ms 5752 KB Output is correct
77 Partially correct 29 ms 5440 KB Partially correct - number of queries: 5441
78 Correct 5 ms 4952 KB Output is correct
79 Correct 13 ms 5208 KB Output is correct
80 Partially correct 16 ms 5208 KB Partially correct - number of queries: 5453
81 Partially correct 28 ms 5976 KB Partially correct - number of queries: 5444
82 Partially correct 31 ms 5236 KB Partially correct - number of queries: 5396
83 Correct 6 ms 4952 KB Output is correct
84 Correct 13 ms 5208 KB Output is correct
85 Partially correct 19 ms 5200 KB Partially correct - number of queries: 5424
86 Incorrect 47 ms 5780 KB Incorrect
87 Halted 0 ms 0 KB -