oj.uz

Submission #724758

# Submission time Handle Problem Language Result Execution time Memory
724758 2023-04-15T23:11:30 Z Yell0 Rice Hub (IOI11_ricehub) C++17
0 / 100
 2 ms 468 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
const int MN=1e5+2;

int besthub(int R,int L,int X[],ll B) {
  int ans=1;
  ll cost=0;
  for(int l=0,r=0;r<R;++r) {
    cost+=X[r]-X[(l+r-1)/2];
    while(cost>B) {
      cost-=X[(l+r)/2+1]-X[l];
      ++l;
    }
    ans=max(ans,r-l+1);
  }
  return ans;
}

Subtask #1
0 / 17.0

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

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 0 ms 212 KB Output is correct
5 Incorrect 1 ms 308 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

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

Subtask #4
0 / 32.0

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