oj.uz

Submission #614236

# Submission time Handle Problem Language Result Execution time Memory
614236 2022-07-30T22:54:50 Z nohaxjustsoflo Rice Hub (IOI11_ricehub) C++17
49 / 100
 18 ms 2516 KB 
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<ll,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> order_set;
mt19937 mt_rand(chrono::high_resolution_clock::now().time_since_epoch().count());
//uniform_int_distribution<int> gen; ///(min, max)
//int random() {return gen(mt_rand);}
const int mxN=1e5+5;
const int mod=998244353;
const int mxlogN=40;
const int mxK=26;
const int inf=2e9;
const int K=600;
ll a[mxN];
//#include "ricehub.h"
int besthub(int n, int L, int A[], ll B)
{
    for(int i=0; i<n; i++) a[i]=A[i];
    ll ans=1,l=0,r=1;
    for(ll i=0; i<n; i++)
    {
        if(i)
        {
            B+=(r-i)*(a[i]-a[i-1]);
            B-=(i-l)*(a[i]-a[i-1]);
        }
        while(l<i&&B<0) B+=a[i]-a[l++];
        while(1)
        {
            while(r<n&&a[r]-a[i]<=B) B-=a[r++]-a[i];
            ans=max(ans,r-l);
            bool ok=1;
            while(l<i&&r<n&&a[i]-a[l]>a[r]-a[i])
            {
                B+=a[i]-a[l++];
                B-=a[r++]-a[i];
                ok=0;
            }
            if(ok) break;
        }
    }
    return ans;
}
/*
int besthub2(int n, int L, int X[], ll B)
{
    int ans=0;
    for(int i=0; i<n; i++)
    {
        int p=X[i];
        vector<int> a(n);
        for(int i=0; i<n; i++) a[i]=abs(X[i]-p);
        sort(a.begin(),a.end());
        ll x=B;
        int j=0;
        while(j<n&&a[j]<=x) x-=a[j++];
        ans=max(ans,j);
    }
    return ans;
}
*/
/*
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n, L, B; cin >> n >> L >> B;
    int a[n];
    for(int i=0; i<n; i++) cin >> a[i];
    cout << besthub(n,L,a,B);
    return 0;
    /*
    int n=mt_rand()%5+1, L=0, B=mt_rand()%10;
    int a[n];
    for(int i=0; i<n; i++) a[i]=mt_rand()%15;
    sort(a,a+n);
    if(besthub(n,L,a,B)!=besthub2(n,L,a,B))
    {
        cout << n << " " << B << "\n";
        for(int i=0; i<n; i++) cout << a[i] << " ";
        cout << "\n";
    }
}
*/
/*
5 0 0
1 5 10 11 13
*/

Compilation message

ricehub.cpp:79:5: warning: "/*" within comment [-Wcomment]
   79 |     /*
      |

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 320 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 276 KB Output is correct
3 Correct 0 ms 320 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 316 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 296 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 320 KB Output is correct
21 Correct 1 ms 320 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Incorrect 1 ms 212 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 316 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Incorrect 1 ms 324 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 468 KB Output is correct
2 Correct 3 ms 596 KB Output is correct
3 Correct 18 ms 2464 KB Output is correct
4 Correct 14 ms 2516 KB Output is correct
5 Correct 5 ms 1236 KB Output is correct
6 Correct 5 ms 1236 KB Output is correct
7 Correct 10 ms 2148 KB Output is correct
8 Correct 10 ms 2132 KB Output is correct
9 Correct 5 ms 1108 KB Output is correct
10 Correct 5 ms 1192 KB Output is correct
11 Correct 12 ms 2444 KB Output is correct
12 Correct 12 ms 2452 KB Output is correct
13 Correct 6 ms 1236 KB Output is correct
14 Correct 6 ms 1236 KB Output is correct
15 Correct 9 ms 1876 KB Output is correct
16 Correct 10 ms 1972 KB Output is correct
17 Correct 12 ms 2260 KB Output is correct
18 Correct 11 ms 2260 KB Output is correct
19 Correct 12 ms 2360 KB Output is correct
20 Correct 12 ms 2380 KB Output is correct