oj.uz

답안 #112985

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
112985 2019-05-23T02:01:07 Z CaroLinda 쌀 창고 (IOI11_ricehub) C++14
0 / 100
 17 ms 1920 KB 
#include <bits/stdc++.h>
#include "ricehub.h"
 
#define lp(i,a,b) for(int i = a ; i < b ; i++)
#define ll long long
#define pii pair<int,int>
#define ff first
#define ss second
#define pb push_back
#define mk make_pair
 
const int inf = 1e9 + 10 ;
const int MAXN = 1e5 + 10 ;
 
using namespace std ;
 
int l , r , x[MAXN] ;
ll b ;
int pref[MAXN] , suf[MAXN] ;
 
int m(int a , int b)
{ return (a+b)/2 ; }
 
ll d(int a , int b  )
{ return abs( x[a] - x[b] ) ; }
 
ll c1(int a , int b)
{ return pref[b] - pref[a-1] - (b-a+1) * d(a,1) ; }
 
ll c2(int a , int b)
{ return suf[a] - suf[b+1] - (b-a+1) * d(b,r) ; }
 
bool test(int tam)
{
 
  int ini = 1 , fim = tam ;
 
  while( fim <= r )
  {
    int now = m(ini,fim) ;
    if( c1( ini , now ) + c2( now , fim ) <= b ) 
      return true ;
    ini ++ , fim++ ;
  }
  
  return false ;
 
}
 
int besthub(int R , int L , int X[] , ll B )
{
  b = B , r = R , l = L ;
  lp(i,1,r+1) x[i] = X[i-1] ;
 
  sort( x+1 , x+r+1 ) ;
 
  lp(i,1,r+1) pref[i] = pref[i-1] + d(i,1) ;
 
  for(int i = r ; i > 0 ; i-- ) suf[i] = suf[i+1] + d(i,r) ;
 
  int ini = 1 , fim = r , best = 1;
 
  while( ini <= fim )
  {
    if( test( m(ini,fim) ) )
    {
      best = m(ini,fim) ;
      ini = m(ini,fim) + 1 ;
    }
 
    else fim = m(ini,fim) - 1;
 
  }
 
  return best ;
 
}

Subtask #1
0 / 17.0

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

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 356 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Incorrect 2 ms 384 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

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

Subtask #4
0 / 32.0

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