oj.uz

Submission #1086957

# Submission time Handle Problem Language Result Execution time Memory
1086957 2024-09-11T21:20:02 Z MrPavlito Rice Hub (IOI11_ricehub) C++17
43 / 100
 79 ms 856 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;
    if(n <= 5000)
    {
        int mx = 0;
        for(int i=0; i<n; i++)
        {
            int l = i;
            int r = i;
            long long trsum = 0;
            while(trsum < B)
            {
                if(l == 0 && r!=n-1 && trsum + (X[r+1] - X[i]) <= B)
                {
                    while(r<n-1)
                    {
                        if(trsum + (X[r+1] - X[i]) <= B)
                        {
                            trsum += (X[++r] - X[i]);
                        }
                        else break;
                    }
                }
                else if(r == n-1 && l!=0 && trsum + (X[i] - X[l-1]) <= B)
                {
                    while(l> 0)
                    {
                        if(trsum + (X[i] - X[l-1]) <= B)
                        {
                            trsum += (X[i] - X[--l]);
                        }
                        else break;
                    }

                }
                else if(l!=0 && r!=n-1 && (X[i] - X[l-1]) > (X[r+1] - X[i]) && trsum+(X[r+1] - X[i])<=B)
                {
                    trsum+=(X[++r] - X[i]);
                }
                else if(l!=0 && r!=n-1 && trsum+(X[i] - X[l-1])<=B)
                {
                    trsum+=(X[i] - X[--l]);
                }
                else break;
            }
            mx = max(mx, r-l+1);
        }
        return mx;
    }
    else
    {
        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(trsum > B && l<i && 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 0 ms 344 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 348 KB Output is correct
2 Correct 0 ms 344 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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Incorrect 0 ms 348 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
26.0 / 26.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 1 ms 348 KB Output is correct
4 Correct 2 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 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 3 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 3 ms 348 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 3 ms 348 KB Output is correct
21 Correct 2 ms 360 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 34 ms 348 KB Output is correct
24 Correct 28 ms 472 KB Output is correct
25 Correct 74 ms 484 KB Output is correct
26 Correct 79 ms 344 KB Output is correct
27 Correct 20 ms 348 KB Output is correct
28 Correct 25 ms 348 KB Output is correct

Subtask #4
0 / 32.0

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