답안 #319705

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
319705	2020-11-06T08:21:26 Z	neki	쌀 창고 (IOI11_ricehub)	C++14	컴파일 오류	0 ms	0 KB

ricehub

#include "ricehub.h"
#include <bits/stdc++.h>
#define loop(i, a, b) for(long long i=a;i<b;i++)
#define pool(i, a, b) for(long long i=a-1;i>=b;i--)
#define fore(i, a) for(auto&& i:a)
#define fi first
#define se second
#define ps(a) push_back(a)
#define pb(a) pop_back(a)
#define sc scanf
#define vc vector
#define pa pair<ll, ll>
#define ll long long
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define llmax LLONG_MAX/2
#define llmin -LLONG_MAX/2
using namespace std;
#define mn 1010
#define pa pair<ll, ll>
#define ld long double 
ll pref[mn];
ll cl(ll l, ll r, ll c){
    return (pref[r] - pref[c]) - (pref[c-1]-pref[l-1]);
}
ll cs(ll l, ll r, ll c){
    return (pref[r] - pref[c]) - (pref[c]-pref[l-1]);
}
ll besthub(int r, int l,int x[], ll b){
    loop(i, 0, r) pref[i+1]=pref[i]+x[i];
    ll lf=1, ans=0;
    loop(i, 1, r+1){
        if(lf<i and 2 * i - lf>r or cl(lf, 2 * i - lf, i)>b) lf++;
        ans=max(ans, 2 * (i- lf) +1);
    }
    lf=1;
    loop(i, 1, r){
        if(lf<i and 2 * i - lf + 1>r or cs(lf, 2 * i - lf + 1, i)>b) lf++;
        ans=max(ans, 2 * (i- lf+1));
    }
    return ans;
}

Compilation message

ricehub.cpp:30:4: error: ambiguating new declaration of 'long long int besthub(int, int, int*, long long int)'
   30 | ll besthub(int r, int l,int x[], ll b){
      |    ^~~~~~~
In file included from ricehub.cpp:1:
ricehub.h:1:5: note: old declaration 'int besthub(int, int, int*, long long int)'
    1 | int besthub(int R, int L, int X[], long long B);
      |     ^~~~~~~
ricehub.cpp: In function 'long long int besthub(int, int, int*, long long int)':
ricehub.cpp:34:17: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   34 |         if(lf<i and 2 * i - lf>r or cl(lf, 2 * i - lf, i)>b) lf++;
      |            ~~~~~^~~~~~~~~~~~~~~~
ricehub.cpp:39:17: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   39 |         if(lf<i and 2 * i - lf + 1>r or cs(lf, 2 * i - lf + 1, i)>b) lf++;
      |            ~~~~~^~~~~~~~~~~~~~~~~~~~