oj.uz

답안 #781948

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
781948 2023-07-13T14:03:51 Z TheSahib 커다란 상품 (IOI17_prize) C++14
98.14 / 100
 94 ms 16108 KB 
#include "prize.h"
#include <bits/stdc++.h>

using namespace std;

const int MAX = 2e5 + 5;

int tree[MAX];

void update(int pos, int val){
    while(pos < MAX){
        tree[pos] += val;
        pos += pos & (-pos);
    }
}

int ask(int l, int r){
    if(r < l) return 0;
    if(l != 1) return ask(1, r) - ask(1, l - 1);
    int ans = 0;
    while(r > 0){
        ans += tree[r];
        r -= r & (-r);
    }
    return ans;
}

int intRand(){
    return (rand() << 14) | rand();
}

vector<int> mp[MAX];

vector<int> query(int i){
    if(!mp[i].empty()) return mp[i];
    return mp[i] = ask(i - 1);
}


int find_best(int n) {
    vector<int> order(n);
    srand(time(0));
    iota(order.begin(), order.end(), 1);
    random_shuffle(order.begin(), order.end());
    vector<int> a;
    int cnt = 0;
    
    set<int> st;
    for (int i = 0; i < n; i++)
    {
        st.insert(i + 1);
    }
    for (int j = 0; j < min(450, (int)order.size()); ++j)
    {
        int i = order[j];
        a = query(i);
        if(a[0] + a[1] == 0) return i - 1;
        if(a[0] + a[1] < cnt){
            update(i, 1);
            st.erase(i);

        }
        else{
            cnt = a[0] + a[1];
        }
    }
    
    
    for(int j = 0; j <= cnt; ++j){
        int l = 1, r = n;
        while(l <= r){
            int x = (l + r) / 2;
            auto itr = st.lower_bound(x);
            if(itr == st.end() || *itr > r){
                --itr;
            }
            int mid = *itr;

            a = query(mid);

            if(a[0] + a[1] == 0){
                return mid - 1;
            }
            if(a[0] + a[1] < cnt && !ask(mid, mid)){
                update(mid, 1);
                st.erase(mid);
                break;
            }
            a[0] -= ask(1, mid - 1);
            a[1] -= ask(mid + 1, n);


            if(a[1] > 0){
                l = mid + 1;
            }
            else{
                r = mid - 1;
            }
        }
    }
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:41:24: warning: control reaches end of non-void function [-Wreturn-type]
   41 |     vector<int> order(n);
      |                        ^

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 15144 KB Output is correct
2 Correct 41 ms 15096 KB Output is correct
3 Correct 49 ms 15092 KB Output is correct
4 Correct 39 ms 15176 KB Output is correct
5 Correct 41 ms 15184 KB Output is correct
6 Correct 45 ms 15176 KB Output is correct
7 Correct 46 ms 15176 KB Output is correct
8 Correct 41 ms 15084 KB Output is correct
9 Correct 37 ms 15096 KB Output is correct
10 Correct 45 ms 15176 KB Output is correct

Subtask #2
78.14 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 15148 KB Output is correct
2 Correct 40 ms 15128 KB Output is correct
3 Correct 39 ms 15176 KB Output is correct
4 Correct 41 ms 15172 KB Output is correct
5 Correct 41 ms 15092 KB Output is correct
6 Correct 39 ms 15188 KB Output is correct
7 Correct 45 ms 15100 KB Output is correct
8 Correct 40 ms 15100 KB Output is correct
9 Correct 44 ms 15180 KB Output is correct
10 Correct 39 ms 15180 KB Output is correct
11 Correct 41 ms 15352 KB Output is correct
12 Correct 44 ms 15480 KB Output is correct
13 Correct 41 ms 15128 KB Output is correct
14 Correct 18 ms 6096 KB Output is correct
15 Correct 71 ms 15904 KB Output is correct
16 Correct 47 ms 15312 KB Output is correct
17 Correct 77 ms 16008 KB Output is correct
18 Correct 41 ms 15228 KB Output is correct
19 Correct 80 ms 15960 KB Output is correct
20 Correct 32 ms 10352 KB Output is correct
21 Correct 68 ms 15748 KB Output is correct
22 Correct 55 ms 15904 KB Output is correct
23 Correct 44 ms 15200 KB Output is correct
24 Correct 42 ms 15432 KB Output is correct
25 Correct 57 ms 15552 KB Output is correct
26 Correct 58 ms 15552 KB Output is correct
27 Correct 41 ms 15180 KB Output is correct
28 Correct 42 ms 15204 KB Output is correct
29 Correct 46 ms 15300 KB Output is correct
30 Correct 48 ms 15132 KB Output is correct
31 Correct 82 ms 15972 KB Output is correct
32 Correct 45 ms 15224 KB Output is correct
33 Correct 3 ms 4944 KB Output is correct
34 Correct 87 ms 15764 KB Output is correct
35 Correct 44 ms 15180 KB Output is correct
36 Correct 74 ms 15804 KB Output is correct
37 Correct 46 ms 15288 KB Output is correct
38 Correct 40 ms 15256 KB Output is correct
39 Correct 63 ms 15608 KB Output is correct
40 Correct 45 ms 15172 KB Output is correct
41 Correct 59 ms 15464 KB Output is correct
42 Correct 58 ms 15484 KB Output is correct
43 Correct 58 ms 15488 KB Output is correct
44 Correct 65 ms 15736 KB Output is correct
45 Correct 67 ms 15676 KB Output is correct
46 Correct 74 ms 16036 KB Output is correct
47 Correct 55 ms 15608 KB Output is correct
48 Correct 52 ms 15400 KB Output is correct
49 Correct 86 ms 16020 KB Output is correct
50 Correct 42 ms 15176 KB Output is correct
51 Correct 70 ms 15644 KB Output is correct
52 Correct 75 ms 15996 KB Output is correct
53 Correct 42 ms 15108 KB Output is correct
54 Correct 54 ms 15708 KB Output is correct
55 Correct 88 ms 16024 KB Output is correct
56 Correct 38 ms 15176 KB Output is correct
57 Correct 53 ms 15360 KB Output is correct
58 Correct 58 ms 15428 KB Output is correct
59 Correct 61 ms 15532 KB Output is correct
60 Correct 51 ms 15556 KB Output is correct
61 Correct 37 ms 15104 KB Output is correct
62 Correct 43 ms 15196 KB Output is correct
63 Correct 38 ms 15088 KB Output is correct
64 Correct 46 ms 15176 KB Output is correct
65 Correct 48 ms 15176 KB Output is correct
66 Correct 41 ms 15096 KB Output is correct
67 Correct 46 ms 15084 KB Output is correct
68 Correct 43 ms 15152 KB Output is correct
69 Correct 42 ms 15192 KB Output is correct
70 Correct 54 ms 15112 KB Output is correct
71 Partially correct 86 ms 16072 KB Partially correct - number of queries: 5186
72 Correct 51 ms 15556 KB Output is correct
73 Partially correct 70 ms 16016 KB Partially correct - number of queries: 5129
74 Partially correct 74 ms 16032 KB Partially correct - number of queries: 5155
75 Correct 39 ms 15176 KB Output is correct
76 Correct 78 ms 16108 KB Output is correct
77 Correct 94 ms 15992 KB Output is correct
78 Correct 43 ms 15436 KB Output is correct
79 Correct 61 ms 15992 KB Output is correct
80 Correct 69 ms 15972 KB Output is correct
81 Correct 60 ms 16028 KB Output is correct
82 Correct 83 ms 16068 KB Output is correct
83 Correct 49 ms 15304 KB Output is correct
84 Correct 62 ms 15976 KB Output is correct
85 Correct 79 ms 16064 KB Output is correct
86 Correct 57 ms 15944 KB Output is correct
87 Correct 39 ms 15368 KB Output is correct
88 Correct 56 ms 15884 KB Output is correct
89 Correct 43 ms 15936 KB Output is correct
90 Correct 40 ms 15232 KB Output is correct
91 Correct 47 ms 15832 KB Output is correct
92 Correct 50 ms 15944 KB Output is correct
93 Correct 62 ms 15980 KB Output is correct
94 Correct 83 ms 15988 KB Output is correct
95 Correct 75 ms 16032 KB Output is correct
96 Correct 70 ms 16036 KB Output is correct
97 Correct 40 ms 15184 KB Output is correct