oj.uz

Submission #526112

# Submission time Handle Problem Language Result Execution time Memory
526112 2022-02-13T18:40:14 Z Deepesson Rice Hub (IOI11_ricehub) C++17
42 / 100
 610 ms 3036 KB 
#include <bits/stdc++.h>
#include "ricehub.h"
typedef std::pair<long long,long long> pli;
typedef std::pair<pli,long long> ppl;
ppl custo(long long P,long long R,int X[],long long B){
    if(P<1)P=1;
    std::vector<long long> vec;
    for(int i=0;i!=R;++i){
        long long dist = abs(X[i]-P);
        vec.push_back(dist);
    }
    std::sort(vec.begin(),vec.end());
    int res=0;long long u=0;
    for(auto&x:vec){
        if(x<=B){
            ++res;
            B-=x;
            continue;
        }else {u=x;break;}
    }
    return {{res,B},(1LL<<60LL)-u};
}
int besthub(int R, int L, int X[], long long B)
{
   int la=1,ra=L-1;
   while(ra-la>1){
        int m = (la+ra)/2;
        ppl alpha = custo(m,R,X,B);
        ppl beta = custo(m+1,R,X,B);
        if(alpha>beta){
            ra=m;
        }else {la=m;}
   }
   ppl ans={{0,0},0};
   for(int i=-5;i!=6;++i){
        ans=std::max(ans,custo(std::min(la+i,L),R,X,B));
   }
   return std::max(ans.first.first,std::max(custo(1,R,X,B).first.first,custo(L,R,X,B).first.first));
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 3 ms 204 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 2 ms 204 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Incorrect 1 ms 204 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 808 KB Output is correct
2 Correct 23 ms 796 KB Output is correct
3 Correct 575 ms 2560 KB Output is correct
4 Correct 610 ms 2560 KB Output is correct
5 Correct 72 ms 1444 KB Output is correct
6 Correct 73 ms 1448 KB Output is correct
7 Correct 303 ms 2508 KB Output is correct
8 Correct 345 ms 3036 KB Output is correct
9 Correct 67 ms 1448 KB Output is correct
10 Correct 67 ms 1476 KB Output is correct
11 Correct 600 ms 2856 KB Output is correct
12 Correct 580 ms 2488 KB Output is correct
13 Incorrect 116 ms 1520 KB Output isn't correct
14 Halted 0 ms 0 KB -