답안 #966353

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
966353 2024-04-19T17:59:54 Z bachhoangxuan 커다란 상품 (IOI17_prize) C++17
99.63 / 100
32 ms 7220 KB
#include "prize.h"
#include<bits/stdc++.h>
using namespace std;

const int B = 512;
const int maxn = 2e5+5;

vector<int> res[maxn];
vector<int> get(int x){
    if(!res[x].empty()) return res[x];
    res[x]=ask(x);res[x][1]+=res[x][0];
    return res[x];
}

int N,bit[maxn],Max;
void update(int x){
    for(int i=x+1;i<=N;i+=(i&(-i))) bit[i]++;
}
int query(int x){
    int ans=0;
    for(int i=x+1;i>=1;i-=(i&(-i))) ans+=bit[i];
    return ans;
}

int find_best(int n){
    N=n;
    for(int i=0;i<480;i++){
        vector<int> cc=get(i);
        if(cc[1]==0) return i;
        Max=max(Max,cc[1]);
    }
    for(int i=0;i<n;i+=B){
        vector<int> p;
        for(int j=i;j<min(i+B,n);j++) p.push_back(j);
        int cnt=0;
        while(!p.empty()){
            int x=p.back();p.pop_back();
            vector<int> cc=get(x);
            if(cc[1]==0) return x;
            if(cc[1]<Max) update(x);
            else{
                cnt=cc[0]-query(x);
                break;
            }
        }
        while(cnt){
            int l=0,r=(int)p.size()-1;
            bool check=false;
            while(l<=r){
                int mid=(l+r)>>1;
                vector<int> cc=get(p[mid]);
                if(cc[1]==0) return p[mid];
                if(cc[1]<Max){
                    update(p[mid]);
                    p.erase(p.begin()+mid);
                    check=true;
                    break;
                }
                if(cc[0]-query(p[mid])) r=mid-1;
                else l=mid+1;
            }
            cnt--;
        }
    }
	return -1;
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:48:18: warning: variable 'check' set but not used [-Wunused-but-set-variable]
   48 |             bool check=false;
      |                  ^~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5996 KB Output is correct
2 Correct 4 ms 5764 KB Output is correct
3 Correct 4 ms 6004 KB Output is correct
4 Correct 6 ms 5764 KB Output is correct
5 Correct 5 ms 6012 KB Output is correct
6 Correct 2 ms 5720 KB Output is correct
7 Correct 5 ms 5992 KB Output is correct
8 Correct 4 ms 6008 KB Output is correct
9 Correct 5 ms 6252 KB Output is correct
10 Correct 5 ms 5768 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6252 KB Output is correct
2 Correct 5 ms 6012 KB Output is correct
3 Correct 6 ms 6008 KB Output is correct
4 Correct 5 ms 5756 KB Output is correct
5 Correct 5 ms 5748 KB Output is correct
6 Correct 2 ms 5720 KB Output is correct
7 Correct 5 ms 6012 KB Output is correct
8 Correct 5 ms 6012 KB Output is correct
9 Correct 5 ms 6204 KB Output is correct
10 Correct 5 ms 5768 KB Output is correct
11 Correct 5 ms 6284 KB Output is correct
12 Correct 3 ms 6000 KB Output is correct
13 Correct 7 ms 6288 KB Output is correct
14 Correct 5 ms 5996 KB Output is correct
15 Correct 7 ms 6264 KB Output is correct
16 Correct 15 ms 6640 KB Output is correct
17 Correct 3 ms 6000 KB Output is correct
18 Correct 17 ms 6472 KB Output is correct
19 Correct 3 ms 5996 KB Output is correct
20 Correct 7 ms 6336 KB Output is correct
21 Correct 10 ms 6868 KB Output is correct
22 Correct 5 ms 6288 KB Output is correct
23 Correct 4 ms 6256 KB Output is correct
24 Correct 3 ms 6000 KB Output is correct
25 Correct 13 ms 6300 KB Output is correct
26 Correct 16 ms 6456 KB Output is correct
27 Correct 5 ms 5996 KB Output is correct
28 Correct 21 ms 6492 KB Output is correct
29 Correct 19 ms 6668 KB Output is correct
30 Correct 20 ms 6600 KB Output is correct
31 Correct 4 ms 5992 KB Output is correct
32 Correct 6 ms 6288 KB Output is correct
33 Correct 2 ms 5720 KB Output is correct
34 Correct 10 ms 6396 KB Output is correct
35 Correct 4 ms 6016 KB Output is correct
36 Correct 6 ms 6068 KB Output is correct
37 Correct 4 ms 6044 KB Output is correct
38 Correct 5 ms 6252 KB Output is correct
39 Correct 16 ms 6052 KB Output is correct
40 Correct 21 ms 7196 KB Output is correct
41 Correct 15 ms 6248 KB Output is correct
42 Correct 14 ms 6228 KB Output is correct
43 Correct 14 ms 6592 KB Output is correct
44 Correct 9 ms 6316 KB Output is correct
45 Correct 9 ms 7120 KB Output is correct
46 Correct 4 ms 5748 KB Output is correct
47 Correct 14 ms 6220 KB Output is correct
48 Correct 17 ms 6472 KB Output is correct
49 Correct 5 ms 6036 KB Output is correct
50 Correct 21 ms 6544 KB Output is correct
51 Correct 10 ms 6484 KB Output is correct
52 Correct 4 ms 6000 KB Output is correct
53 Correct 5 ms 6516 KB Output is correct
54 Correct 13 ms 6628 KB Output is correct
55 Correct 4 ms 5748 KB Output is correct
56 Correct 24 ms 6720 KB Output is correct
57 Correct 25 ms 6296 KB Output is correct
58 Correct 14 ms 6936 KB Output is correct
59 Correct 15 ms 6700 KB Output is correct
60 Correct 13 ms 6736 KB Output is correct
61 Correct 5 ms 5756 KB Output is correct
62 Correct 4 ms 5996 KB Output is correct
63 Correct 6 ms 6252 KB Output is correct
64 Correct 4 ms 6012 KB Output is correct
65 Correct 7 ms 6296 KB Output is correct
66 Correct 6 ms 6016 KB Output is correct
67 Correct 5 ms 5756 KB Output is correct
68 Correct 3 ms 6000 KB Output is correct
69 Correct 6 ms 6016 KB Output is correct
70 Correct 8 ms 6012 KB Output is correct
71 Partially correct 29 ms 6748 KB Partially correct - number of queries: 5037
72 Correct 7 ms 6020 KB Output is correct
73 Correct 32 ms 7004 KB Output is correct
74 Partially correct 29 ms 6368 KB Partially correct - number of queries: 5005
75 Correct 6 ms 6024 KB Output is correct
76 Correct 26 ms 6364 KB Output is correct
77 Correct 29 ms 6460 KB Output is correct
78 Correct 7 ms 6032 KB Output is correct
79 Correct 19 ms 6248 KB Output is correct
80 Correct 25 ms 6244 KB Output is correct
81 Correct 22 ms 7220 KB Output is correct
82 Correct 23 ms 7020 KB Output is correct
83 Correct 7 ms 6252 KB Output is correct
84 Correct 21 ms 6704 KB Output is correct
85 Correct 22 ms 6496 KB Output is correct
86 Correct 6 ms 6252 KB Output is correct
87 Correct 6 ms 6512 KB Output is correct
88 Correct 6 ms 6512 KB Output is correct
89 Correct 6 ms 6260 KB Output is correct
90 Correct 8 ms 6032 KB Output is correct
91 Correct 6 ms 6256 KB Output is correct
92 Correct 5 ms 6248 KB Output is correct
93 Correct 7 ms 6048 KB Output is correct
94 Correct 6 ms 6300 KB Output is correct
95 Correct 7 ms 6552 KB Output is correct
96 Correct 6 ms 6000 KB Output is correct
97 Correct 5 ms 6040 KB Output is correct