제출 #259735

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
259735		uacoder123	쌀 창고 (IOI11_ricehub)	C++14	17 / 100	1093 ms	6632 KiB

ricehub

#include <bits/stdc++.h>
#include "ricehub.h"
using namespace std;
#define F first
#define S second
#define FOR(i,a,b) for (auto i = (a); i <= (b); ++i)
#define NFOR(i,a,b) for(auto i = (a); i >= (b); --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define mp(i,a) make_pair(i,a)
#define pb(a) push_back(a)
#define bit(x,b) (x&(1LL<<b))

typedef long long int lli;
typedef pair <lli,lli> ii;
typedef pair <lli,ii> iii;
typedef vector <lli> vi;

int besthub(int R, int L, int X[], long long B)
{ 
  lli n=R,ls=0,us=0;
  set<lli> l,u;
  lli ans=0;
  for(lli i=0;i<n;++i)
  {
    u.insert(X[i]);
    us+=X[i];
    if(u.size()>=l.size()+2)
    {
      l.insert((*u.begin()));
      ls+=(*u.begin());
      us-=(*u.begin());
      u.erase(u.begin());
    }
    while((*u.begin())*l.size()-ls+us-(*u.begin())*u.size()>B)
    {
      ls-=(*l.begin());
      l.erase(l.begin());
      if(u.size()>=l.size()+2)
      {
        l.insert((*u.begin()));
        ls+=(*u.begin());
        us-=(*u.begin());
        u.erase(u.begin());
      }
    }
    ans=max(ans,lli(u.size()+l.size()));
  }
  return(ans);
}

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

ricehub.cpp: In function 'int besthub(int, int, int*, long long int)':
ricehub.cpp:35:60: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while((*u.begin())*l.size()-ls+us-(*u.begin())*u.size()>B)
           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~

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