oj.uz

Submission #743232

# Submission time Handle Problem Language Result Execution time Memory
743232 2023-05-17T09:03:07 Z Sainen420 Rice Hub (IOI11_ricehub) C++17
43 / 100
 1000 ms 884 KB 
#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
using pi = pair<int,int>;

int besthub(int R, int L, int X[], long long B)
{
  int ans=0,mi,cnt=0,l,r;
    long long int b = B;
    for(int i=0;i<R;i++){
        b=B;
        l=i;r=i;
        cnt=1;
        //EXPAND
        while(b>0){
            mi=2e9;
            //cout << r << ' ' << l << endl;
            if(l>=1){
                mi=min(abs(X[l-1]-X[i]),mi);
            }
            if(r<(R-1)){
                mi=min(mi,abs(X[r+1]-X[i]));
            }
            if(mi==2e9)break;
            if(b-mi < 0)break;
            else{
                cnt++;
                b-=mi;
                if(l>=1 && mi==abs(X[l-1]-X[i])){
                    l--;
                }else{
                    r++;
                }
            }
        }
        ans=max(cnt,ans);
    }
  return ans;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 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 308 KB Output is correct
8 Correct 1 ms 316 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Incorrect 1 ms 212 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 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 3 ms 212 KB Output is correct
4 Correct 3 ms 212 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 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 4 ms 212 KB Output is correct
14 Correct 4 ms 312 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 5 ms 312 KB Output is correct
18 Correct 4 ms 316 KB Output is correct
19 Correct 6 ms 212 KB Output is correct
20 Correct 6 ms 212 KB Output is correct
21 Correct 6 ms 340 KB Output is correct
22 Correct 7 ms 340 KB Output is correct
23 Correct 96 ms 344 KB Output is correct
24 Correct 87 ms 340 KB Output is correct
25 Correct 129 ms 344 KB Output is correct
26 Correct 129 ms 348 KB Output is correct
27 Correct 47 ms 348 KB Output is correct
28 Correct 50 ms 360 KB Output is correct

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 512 KB Output is correct
2 Correct 11 ms 596 KB Output is correct
3 Execution timed out 1077 ms 884 KB Time limit exceeded
4 Halted 0 ms 0 KB -