oj.uz

답안 #880560

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
880560 2023-11-29T16:19:49 Z andro 쌀 창고 (IOI11_ricehub) C++14
68 / 100
 1000 ms 984 KB 
#include <bits/stdc++.h>
#include "ricehub.h"
//#define int long long
using namespace std;
const int N=1e6+5;
struct fenw{
    int t[N];
    int query(int i){int ans=0;for(;i>0;i-=i&-i)ans+=t[i];return ans;}
    void update(int i,int v){for(;i<N;i+=i&-i)t[i]+=v;}
    int query(int l,int r){return query(r)-query(l-1);}
};
int besthub(int R, int L, int X[], long long B){
    int ans=0;
    for(int i=1;i<=R;i++){
        vector<int>v;
        for(int j=1;j<=R;j++)v.push_back(abs(X[i]-X[j]));
        long long l=0LL,r=100000000000LL,p=0;
        while(l<=r){
            long long mid=(l+r)/2;
            long long c=0;
            for(int j=1;j<=R;j++){
                if(X[j]>=X[i]&&X[j]<=X[i]+mid){
                    c+=X[j]-X[i];
                }
                else if(X[j]<=X[i]&&X[j]>=X[i]-mid&&X[j]<=X[i]){
                    c+=X[i]-X[j];
                }
            }
            if(c<=B){
                l=mid+1;
                p=mid;
            }
            else {
                r=mid-1;
            }
        }
        int u=0;
        long long c=0;
        for(int j=1;j<=R;j++){
            if(abs(X[i]-X[j])<=p)c+=abs(X[i]-X[j]);
            if(abs(X[i]-X[j])<=p)u++;
        }
        for(int j=1;j<=R;j++){
            if(abs(X[i]-X[j])==p+1){
                c+=abs(X[i]-X[j]);
                if(c<=B)u++;
            }
        }
        //! kolko ih ima na intervalu [a[i],a[i]+mid]+[a[i]-mid,a[i]]
        ans=max(ans,u);
    }
    return ans;
}/*
signed main(){
    int X[4]={0,10,12,14};
    cout<<besthub(3,14,X,6);
}*/
/*
1 3
2 3
3 3
3
*/

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 500 KB Output is correct
20 Correct 1 ms 600 KB Output is correct
21 Correct 11 ms 452 KB Output is correct
22 Correct 13 ms 604 KB Output is correct
23 Correct 13 ms 444 KB Output is correct
24 Correct 10 ms 344 KB Output is correct
25 Correct 10 ms 452 KB Output is correct
26 Correct 10 ms 348 KB Output is correct
27 Correct 12 ms 348 KB Output is correct
28 Correct 10 ms 348 KB Output is correct

Subtask #3
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 440 KB Output is correct
3 Correct 27 ms 460 KB Output is correct
4 Correct 32 ms 348 KB Output is correct
5 Correct 12 ms 348 KB Output is correct
6 Correct 10 ms 348 KB Output is correct
7 Correct 42 ms 348 KB Output is correct
8 Correct 40 ms 348 KB Output is correct
9 Correct 10 ms 348 KB Output is correct
10 Correct 11 ms 348 KB Output is correct
11 Correct 25 ms 344 KB Output is correct
12 Correct 25 ms 352 KB Output is correct
13 Correct 35 ms 348 KB Output is correct
14 Correct 38 ms 348 KB Output is correct
15 Correct 11 ms 348 KB Output is correct
16 Correct 10 ms 348 KB Output is correct
17 Correct 22 ms 348 KB Output is correct
18 Correct 25 ms 348 KB Output is correct
19 Correct 33 ms 344 KB Output is correct
20 Correct 37 ms 344 KB Output is correct
21 Correct 981 ms 520 KB Output is correct
22 Correct 986 ms 520 KB Output is correct
23 Correct 822 ms 528 KB Output is correct
24 Correct 912 ms 528 KB Output is correct
25 Correct 901 ms 596 KB Output is correct
26 Correct 896 ms 348 KB Output is correct
27 Correct 909 ms 596 KB Output is correct
28 Correct 978 ms 596 KB Output is correct

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1062 ms 984 KB Time limit exceeded
2 Halted 0 ms 0 KB -