oj.uz

답안 #1048240

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1048240 2024-08-08T05:51:01 Z becaido 커다란 상품 (IOI17_prize) C++17
97.61 / 100
 31 ms 2396 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;
const int K = 480;

int ans, bL, bR, mx, L[SIZE], R[SIZE];
vector<int> id;

pair<int, int> que(int i) {
    if (L[i] == -1) {
        auto v = ask(i);
        L[i] = v[0], R[i] = v[1];
    }
    return {L[i], R[i]};
}

void check(int i) {
    if (ans != -1) return;
    auto [l, r] = que(i);
    if (l + r == 0) {
        ans = i;
        return;
    }
    id.pb(i);
}
queue<tuple<int, int, int, int, int>> q;
void bfs() {
    auto [l, r, lc, rc, tot] = q.front();
    q.pop();
    if (r < bL || l > bR || ans != -1 || l > r || tot == 0) return;
    if (l == r) {
        check(l);
        return;
    }
    int mid = (l + r) / 2;
    FOR (i, mid, r) {
        if (ans != -1) return;
        auto [lcnt, rcnt] = que(i);
        if (lcnt + rcnt != mx) {
            check(i);
            if (lcnt + rcnt == 1) {
                if (lcnt == 1) bR = i;
                else bL = i;
            }
            continue;
        }
        lcnt -= lc, rcnt -= rc;
        q.emplace(l, mid - 1, lc, rc + (i - mid) + rcnt, tot - (i - mid) - rcnt);
        q.emplace(i + 1, r, lc + lcnt, rc, tot - lcnt);
        return;
    }
    q.emplace(l, mid - 1, lc, rc + (r - mid + 1), tot - (r - mid + 1));
}

int find_best(int n) {
    FOR (i, 0, n - 1) L[i] = R[i] = -1;
    if (n < K) {
        FOR (i, 0, n - 1) {
            auto [l, r] = que(i);
            if (l == 0 && r == 0) return i;
        }
    }

    mx = 0;
    FOR (i, 0, K - 1) {
        auto [l, r] = que(i);
        mx = max(mx, l + r);
    }

    id.clear();
    ans = -1;
    FOR (i, 0, K - 1) {
        auto [l, r] = que(i);
        if (l + r != mx) check(i);
    }
    bL = -1, bR = n;
    q.emplace(K, n - 1, id.size(), 0, mx - id.size());
    while (q.size()) bfs();
    for (int i : id) check(i);
    return ans;
}

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

Subtask #1
20.0 / 20.0

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

