Submission #467288

#	Time	Username	Problem	Language	Result	Execution time	Memory
467288		ivan_tudor	Holiday (IOI14_holiday)	C++14	23 / 100	733 ms	5920 KiB

holiday

#include"holiday.h"
#include<bits/stdc++.h>
using namespace std;
const int N = 100005;
int a[N];
multiset<int> big, small;
long long sum;
int canhold;
int L, R;
void insert_val(int v){
  big.insert(v);
  sum += v;
  while(big.size() > max(canhold, 0)){
    int lval = (*big.begin());
    sum -= lval;
    big.erase(big.begin());
    small.insert(lval);
  }
}
void erase_val(int v){
  if(small.count(v)){
    small.erase(small.find(v));
  }
  else if(big.count(v)){
    big.erase(big.find(v));
    sum -= v;
  }

  while(big.size() < canhold && small.size() > 0){
    int val = (*small.rbegin());
    big.insert(val);
    sum += val;
    small.erase(small.find(val));
  }
}
void transf(int newL, int newR){
  while(L > newL){
    canhold -=2;
    L--;
    insert_val(a[L]);
  }
  while(R < newR){
    canhold --;
    R++;
    insert_val(a[R]);
  }

  while(L < newL){
    canhold +=2;
    erase_val(a[L]);
    L++;
  }
  while(R > newR){
    canhold++;
    erase_val(a[R]);
    R--;
  }
}
long long ans = 0;
void solve(int l, int r, int opl, int opr){
  int mid = (l + r)/2;
  long long maxi = -1, mpoz;
  for(int i = max(opl, mid); i <= opr; i++){
    transf(mid, i);
    if(maxi < sum){
      maxi = sum;
      mpoz = i;
    }
  }
  ans = max(ans, maxi);
  if(l == r)
    return;
  solve(l, mid, opl, mpoz);
  solve(mid + 1, r, mpoz + 1, opr);
}
long long int findMaxAttraction(int n, int start, int d, int attraction[]) {
  for(int i = 0; i < n; i++)
    a[i] = attraction[i];

  sum = 0;
  L = R = start;
  canhold = d;
  insert_val(a[start]);
  solve(0, start, start, n - 1);

  reverse(a, a+n);
  start = n - 1 - start;
  big.clear();
  small.clear();
  sum = 0;

  L = R = start;
  canhold = d;
  insert_val(a[start]);
  solve(0, start, start, n - 1);
  return ans;
}

Compilation message (stderr)

holiday.cpp: In function 'void insert_val(int)':
holiday.cpp:13:20: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'const int' [-Wsign-compare]
   13 |   while(big.size() > max(canhold, 0)){
      |         ~~~~~~~~~~~^~~~~~~~~~~~~~~~~
holiday.cpp: In function 'void erase_val(int)':
holiday.cpp:29:20: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   29 |   while(big.size() < canhold && small.size() > 0){
      |         ~~~~~~~~~~~^~~~~~~~~
holiday.cpp: In function 'void solve(int, int, int, int)':
holiday.cpp:74:26: warning: 'mpoz' may be used uninitialized in this function [-Wmaybe-uninitialized]
   74 |   solve(mid + 1, r, mpoz + 1, opr);
      |                     ~~~~~^~~

• Subtask 1: 0 / 7
• Subtask 2: 23 / 23
• Subtask 3: 0 / 17
• Subtask 4: 0 / 53