oj.uz

Submission #1086951

# Submission time Handle Problem Language Result Execution time Memory
1086951 2024-09-11T20:48:37 Z MrPavlito Rice Hub (IOI11_ricehub) C++17
17 / 100
 9 ms 860 KB 
#include "ricehub.h"
#include <bits/stdc++.h>
//#define int long long
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define sc second
#define endl "\n"
#define pii pair<int,int>


using namespace std;

const int MAXN = 1e5+5;
const int mod7 = 1e9+7;
const long long inf = 1e18;

int n;

int besthub(int R, int L, int X[], long long B)
{
    n = R;
    int l = 0;int r =1;
    int i =0;
    long long trsum = 0;
    int cntr = 0;
    int cntl =0;
    int mx = 0;
    while(r<n)
    {
        while(r<n)
        {
            if(trsum+ X[r] - X[i] <= B)
            {
                trsum+= X[r++] - X[i];
                cntr++;
            }
            else if(i<l && X[r] - X[i] < X[i] - X[l] && trsum+ (X[r] - X[i]) - (X[i] - X[l]) <= B)
            {

                trsum -= (X[i] - X[l]);
                trsum += (X[r] - X[i]);
                l++;
                r++;
            }
            else if(trsum >= B && l<i)
            {
                cntl--;
                trsum -= (X[i] - X[l++]);
            }
            else break;
        }
        mx = max(mx, r-l);
        i++;
        trsum += (i-l) *1ll * (X[i] - X[i-1]);
        trsum -= (r-i) *1ll * (X[i] - X[i-1]);

    }
    return mx;
}

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 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 25.0

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

Subtask #3
0 / 26.0

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

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 9 ms 740 KB Output is correct
4 Correct 8 ms 688 KB Output is correct
5 Correct 4 ms 604 KB Output is correct
6 Correct 4 ms 604 KB Output is correct
7 Correct 7 ms 824 KB Output is correct
8 Correct 7 ms 600 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 4 ms 604 KB Output is correct
11 Correct 8 ms 604 KB Output is correct
12 Correct 9 ms 624 KB Output is correct
13 Incorrect 5 ms 860 KB Output isn't correct
14 Halted 0 ms 0 KB -