oj.uz

Submission #655213

# Submission time Handle Problem Language Result Execution time Memory
655213 2022-11-03T14:48:03 Z PanTkd Rice Hub (IOI11_ricehub) C++14
0 / 100
 224 ms 368 KB 
#include "ricehub.h"
#include <iostream>
#include <cmath>
typedef long long ll;
using namespace std;
int besthub(int R, int L, int X[], long long B)
{
  for(ll i = R;i>=1;i--){
    ll cost = 0;
    ll med = (i/2);
    ll l = i/2;
    ll r = (i+1)/2;
    for(ll j = 0;j<i;j++){
      cost += abs(X[med]-X[j]);
    }
    if(cost<=B) return 1;
    for(ll j = i;j<R;j++){
      cost -= abs(X[j-i]-X[med]);
      cost += abs(X[i]-X[med]);
      med+=1;
      cost += (X[med]-X[med-1])*(l-r);
      if(cost<=B)return 1;
    } 
  }
  return 0;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 1 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 224 ms 368 KB Output isn't correct
2 Halted 0 ms 0 KB -