oj.uz

답안 #781940

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
781940 2023-07-13T14:00:32 Z TheSahib 커다란 상품 (IOI17_prize) C++14
92.88 / 100
 90 ms 16240 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(1000, (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 49 ms 15100 KB Output is correct
2 Correct 39 ms 15188 KB Output is correct
3 Correct 47 ms 15204 KB Output is correct
4 Correct 45 ms 15104 KB Output is correct
5 Correct 40 ms 15212 KB Output is correct
6 Correct 39 ms 15208 KB Output is correct
7 Correct 44 ms 15144 KB Output is correct
8 Correct 39 ms 15188 KB Output is correct
9 Correct 44 ms 15168 KB Output is correct
10 Correct 42 ms 15104 KB Output is correct

Subtask #2
72.88 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 15184 KB Output is correct
2 Correct 41 ms 15184 KB Output is correct
3 Correct 43 ms 15152 KB Output is correct
4 Correct 44 ms 15168 KB Output is correct
5 Correct 39 ms 15208 KB Output is correct
6 Correct 41 ms 15092 KB Output is correct
7 Correct 39 ms 15188 KB Output is correct
8 Correct 45 ms 15132 KB Output is correct
9 Correct 46 ms 15196 KB Output is correct
10 Correct 46 ms 15144 KB Output is correct
11 Correct 43 ms 15336 KB Output is correct
12 Correct 54 ms 15484 KB Output is correct
13 Correct 45 ms 15204 KB Output is correct
14 Correct 8 ms 6096 KB Output is correct
15 Correct 70 ms 15896 KB Output is correct
16 Correct 52 ms 15268 KB Output is correct
17 Partially correct 79 ms 16072 KB Partially correct - number of queries: 5104
18 Correct 42 ms 15164 KB Output is correct
19 Correct 82 ms 16096 KB Output is correct
20 Correct 40 ms 10348 KB Output is correct
21 Correct 51 ms 15796 KB Output is correct
22 Correct 55 ms 15896 KB Output is correct
23 Correct 41 ms 15300 KB Output is correct
24 Correct 42 ms 15428 KB Output is correct
25 Correct 55 ms 15584 KB Output is correct
26 Correct 67 ms 15504 KB Output is correct
27 Correct 40 ms 15236 KB Output is correct
28 Correct 42 ms 15180 KB Output is correct
29 Correct 47 ms 15240 KB Output is correct
30 Correct 46 ms 15172 KB Output is correct
31 Partially correct 56 ms 16084 KB Partially correct - number of queries: 5092
32 Correct 41 ms 15280 KB Output is correct
33 Correct 3 ms 4944 KB Output is correct
34 Correct 74 ms 15728 KB Output is correct
35 Correct 39 ms 15228 KB Output is correct
36 Correct 59 ms 15964 KB Output is correct
37 Correct 45 ms 15404 KB Output is correct
38 Correct 44 ms 15316 KB Output is correct
39 Correct 53 ms 15692 KB Output is correct
40 Correct 46 ms 15228 KB Output is correct
41 Correct 60 ms 15600 KB Output is correct
42 Correct 46 ms 15540 KB Output is correct
43 Correct 54 ms 15516 KB Output is correct
44 Correct 65 ms 15736 KB Output is correct
45 Correct 60 ms 15784 KB Output is correct
46 Partially correct 77 ms 16004 KB Partially correct - number of queries: 5109
47 Correct 62 ms 15660 KB Output is correct
48 Correct 52 ms 15480 KB Output is correct
49 Correct 84 ms 16240 KB Output is correct
50 Correct 46 ms 15164 KB Output is correct
51 Correct 56 ms 15668 KB Output is correct
52 Partially correct 67 ms 16084 KB Partially correct - number of queries: 5062
53 Correct 47 ms 15184 KB Output is correct
54 Correct 64 ms 15680 KB Output is correct
55 Partially correct 83 ms 15996 KB Partially correct - number of queries: 5090
56 Correct 40 ms 15208 KB Output is correct
57 Correct 54 ms 15360 KB Output is correct
58 Correct 54 ms 15356 KB Output is correct
59 Correct 62 ms 15512 KB Output is correct
60 Correct 47 ms 15696 KB Output is correct
61 Correct 44 ms 15096 KB Output is correct
62 Correct 52 ms 15280 KB Output is correct
63 Correct 42 ms 15188 KB Output is correct
64 Correct 44 ms 15136 KB Output is correct
65 Correct 43 ms 15096 KB Output is correct
66 Correct 56 ms 15172 KB Output is correct
67 Correct 49 ms 15176 KB Output is correct
68 Correct 45 ms 15228 KB Output is correct
69 Correct 42 ms 15228 KB Output is correct
70 Correct 49 ms 15100 KB Output is correct
71 Partially correct 84 ms 16096 KB Partially correct - number of queries: 5712
72 Correct 48 ms 15432 KB Output is correct
73 Partially correct 90 ms 16084 KB Partially correct - number of queries: 5655
74 Partially correct 78 ms 16032 KB Partially correct - number of queries: 5673
75 Correct 44 ms 15244 KB Output is correct
76 Partially correct 71 ms 16080 KB Partially correct - number of queries: 5080
77 Partially correct 78 ms 16072 KB Partially correct - number of queries: 5153
78 Correct 47 ms 15476 KB Output is correct
79 Correct 65 ms 15944 KB Output is correct
80 Partially correct 58 ms 16072 KB Partially correct - number of queries: 5187
81 Partially correct 83 ms 16084 KB Partially correct - number of queries: 5146
82 Partially correct 79 ms 16236 KB Partially correct - number of queries: 5153
83 Correct 41 ms 15228 KB Output is correct
84 Correct 66 ms 15988 KB Output is correct
85 Partially correct 84 ms 16092 KB Partially correct - number of queries: 5167
86 Correct 47 ms 16096 KB Output is correct
87 Correct 49 ms 15412 KB Output is correct
88 Correct 46 ms 15968 KB Output is correct
89 Correct 40 ms 15952 KB Output is correct
90 Correct 45 ms 15184 KB Output is correct
91 Correct 47 ms 15948 KB Output is correct
92 Correct 43 ms 15984 KB Output is correct
93 Correct 68 ms 15972 KB Output is correct
94 Correct 73 ms 15968 KB Output is correct
95 Correct 65 ms 16044 KB Output is correct
96 Correct 67 ms 15988 KB Output is correct
97 Correct 47 ms 15196 KB Output is correct