oj.uz

Submission #405348

# Submission time Handle Problem Language Result Execution time Memory
405348 2021-05-16T09:26:04 Z Andyvanh1 Rice Hub (IOI11_ricehub) C++14
0 / 100
 470 ms 560 KB 
#include <iostream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>

using namespace std;

#define vt vector
#define pb push_back
#define all(x) x.begin(),x.end()

typedef vt<int> vi;
typedef long long ll;
typedef pair<int,int> pii;

ll prefsum[100005];

int besthub(int r, int l, int x[], ll b){
    prefsum[0] = 0;
    for(int i = 1; i <= r; i++){
        prefsum[i] = prefsum[i-1]+x[i-1];
    }
    int ans = 1;
    for(int i = 0; i < r; i++){
        for(int j = i+ans; j < r; j++){
            int mid = (i+j)>>1;
            ll n = x[mid]*(2*mid-j-i+1)-(prefsum[mid+1]-prefsum[i])+(prefsum[j+1]-prefsum[mid+1]);
            if(n < b){
                cout<<n<<" "<<b<<'\n';
                ans = max(ans,j-i+1);
            }
        }
    }
    return ans;


}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 204 KB Output is correct
2 Incorrect 1 ms 204 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 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 256 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

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

Subtask #4
0 / 32.0

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