Subtask #2
77.61 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1880 KB Output is correct
2 Correct 3 ms 1880 KB Output is correct
3 Correct 2 ms 1880 KB Output is correct
4 Correct 2 ms 1880 KB Output is correct
5 Correct 2 ms 1880 KB Output is correct
6 Correct 3 ms 1880 KB Output is correct
7 Correct 3 ms 1880 KB Output is correct
8 Correct 3 ms 1880 KB Output is correct
9 Correct 3 ms 1880 KB Output is correct
10 Correct 2 ms 1880 KB Output is correct
11 Correct 4 ms 2132 KB Output is correct
12 Correct 6 ms 2008 KB Output is correct
13 Correct 4 ms 1880 KB Output is correct
14 Correct 4 ms 600 KB Output is correct
15 Correct 5 ms 2008 KB Output is correct
16 Correct 16 ms 2136 KB Output is correct
17 Correct 3 ms 1880 KB Output is correct
18 Correct 20 ms 2136 KB Output is correct
19 Correct 4 ms 1880 KB Output is correct
20 Correct 14 ms 1112 KB Output is correct
21 Correct 9 ms 1880 KB Output is correct
22 Correct 9 ms 1880 KB Output is correct
23 Correct 3 ms 1880 KB Output is correct
24 Correct 4 ms 1880 KB Output is correct
25 Correct 19 ms 2128 KB Output is correct
26 Correct 15 ms 1880 KB Output is correct
27 Correct 3 ms 1876 KB Output is correct
28 Correct 13 ms 1880 KB Output is correct
29 Correct 9 ms 2016 KB Output is correct
30 Correct 20 ms 2136 KB Output is correct
31 Correct 3 ms 1880 KB Output is correct
32 Correct 4 ms 1880 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 11 ms 2012 KB Output is correct
35 Correct 4 ms 1880 KB Output is correct
36 Correct 23 ms 2016 KB Output is correct
37 Correct 4 ms 1880 KB Output is correct
38 Correct 3 ms 1880 KB Output is correct
39 Correct 17 ms 2124 KB Output is correct
40 Correct 15 ms 1880 KB Output is correct
41 Correct 20 ms 2140 KB Output is correct
42 Correct 12 ms 1880 KB Output is correct
43 Correct 13 ms 1880 KB Output is correct
44 Correct 15 ms 2008 KB Output is correct
45 Correct 16 ms 2136 KB Output is correct
46 Correct 3 ms 1880 KB Output is correct
47 Correct 3 ms 1880 KB Output is correct
48 Correct 19 ms 2128 KB Output is correct
49 Correct 10 ms 1880 KB Output is correct
50 Correct 17 ms 2136 KB Output is correct
51 Correct 12 ms 1880 KB Output is correct
52 Correct 15 ms 2136 KB Output is correct
53 Correct 3 ms 1880 KB Output is correct
54 Correct 11 ms 1880 KB Output is correct
55 Correct 3 ms 1880 KB Output is correct
56 Correct 14 ms 2136 KB Output is correct
57 Correct 17 ms 2020 KB Output is correct
58 Correct 19 ms 1880 KB Output is correct
59 Correct 25 ms 1880 KB Output is correct
60 Correct 4 ms 2016 KB Output is correct
61 Correct 3 ms 1880 KB Output is correct
62 Correct 3 ms 1880 KB Output is correct
63 Correct 3 ms 1972 KB Output is correct
64 Correct 3 ms 1880 KB Output is correct
65 Correct 3 ms 1880 KB Output is correct
66 Correct 4 ms 1880 KB Output is correct
67 Correct 4 ms 1880 KB Output is correct
68 Correct 2 ms 2136 KB Output is correct
69 Correct 4 ms 1880 KB Output is correct
70 Correct 3 ms 1880 KB Output is correct
71 Partially correct 16 ms 1880 KB Partially correct - number of queries: 5239
72 Correct 5 ms 1880 KB Output is correct
73 Partially correct 22 ms 2016 KB Partially correct - number of queries: 5176
74 Partially correct 17 ms 1876 KB Partially correct - number of queries: 5203
75 Correct 2 ms 1880 KB Output is correct
76 Correct 21 ms 2136 KB Output is correct
77 Correct 23 ms 1880 KB Output is correct
78 Correct 3 ms 1880 KB Output is correct
79 Correct 8 ms 1880 KB Output is correct
80 Correct 31 ms 2396 KB Output is correct
81 Correct 11 ms 1880 KB Output is correct
82 Correct 22 ms 2008 KB Output is correct
83 Correct 2 ms 1876 KB Output is correct
84 Correct 11 ms 1880 KB Output is correct
85 Correct 19 ms 2280 KB Output is correct
86 Correct 3 ms 2136 KB Output is correct
87 Correct 3 ms 1880 KB Output is correct
88 Correct 2 ms 1880 KB Output is correct
89 Correct 4 ms 1880 KB Output is correct
90 Correct 3 ms 1880 KB Output is correct
91 Correct 3 ms 1880 KB Output is correct
92 Correct 3 ms 1880 KB Output is correct
93 Correct 4 ms 2000 KB Output is correct
94 Correct 4 ms 1880 KB Output is correct
95 Correct 4 ms 2004 KB Output is correct
96 Correct 3 ms 1880 KB Output is correct
97 Correct 4 ms 2136 KB Output is correct