oj.uz

답안 #895137

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
895137 2023-12-29T13:25:27 Z anton 쌀 창고 (IOI11_ricehub) C++17
0 / 100
 12 ms 4556 KB 
#include "ricehub.h"

#include<bits/stdc++.h>
using namespace std;
#define ll long long
struct Hull{
  deque<ll> dq;
  ll s;
  
  Hull(){
    s= 0;
  }

  void add(ll pos){
    s += pos-dq[(dq.size())/2];
    dq.push_back(pos);
  }

  void rem(){
    ll pos = dq.front();
    s-= dq[(dq.size())/2] -pos;
    dq.pop_front();
  }
};

int besthub(int R, int L, int X[], long long B){

  Hull my_hull;
  int res= 0;
  for(int i = 0; i<R; i++){
    my_hull.add(X[i]);
    while(my_hull.s>B){
      my_hull.rem();
    }
    res= max(res, (int)my_hull.dq.size());

  }
  return res;

}

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 504 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 2 ms 600 KB Output is correct
3 Correct 9 ms 4440 KB Output is correct
4 Correct 12 ms 4556 KB Output is correct
5 Incorrect 6 ms 2908 KB Output isn't correct
6 Halted 0 ms 0 KB -