답안 #495673

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
495673 2021-12-19T21:53:13 Z AndresTL 쌀 창고 (IOI11_ricehub) C++11
100 / 100
18 ms 636 KB
#include "ricehub.h"
#include <algorithm>
typedef long long ll;
using namespace std;
int besthub(int R, int L, int X[], long long B){
  int l=0,r=0, m, MaxR=1;
  ll b_gastado = 0;
  while(r<R-1){
    if (b_gastado<=B){
      r++;
      m=(l+r)/2;
      b_gastado+=abs(X[r]-X[m]);
      if (b_gastado<=B) MaxR=max(MaxR,r-l+1);
    }else{
      l++;
      m=(l+r)/2;
      b_gastado-=abs(X[m]-X[l-1]);
      if (b_gastado<=B) MaxR=max(MaxR,r-l+1);
    }
  }
  return MaxR;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 3 ms 332 KB Output is correct
3 Correct 14 ms 588 KB Output is correct
4 Correct 18 ms 576 KB Output is correct
5 Correct 6 ms 460 KB Output is correct
6 Correct 6 ms 456 KB Output is correct
7 Correct 11 ms 636 KB Output is correct
8 Correct 11 ms 588 KB Output is correct
9 Correct 5 ms 460 KB Output is correct
10 Correct 6 ms 460 KB Output is correct
11 Correct 13 ms 616 KB Output is correct
12 Correct 15 ms 588 KB Output is correct
13 Correct 6 ms 476 KB Output is correct
14 Correct 6 ms 460 KB Output is correct
15 Correct 10 ms 460 KB Output is correct
16 Correct 11 ms 540 KB Output is correct
17 Correct 13 ms 588 KB Output is correct
18 Correct 11 ms 588 KB Output is correct
19 Correct 12 ms 588 KB Output is correct
20 Correct 13 ms 588 KB Output is correct