oj.uz

답안 #798272

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
798272 2023-07-30T14:37:24 Z PixelCat 커다란 상품 (IOI17_prize) C++14
100 / 100
 45 ms 1904 KB 
#include "prize.h"

#ifdef NYAOWO
#include "grader.cpp"
#endif

#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i <= b; i++)
#define Forr(i, a, b) for(int i = a; i >= b; i--)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define eb emplace_back
// #define int LL
using namespace std;
using i32 = int32_t;
using LL = long long;
using pii = pair<int, int>;

const int MAXN = 200'000;
mt19937 rng(time(NULL));

pii mem[MAXN + 10];
pii qry(int idx) {
    if(mem[idx].F != -1) return mem[idx];
    auto res = ask(idx);
    return mem[idx] = pii(res[0], res[1]);
}

int solve(int n) {
    int tot = 0;
    For(_, 1, 100) {
        pii p = qry((int)(rng() % (LL)n));
        tot = max(tot, p.F + p.S);
    }
    
    vector<int> res;
    bool fail = true;
    while(fail) {
        fail = false;
        res.clear();
        priority_queue<pii, vector<pii>, greater<pii>> pq;
        For(i, 0, tot - 1) {
            int lo, hi = n;
            if(!sz(res)) lo = -1;
            else lo = res.back();
            while(sz(pq) && pq.top().F < i) pq.pop();
            while(sz(pq) && pq.top().F == i) {
                lo = max(lo, pq.top().S);
                pq.pop();
            }
            if(sz(pq)) {
                assert(pq.top().F > i);
                hi = pq.top().S;
            }
            while(hi - lo > 1) {
                int mi = (hi + lo) / 2;
                pii p = qry(mi);
                if(p.F + p.S > tot) {
                    fail = true;
                    tot = p.F + p.S;
                    goto FAIL;
                }
                if(p.F + p.S < tot || p.F > i) hi = mi;
                else lo = mi;
                if(p.F + p.S == tot) pq.emplace(p.F, mi);
            }
            assert(hi < n);
            res.eb(hi);
        }
        FAIL:;
    }

    for(auto &i:res) {
        pii p = qry(i);
        if(p.F + p.S == 0) {
            return i;
        }
    }
    return -8;
}

i32 find_best(i32 n) {
    fill(mem, mem + MAXN + 10, pii(-1, -1));

#ifndef NYAOWO
    if(n <= 5000) {
        For(i, 0, n - 1) {
            pii p = qry(i);
            if(p.F + p.S == 0) return i;
        }
        return -8;
    }
#endif

    return solve(n);
}

Subtask #1
20.0 / 20.0

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

