답안 #1075842

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1075842 2024-08-26T09:26:50 Z mdn2002 커다란 상품 (IOI17_prize) C++14
20 / 100
50 ms 436 KB
#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

int find_best(int n) {
	int mx = 0, lim = 500, xx = 10;

	while (xx --) {
        int i = rnd() % n;
        vector<int> a = ask(i);
        mx = max(mx, a[0] + a[1]);
	}

	for (int i = 0; i < n; i ++) {
        vector<int> a = ask(i);
        if (a[0] + a[1] == mx) {
            vector<int> c = ask(min(n - 1, i + lim));
            if (a[1] == c[1]) {
                i = min(n - 1, i + lim);
                continue;
            }
            for (int j = 500; j >= 1; j = (j + 1) / 2) {
                if (i + j >= n) continue;
                vector<int> b = ask(i + j);
                if (a[1] == b[1]) i += j;
                if (j == 1) break;
            }
        }
        else if (a[0] + a[1] == 0) return i;
	}
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:32:1: warning: control reaches end of non-void function [-Wreturn-type]
   32 | }
      | ^
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 4 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 6 ms 344 KB Output is correct
5 Correct 3 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 3 ms 344 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 6 ms 344 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 2 ms 432 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 3 ms 340 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 7 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 4 ms 344 KB Output is correct
16 Partially correct 22 ms 344 KB Partially correct - number of queries: 5093
17 Correct 0 ms 344 KB Output is correct
18 Partially correct 41 ms 344 KB Partially correct - number of queries: 6146
19 Correct 1 ms 344 KB Output is correct
20 Correct 7 ms 428 KB Output is correct
21 Correct 8 ms 344 KB Output is correct
22 Correct 2 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 16 ms 344 KB Output is correct
26 Correct 15 ms 344 KB Output is correct
27 Correct 2 ms 344 KB Output is correct
28 Partially correct 42 ms 344 KB Partially correct - number of queries: 6190
29 Correct 29 ms 344 KB Output is correct
30 Partially correct 19 ms 344 KB Partially correct - number of queries: 6094
31 Correct 0 ms 344 KB Output is correct
32 Correct 3 ms 340 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 8 ms 344 KB Output is correct
35 Correct 4 ms 344 KB Output is correct
36 Correct 6 ms 344 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 12 ms 344 KB Output is correct
40 Partially correct 24 ms 344 KB Partially correct - number of queries: 5194
41 Correct 16 ms 344 KB Output is correct
42 Correct 16 ms 344 KB Output is correct
43 Correct 19 ms 344 KB Output is correct
44 Correct 7 ms 344 KB Output is correct
45 Correct 10 ms 344 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 9 ms 344 KB Output is correct
48 Correct 29 ms 344 KB Output is correct
49 Correct 2 ms 344 KB Output is correct
50 Partially correct 35 ms 344 KB Partially correct - number of queries: 6146
51 Correct 11 ms 344 KB Output is correct
52 Correct 1 ms 344 KB Output is correct
53 Correct 3 ms 344 KB Output is correct
54 Correct 13 ms 344 KB Output is correct
55 Correct 0 ms 344 KB Output is correct
56 Partially correct 25 ms 428 KB Partially correct - number of queries: 6146
57 Correct 21 ms 344 KB Output is correct
58 Correct 20 ms 344 KB Output is correct
59 Correct 15 ms 344 KB Output is correct
60 Correct 18 ms 344 KB Output is correct
61 Correct 4 ms 344 KB Output is correct
62 Correct 1 ms 344 KB Output is correct
63 Correct 6 ms 436 KB Output is correct
64 Correct 2 ms 344 KB Output is correct
65 Correct 4 ms 344 KB Output is correct
66 Correct 8 ms 344 KB Output is correct
67 Correct 4 ms 344 KB Output is correct
68 Correct 2 ms 344 KB Output is correct
69 Correct 6 ms 432 KB Output is correct
70 Correct 3 ms 340 KB Output is correct
71 Partially correct 41 ms 344 KB Partially correct - number of queries: 6180
72 Correct 6 ms 344 KB Output is correct
73 Partially correct 45 ms 344 KB Partially correct - number of queries: 6099
74 Partially correct 35 ms 344 KB Partially correct - number of queries: 6133
75 Correct 4 ms 344 KB Output is correct
76 Partially correct 24 ms 344 KB Partially correct - number of queries: 5358
77 Partially correct 28 ms 344 KB Partially correct - number of queries: 6182
78 Correct 6 ms 344 KB Output is correct
79 Correct 14 ms 344 KB Output is correct
80 Partially correct 33 ms 344 KB Partially correct - number of queries: 6184
81 Partially correct 19 ms 344 KB Partially correct - number of queries: 6186
82 Partially correct 28 ms 344 KB Partially correct - number of queries: 6136
83 Correct 4 ms 344 KB Output is correct
84 Partially correct 23 ms 340 KB Partially correct - number of queries: 5180
85 Partially correct 36 ms 344 KB Partially correct - number of queries: 6186
86 Incorrect 50 ms 344 KB Incorrect
87 Halted 0 ms 0 KB -