oj.uz

Submission #1003232

# Submission time Handle Problem Language Result Execution time Memory
1003232 2024-06-20T08:05:07 Z ayankarimova Rice Hub (IOI11_ricehub) C++14
0 / 100
 19 ms 860 KB 
#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
const ll sz=5005;
ll a[sz], b[sz], d[sz], s[sz];
int besthub(int r, int l, int x[], long long k)
{
    sort(x, x+r);
    for(int i=1; i<=l; i++){
        for(int j=0; j<r; j++){
            if(i<x[j])  break;
            d[i]+=i-x[j];
        }
        //cout<<d[i]<<' ';
    }
    for(int i=0; i<r; i++) s[x[i]]++;
    for(int i=1; i<=l; i++) s[i]+=s[i-1];
    ll ans=0;
    for(int i=0; i<r; i++){
        for(int j=i; j<r; j++){
            ll m=(x[i]+x[j])/2;
            ll num1=(d[m]-d[x[i]])-i*(m-x[i]);
            ll num2=(d[x[j]]-d[m])-(s[m]-1)*(x[j]-m);
            if(num1+num2<=k){
                ans=max(ans, (ll)j-i+1);
                //cout<<i<<' '<<j<<' '<<num1<<' '<<num2<<' '<<ans<<endl;
            }
            m=(x[i]+x[j])/2+1;
            num1=(d[m]-d[x[i]])-i*(m-x[i]);
            num2=(d[x[j]]-d[m])-(s[m]-1)*(x[j]-m);
            if(num1+num2<=k){
                ans=max(ans, (ll)j-i+1);
                //cout<<i<<' '<<j<<' '<<num1<<' '<<num2<<' '<<ans<<endl;
            }
        }
    }
    return ans;
}
/*
{} []
5 20 6

1 2 10 12 14 3
*/

Subtask #1
0 / 17.0

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

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 440 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 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 Incorrect 0 ms 348 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

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

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Runtime error 19 ms 860 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -