oj.uz

답안 #778878

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
778878 2023-07-10T22:41:58 Z kingfran1907 커다란 상품 (IOI17_prize) C++14
20 / 100
 1000 ms 3056 KB 
#include "prize.h"
#include <bits/stdc++.h>
#define X first
#define Y second

using namespace std;
typedef long long llint;
const int maxn = 2e5+10;

int l[maxn], r[maxn];
int out = -1;
int maxi = 0;

pair<int,int> query(int x) {
	if (l[x] != -1) return {l[x], r[x]};
	
	vector< int > v = ask(x);
	l[x] = v[0], r[x] = v[1];
	return {l[x], r[x]};
}

llint ra() {
	return (llint)rand() * rand() + rand() + rand();
}

void solve(int l, int r) {
	if (l > r) return;
	if (out != -1) return;
	if (query(l).X + query(l).Y == 0) {
		out = l;
		return;
	}
	if (query(l).X + query(l).Y < maxi) {solve(l + 1, r); return;}
	if (l == r) return;
	if (query(r).X + query(r).Y == 0) {
		out = r;
		return;
	}
	if (query(r).X + query(r).Y < maxi) {solve(l, r - 1); return;}
	if (query(l).X == query(r).X) return;
	
	int mid = (l + r) / 2;
	solve(l, mid);
	solve(mid, r);
}

