oj.uz

Submission #1003157

# Submission time Handle Problem Language Result Execution time Memory
1003157 2024-06-20T06:59:08 Z vjudge1 Rice Hub (IOI11_ricehub) C++17
0 / 100
 2 ms 604 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define pf push_front
#define pb push_back
#define pi pair<int,int>
#define vi vector<int>

/*
int besthub(int n, int last, int x[], ll b){
    

    int ans = 0;
    int l , r;
    for(int i = 0; i < n; i++){
        
        l = i - (lower_bound(x.begin(), x.end(), max(0LL,x[i]-b))- x.begin());
        r =  upper_bound(x.begin(), x.end(), min((ll) last, x[i]+b)) - x.begin() - (i+1);
       // cout << x[i] << " " <<l << " " << r << endl;
        ans = max(l+r+1,ans);
    }
    
    return ans;

}

*/

int besthub(int n, int last, int x[], ll b){
    

    ll ans = 0;
    
    ll cnt;
    int pref[n];
    pref[0] = 0;
    
    for(int i = 1; i  < n; i++){
      //  cout << i << "  "<< x[i] << " " << x[i-1]<<endl;
        pref[i] = pref[i-1] + (x[i]-x[i-1]);
    }
    
    ll l = 0, r =0;
    ll final = 1;
    
    while(r<n && l<n){
       // cout <<"COr " << l << " " << r << endl;
        //cout << pref[l] << " " << pref[r]<<endl;
        if(pref[r]-pref[l]<= b){
           // cout << l << " " << r << endl;
           
            final = max(final,r-l+1);
             r++;
        }
        else{
            while(pref[r]-pref[l]>b && l<r){
                l++;
            }
            
        }
    }
    
    return final;

}

Compilation message

ricehub.cpp: In function 'int besthub(int, int, int*, long long int)':
ricehub.cpp:34:8: warning: unused variable 'ans' [-Wunused-variable]
   34 |     ll ans = 0;
      |        ^~~
ricehub.cpp:36:8: warning: unused variable 'cnt' [-Wunused-variable]
   36 |     ll cnt;
      |        ^~~

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 448 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 604 KB Output isn't correct
2 Halted 0 ms 0 KB -