Submission #1064592

#	Time	Username	Problem	Language	Result	Execution time	Memory
1064592		NemanjaSo2005	Holiday (IOI14_holiday)	C++17	47 / 100	5068 ms	2288 KiB

holiday

#include"holiday.h"
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=1e5+5;
int N,niz[maxn],D;
priority_queue<int> PQ;
ll suma,res=0;
long long int findMaxAttraction(int n, int start, int ddd, int attraction[]) {
    N=n;
    for(int i=1;i<=N;i++)
      niz[i]=attraction[i-1];
    D=ddd;
    start++;
    for(int i=start;i>=1;i--){
      suma=0;
      while(PQ.size())
         PQ.pop();
      for(int j=i;j<start;j++){
         suma+=niz[j];
         PQ.push(-niz[j]);
      }
      for(int j=start;j<=N;j++){
         int d=j-i+min(start-i,j-start);
         if(d>=D)
            break;
         suma+=niz[j];
         PQ.push(-niz[j]);
         while(PQ.size()+d>D){
            suma+=PQ.top();
            PQ.pop();
         }
         res=max(res,suma);
      }
    }
    return res;
}

Compilation message (stderr)

holiday.cpp: In function 'long long int findMaxAttraction(int, int, int, int*)':
holiday.cpp:29:27: warning: comparison of integer expressions of different signedness: 'std::priority_queue<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   29 |          while(PQ.size()+d>D){
      |                ~~~~~~~~~~~^~

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