oj.uz

답안 #614008

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
614008 2022-07-30T16:25:24 Z chirathnirodha 쌀 창고 (IOI11_ricehub) C++17
0 / 100
 13 ms 1696 KB 
#include "ricehub.h"
#include<bits/stdc++.h>
using namespace std;
#define PB push_back 
typedef long long ll;

int besthub(int R, int L, int X[], long long B){
  int a=0;int b=0;
  int ans=1;
  ll curcos=0;
  while(a<R && b<R){
    int pm=(a+b)/2;
    if(curcos<=B){
      ans=max(ans,b-a+1);
      if(b==R-1)break;
      b++;
      curcos+=X[b]-X[pm];
    }
    else{
      a++;
      curcos-=X[pm]-X[b];
    }
    int nm=(a+b)/2;
    curcos+=(X[nm]-X[pm])*((nm-a)-(b-pm));
  }
  return ans;
}

Subtask #1
0 / 17.0

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

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 316 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 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Incorrect 0 ms 212 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

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

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 13 ms 1696 KB Output is correct
4 Correct 12 ms 1672 KB Output is correct
5 Incorrect 6 ms 852 KB Output isn't correct
6 Halted 0 ms 0 KB -