oj.uz

Submission #848855

# Submission time Handle Problem Language Result Execution time Memory
848855 2023-09-13T15:58:12 Z Mr_Ph Rice Hub (IOI11_ricehub) C++14
100 / 100
 12 ms 4444 KB 
#include "ricehub.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
#define ll long long
#define sz size()
using namespace std;
int besthub(int r, int l, int arr[], long long b)
{
    int p1=0,p2=0;
    vector<ll>prf(r);
    prf[0]=arr[0];
    for(int i=1;i<r;i++)
        prf[i]=prf[i-1]+arr[i];
    int ans=0,ans1=0;
    while(p1<r)
    {
        while(p2<r)
        {
            int idx=(p1+p2)/2;
            ll left=(idx==0?0:prf[idx-1]),right=prf[p2]-prf[idx];
            if(p1!=0)left-=prf[p1-1];
            ll val=arr[idx];
            //int test=left;
            left=val*(idx-p1)-left;
            right-=val*(p2-idx);
            if(right+left<=b){
               // cout<<p1<<" "<<p2<<" "<<left<<" "<<right<<endl;
               ans=max(ans,(p2-p1+1));
                p2++;
            }
            else break;
        }
        p1++;
    }
    return ans;
}

Compilation message

ricehub.cpp: In function 'int besthub(int, int, int*, long long int)':
ricehub.cpp:14:15: warning: unused variable 'ans1' [-Wunused-variable]
   14 |     int ans=0,ans1=0;
      |               ^~~~

Subtask #1
17.0 / 17.0

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

Subtask #2
25.0 / 25.0

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

Subtask #3
26.0 / 26.0

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

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 2 ms 600 KB Output is correct
3 Correct 10 ms 3416 KB Output is correct
4 Correct 9 ms 3416 KB Output is correct
5 Correct 5 ms 3160 KB Output is correct
6 Correct 5 ms 3416 KB Output is correct
7 Correct 9 ms 4184 KB Output is correct
8 Correct 10 ms 4184 KB Output is correct
9 Correct 5 ms 3160 KB Output is correct
10 Correct 4 ms 3164 KB Output is correct
11 Correct 10 ms 4444 KB Output is correct
12 Correct 10 ms 4432 KB Output is correct
13 Correct 5 ms 3416 KB Output is correct
14 Correct 5 ms 3416 KB Output is correct
15 Correct 7 ms 3928 KB Output is correct
16 Correct 7 ms 3932 KB Output is correct
17 Correct 9 ms 4184 KB Output is correct
18 Correct 9 ms 4328 KB Output is correct
19 Correct 12 ms 4444 KB Output is correct
20 Correct 9 ms 4300 KB Output is correct