Subtask #2
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1744 KB Output is correct
2 Correct 2 ms 1840 KB Output is correct
3 Correct 2 ms 1744 KB Output is correct
4 Correct 2 ms 1872 KB Output is correct
5 Correct 2 ms 1840 KB Output is correct
6 Correct 2 ms 1744 KB Output is correct
7 Correct 2 ms 1872 KB Output is correct
8 Correct 2 ms 1744 KB Output is correct
9 Correct 1 ms 1852 KB Output is correct
10 Correct 2 ms 1744 KB Output is correct
11 Correct 5 ms 1840 KB Output is correct
12 Correct 4 ms 1872 KB Output is correct
13 Correct 3 ms 1844 KB Output is correct
14 Correct 10 ms 1744 KB Output is correct
15 Correct 35 ms 1744 KB Output is correct
16 Correct 44 ms 1856 KB Output is correct
17 Correct 42 ms 1832 KB Output is correct
18 Correct 39 ms 1844 KB Output is correct
19 Correct 16 ms 1904 KB Output is correct
20 Correct 27 ms 1744 KB Output is correct
21 Correct 40 ms 1744 KB Output is correct
22 Correct 21 ms 1844 KB Output is correct
23 Correct 3 ms 1836 KB Output is correct
24 Correct 4 ms 1872 KB Output is correct
25 Correct 35 ms 1868 KB Output is correct
26 Correct 36 ms 1840 KB Output is correct
27 Correct 2 ms 1840 KB Output is correct
28 Correct 15 ms 1872 KB Output is correct
29 Correct 15 ms 1904 KB Output is correct
30 Correct 17 ms 1864 KB Output is correct
31 Correct 19 ms 1872 KB Output is correct
32 Correct 3 ms 1836 KB Output is correct
33 Correct 1 ms 1744 KB Output is correct
34 Correct 16 ms 1852 KB Output is correct
35 Correct 2 ms 1840 KB Output is correct
36 Correct 38 ms 1744 KB Output is correct
37 Correct 5 ms 1840 KB Output is correct
38 Correct 3 ms 1744 KB Output is correct
39 Correct 41 ms 1840 KB Output is correct
40 Correct 35 ms 1872 KB Output is correct
41 Correct 32 ms 1872 KB Output is correct
42 Correct 17 ms 1872 KB Output is correct
43 Correct 27 ms 1744 KB Output is correct
44 Correct 17 ms 1860 KB Output is correct
45 Correct 17 ms 1872 KB Output is correct
46 Correct 42 ms 1872 KB Output is correct
47 Correct 40 ms 1872 KB Output is correct
48 Correct 30 ms 1848 KB Output is correct
49 Correct 17 ms 1876 KB Output is correct
50 Correct 38 ms 1856 KB Output is correct
51 Correct 25 ms 1868 KB Output is correct
52 Correct 40 ms 1872 KB Output is correct
53 Correct 3 ms 1744 KB Output is correct
54 Correct 17 ms 1868 KB Output is correct
55 Correct 20 ms 1852 KB Output is correct
56 Correct 33 ms 1852 KB Output is correct
57 Correct 41 ms 1840 KB Output is correct
58 Correct 29 ms 1744 KB Output is correct
59 Correct 40 ms 1840 KB Output is correct
60 Correct 17 ms 1868 KB Output is correct
61 Correct 2 ms 1840 KB Output is correct
62 Correct 2 ms 1836 KB Output is correct
63 Correct 2 ms 1840 KB Output is correct
64 Correct 3 ms 1744 KB Output is correct
65 Correct 2 ms 1744 KB Output is correct
66 Correct 5 ms 1872 KB Output is correct
67 Correct 3 ms 1868 KB Output is correct
68 Correct 3 ms 1876 KB Output is correct
69 Correct 6 ms 1872 KB Output is correct
70 Correct 2 ms 1872 KB Output is correct
71 Correct 38 ms 1744 KB Output is correct
72 Correct 6 ms 1744 KB Output is correct
73 Correct 40 ms 1744 KB Output is correct
74 Correct 41 ms 1744 KB Output is correct
75 Correct 3 ms 1744 KB Output is correct
76 Correct 30 ms 1744 KB Output is correct
77 Correct 18 ms 1872 KB Output is correct
78 Correct 6 ms 1744 KB Output is correct
79 Correct 22 ms 1744 KB Output is correct
80 Correct 41 ms 1848 KB Output is correct
81 Correct 45 ms 1744 KB Output is correct
82 Correct 23 ms 1872 KB Output is correct
83 Correct 3 ms 1756 KB Output is correct
84 Correct 27 ms 1872 KB Output is correct
85 Correct 38 ms 1744 KB Output is correct
86 Correct 36 ms 1744 KB Output is correct
87 Correct 5 ms 1744 KB Output is correct
88 Correct 36 ms 1872 KB Output is correct
89 Correct 36 ms 1744 KB Output is correct
90 Correct 2 ms 1744 KB Output is correct
91 Correct 18 ms 1864 KB Output is correct
92 Correct 37 ms 1744 KB Output is correct
93 Correct 5 ms 1872 KB Output is correct
94 Correct 4 ms 1744 KB Output is correct
95 Correct 4 ms 1744 KB Output is correct
96 Correct 4 ms 1744 KB Output is correct
97 Correct 2 ms 1744 KB Output is correct