oj.uz

답안 #1107639

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1107639 2024-11-01T18:57:51 Z Lincito_31 쌀 창고 (IOI11_ricehub) C++17
17 / 100
 13 ms 4432 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
int besthub(int R, int L, int X[], long long B)
{
  vll psum(R+1);
  psum[0]=0;
  psum[1]=X[0];
  for(int i=2;i<=R;i++){
    psum[i]=psum[i-1]+X[i-1];
  }
  int iz=0,de=0;
  int can=1;
  bool xd=false;
  while(iz<R && !xd){
    de=max(de,iz);
    int mid=(iz+de)/2;
    ll sum=X[mid]*(mid-iz)-(psum[mid]-psum[iz]);
    sum+=psum[de+1]-psum[mid+1]-X[mid]*(de-mid);
    while(sum<=B){
        de++;
        if(de>=R){
            xd=true;
            break;
        }
      sum=X[mid]*(mid-iz)-(psum[mid]-psum[iz]);
      sum+=psum[de+1]-psum[mid+1]-X[mid]*(de-mid);
    }
    can=max(can,de-iz);
    //cout << iz << " " << de << endl;
    iz++;
  }
  return can;
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 452 KB Output is correct
5 Correct 1 ms 336 KB Output is correct

Subtask #2
0 / 25.0

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

Subtask #3
0 / 26.0

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

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 592 KB Output is correct
2 Correct 3 ms 592 KB Output is correct
3 Correct 13 ms 4328 KB Output is correct
4 Incorrect 11 ms 4432 KB Output isn't correct
5 Halted 0 ms 0 KB -