oj.uz

Submission #259735

# Submission time Handle Problem Language Result Execution time Memory
259735 2020-08-08T12:30:00 Z uacoder123 Rice Hub (IOI11_ricehub) C++14
17 / 100
 1000 ms 6632 KB 
#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);
}

Compilation message

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.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 256 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Execution timed out 1086 ms 256 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Execution timed out 1093 ms 256 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 512 KB Output is correct
2 Correct 7 ms 512 KB Output is correct
3 Correct 47 ms 6520 KB Output is correct
4 Correct 47 ms 6632 KB Output is correct
5 Execution timed out 1082 ms 896 KB Time limit exceeded
6 Halted 0 ms 0 KB -