oj.uz

답안 #668673

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
668673 2022-12-04T12:00:38 Z FEDIKUS 쌀 창고 (IOI11_ricehub) C++17
0 / 100
 3 ms 340 KB 
#include "ricehub.h"
#include<algorithm>

using namespace std;

int besthub(int r, int l, int x[], long long b){
  int duz=0;
  long long cena=0;
  int res=0;
  for(int i=0;i<r;i++){
    while(i-duz-1>=0 && i+duz+1<r){
      if(cena+abs(x[i]-x[i-duz-1])+abs(x[i]-x[i+duz+1])>b) break;
      cena+=abs(x[i]-x[i-duz-1])+abs(x[i]-x[i+duz+1]);
      duz++;
    }
    res=max(res,2*duz+1);
    if(i-duz-1>=0){
      if(cena+abs(x[i]-x[i-duz-1])<=b) res=max(res,2*duz+2);
    }
    if(i+duz+1<r){
      if(cena+abs(x[i]-x[i+duz+1])<=b) res=max(res,2*duz+2);
    }
    if(i<r-1 && duz>0){
       cena+=x[i+1]-x[i];
       cena-=abs(x[i+1]-x[i-duz]);
       cena-=abs(x[i+1]-x[i+duz]);
       duz--;
    }
  }
  return res;
}

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

Subtask #3
0 / 26.0

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

Subtask #4
0 / 32.0

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