int find_best(int n) {
	memset(l, -1, sizeof l);
	//srand(31337);
	vector< int > v;
	for (int i = 0; i < n; i++) v.push_back(i);
	for (int i = 0; i < n; i++) 
		swap(v[i], v[ra() % n]);
	
	for (int i = 0; i < min(400, n); i++) {
		int x = v[i];
		pair<int, int> tr = query(x);
		if (tr.X + tr.Y == 0) return x;
		maxi = max(maxi, tr.X + tr.Y);
	}
	solve(0, n - 1);
	assert(out != -1);
	return out;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 2640 KB Output is correct
2 Correct 13 ms 2588 KB Output is correct
3 Correct 13 ms 2580 KB Output is correct
4 Correct 13 ms 2616 KB Output is correct
5 Correct 10 ms 2568 KB Output is correct
6 Correct 13 ms 2620 KB Output is correct
7 Correct 11 ms 2628 KB Output is correct
8 Correct 13 ms 2592 KB Output is correct
9 Correct 10 ms 2580 KB Output is correct
10 Correct 12 ms 2656 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 2656 KB Output is correct
2 Correct 10 ms 2580 KB Output is correct
3 Correct 12 ms 2620 KB Output is correct
4 Correct 12 ms 2640 KB Output is correct
5 Correct 12 ms 2588 KB Output is correct
6 Correct 13 ms 2572 KB Output is correct
7 Correct 12 ms 2608 KB Output is correct
8 Correct 13 ms 2652 KB Output is correct
9 Correct 12 ms 2560 KB Output is correct
10 Correct 13 ms 2684 KB Output is correct
11 Correct 13 ms 2756 KB Output is correct
12 Correct 13 ms 2588 KB Output is correct
13 Correct 16 ms 2720 KB Output is correct
14 Correct 7 ms 1360 KB Output is correct
15 Correct 13 ms 2704 KB Output is correct
16 Correct 49 ms 2736 KB Output is correct
17 Correct 10 ms 2580 KB Output is correct
18 Partially correct 54 ms 2748 KB Partially correct - number of queries: 5016
19 Correct 11 ms 2580 KB Output is correct
20 Correct 9 ms 2004 KB Output is correct
21 Correct 22 ms 2668 KB Output is correct
22 Correct 13 ms 2656 KB Output is correct
23 Correct 13 ms 2620 KB Output is correct
24 Correct 13 ms 2572 KB Output is correct
25 Correct 29 ms 2696 KB Output is correct
26 Correct 18 ms 2752 KB Output is correct
27 Correct 11 ms 2616 KB Output is correct
28 Correct 42 ms 2696 KB Output is correct
29 Correct 41 ms 2704 KB Output is correct
30 Correct 53 ms 2752 KB Output is correct
31 Correct 12 ms 2656 KB Output is correct
32 Correct 14 ms 2576 KB Output is correct
33 Correct 1 ms 976 KB Output is correct
34 Correct 21 ms 2620 KB Output is correct
35 Correct 11 ms 2708 KB Output is correct
36 Correct 21 ms 2652 KB Output is correct
37 Correct 12 ms 2684 KB Output is correct
38 Correct 11 ms 2556 KB Output is correct
39 Correct 30 ms 2636 KB Output is correct
40 Correct 24 ms 2764 KB Output is correct
41 Correct 37 ms 2620 KB Output is correct
42 Correct 19 ms 2712 KB Output is correct
43 Correct 33 ms 2620 KB Output is correct
44 Correct 28 ms 2620 KB Output is correct
45 Correct 15 ms 2704 KB Output is correct
46 Correct 13 ms 2552 KB Output is correct
47 Correct 19 ms 2700 KB Output is correct
48 Correct 48 ms 2644 KB Output is correct
49 Correct 12 ms 2584 KB Output is correct
50 Partially correct 40 ms 2712 KB Partially correct - number of queries: 5023
51 Correct 20 ms 2696 KB Output is correct
52 Correct 13 ms 2584 KB Output is correct
53 Correct 11 ms 2720 KB Output is correct
54 Correct 28 ms 2612 KB Output is correct
55 Correct 11 ms 2584 KB Output is correct
56 Correct 26 ms 2768 KB Output is correct
57 Correct 24 ms 2728 KB Output is correct
58 Correct 38 ms 2724 KB Output is correct
59 Correct 24 ms 2840 KB Output is correct
60 Correct 37 ms 2692 KB Output is correct
61 Correct 11 ms 2628 KB Output is correct
62 Correct 10 ms 2584 KB Output is correct
63 Correct 12 ms 2748 KB Output is correct
64 Correct 13 ms 2672 KB Output is correct
65 Correct 12 ms 2628 KB Output is correct
66 Correct 13 ms 2628 KB Output is correct
67 Correct 15 ms 2644 KB Output is correct
68 Correct 19 ms 2628 KB Output is correct
69 Correct 12 ms 2648 KB Output is correct
70 Correct 14 ms 2620 KB Output is correct
71 Partially correct 50 ms 2684 KB Partially correct - number of queries: 5142
72 Correct 12 ms 2764 KB Output is correct
73 Partially correct 48 ms 2676 KB Partially correct - number of queries: 5081
74 Partially correct 47 ms 2852 KB Partially correct - number of queries: 5106
75 Correct 13 ms 2676 KB Output is correct
76 Correct 35 ms 2692 KB Output is correct
77 Partially correct 49 ms 2700 KB Partially correct - number of queries: 5117
78 Correct 13 ms 2656 KB Output is correct
79 Correct 32 ms 2688 KB Output is correct
80 Partially correct 44 ms 2652 KB Partially correct - number of queries: 5124
81 Partially correct 53 ms 2760 KB Partially correct - number of queries: 5087
82 Partially correct 31 ms 3056 KB Partially correct - number of queries: 5093
83 Correct 12 ms 2628 KB Output is correct
84 Correct 52 ms 2692 KB Output is correct
85 Partially correct 35 ms 2684 KB Partially correct - number of queries: 5105
86 Correct 26 ms 2900 KB Output is correct
87 Correct 11 ms 2664 KB Output is correct
88 Correct 21 ms 2656 KB Output is correct
89 Correct 25 ms 2704 KB Output is correct
90 Correct 14 ms 2644 KB Output is correct
91 Correct 28 ms 2700 KB Output is correct
92 Correct 16 ms 2688 KB Output is correct
93 Execution timed out 3080 ms 2652 KB Time limit exceeded
94 Halted 0 ms 0 KB -