제출 #116540

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
116540	2019-06-12 20:33:38	Runtime_error_	쌀 창고 (IOI11_ricehub)	C++14	100 / 100	18 ms	3328 KiB

ricehub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
//IOI 2011 Day1 Problem 3 rice hub 
//Full solution
#include "ricehub.h" //for CMS
//#include "grader.h" //for yandex
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll inf=1e5+9;
ll pre[inf],a[inf],N,K;
bool check(ll len){
    for(ll i=len;i<=N;i++){
        ll r=i,l=i-len+1,mid=(l+r)/2;
        ll cost=(pre[r]-pre[mid]) -(a[mid]*(r-mid));
        cost+=(a[mid]*(mid-l))-(pre[mid-1]-pre[l-1]);
        if(cost<=K)
            return 1;
    }
    return 0;
}
int besthub(int n,int m,int x[],ll k){
    N=n;
    K=k;
    for(ll i=0;i<n;i++)
        a[i+1]=x[i];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

컴파일 시 표준 에러 (stderr) 메시지

ricehub.cpp: In function 'int besthub(int, int, int*, long long int)':
ricehub.cpp:35:8: warning: unused variable 'ans' [-Wunused-variable]
     ll ans=0;
        ^~~

• Subtask 1: 17 / 17
• Subtask 2: 25 / 25
• Subtask 3: 26 / 26
• Subtask 4: 32 / 32