oj.uz

답안 #1051703

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1051703 2024-08-10T09:09:38 Z becaido 커다란 상품 (IOI17_prize) C++17
100 / 100
 24 ms 1724 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#include <bits/stdc++.h>
using namespace std;

#ifdef WAIMAI
#include "grader.cpp"
#else
#include "prize.h"
#endif

#ifdef WAIMAI
#define debug(HEHE...) cout << "[" << #HEHE << "] : ", dout(HEHE)
void dout() {cout << '\n';}
template<typename T, typename...U>
void dout(T t, U...u) {cout << t << (sizeof...(u) ? ", " : ""), dout(u...);}
#else
#define debug(...) 7122
#endif

#define ll long long
#define Waimai ios::sync_with_stdio(false), cin.tie(0)
#define FOR(x,a,b) for (int x = a, I = b; x <= I; x++)
#define pb emplace_back
#define F first
#define S second

const int SIZE = 2e5 + 5;

int lc[SIZE];
map<int, set<int>> mp;

int rec(int l, int r) {
    if (l > r) return -1;
    int mid = (l + r) / 2;
    auto v = ask(mid);
    if (v[0] + v[1] == 0) return mid;
    lc[mid] = v[0];
    mp[v[0] + v[1]].insert(mid);
    auto it = mp[v[0] + v[1]].find(mid);
    if (it == mp[v[0] + v[1]].begin() || lc[*prev(it)] != lc[mid]) {
        int res = rec(l, mid - 1);
        if (res != -1) return res;
    }
    if (next(it) == mp[v[0] + v[1]].end() || lc[*next(it)] != lc[mid]) {
        int res = rec(mid + 1, r);
        if (res != -1) return res;
    }
    return -1;
}

int find_best(int n) {
    mp.clear();
    return rec(0, n - 1);
}

/*
in1
8
3 2 3 1 3 3 2 3
*/

Subtask #1
20.0 / 20.0

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

Subtask #2
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 436 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 436 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 436 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 3 ms 856 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 3 ms 436 KB Output is correct
16 Correct 17 ms 1268 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 19 ms 1368 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 5 ms 856 KB Output is correct
21 Correct 10 ms 676 KB Output is correct
22 Correct 2 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 436 KB Output is correct
25 Correct 11 ms 796 KB Output is correct
26 Correct 7 ms 856 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 14 ms 1360 KB Output is correct
29 Correct 17 ms 1104 KB Output is correct
30 Correct 23 ms 1616 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 2 ms 600 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 7 ms 600 KB Output is correct
35 Correct 1 ms 600 KB Output is correct
36 Correct 4 ms 440 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 7 ms 684 KB Output is correct
40 Correct 16 ms 1368 KB Output is correct
41 Correct 9 ms 856 KB Output is correct
42 Correct 14 ms 856 KB Output is correct
43 Correct 10 ms 856 KB Output is correct
44 Correct 7 ms 856 KB Output is correct
45 Correct 6 ms 600 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 8 ms 700 KB Output is correct
48 Correct 14 ms 1104 KB Output is correct
49 Correct 2 ms 600 KB Output is correct
50 Correct 17 ms 1360 KB Output is correct
51 Correct 5 ms 600 KB Output is correct
52 Correct 1 ms 344 KB Output is correct
53 Correct 1 ms 600 KB Output is correct
54 Correct 8 ms 856 KB Output is correct
55 Correct 0 ms 440 KB Output is correct
56 Correct 18 ms 1544 KB Output is correct
57 Correct 13 ms 1124 KB Output is correct
58 Correct 19 ms 1104 KB Output is correct
59 Correct 10 ms 856 KB Output is correct
60 Correct 12 ms 1112 KB Output is correct
61 Correct 1 ms 600 KB Output is correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 1 ms 600 KB Output is correct
64 Correct 1 ms 344 KB Output is correct
65 Correct 0 ms 344 KB Output is correct
66 Correct 0 ms 344 KB Output is correct
67 Correct 1 ms 344 KB Output is correct
68 Correct 1 ms 344 KB Output is correct
69 Correct 0 ms 344 KB Output is correct
70 Correct 1 ms 344 KB Output is correct
71 Correct 22 ms 1616 KB Output is correct
72 Correct 2 ms 856 KB Output is correct
73 Correct 13 ms 1360 KB Output is correct
74 Correct 20 ms 1360 KB Output is correct
75 Correct 1 ms 600 KB Output is correct
76 Correct 14 ms 1272 KB Output is correct
77 Correct 17 ms 1212 KB Output is correct
78 Correct 2 ms 740 KB Output is correct
79 Correct 8 ms 1272 KB Output is correct
80 Correct 24 ms 1360 KB Output is correct
81 Correct 19 ms 1360 KB Output is correct
82 Correct 20 ms 1724 KB Output is correct
83 Correct 1 ms 600 KB Output is correct
84 Correct 16 ms 1372 KB Output is correct
85 Correct 24 ms 1356 KB Output is correct
86 Correct 3 ms 856 KB Output is correct
87 Correct 2 ms 600 KB Output is correct
88 Correct 4 ms 600 KB Output is correct
89 Correct 2 ms 600 KB Output is correct
90 Correct 1 ms 600 KB Output is correct
91 Correct 2 ms 600 KB Output is correct
92 Correct 1 ms 344 KB Output is correct
93 Correct 1 ms 600 KB Output is correct
94 Correct 3 ms 600 KB Output is correct
95 Correct 3 ms 600 KB Output is correct
96 Correct 2 ms 600 KB Output is correct
97 Correct 1 ms 344 KB Output is correct