Submission #316407

#TimeUsernameProblemLanguageResultExecution timeMemory
316407juggernautHoliday (IOI14_holiday)C++14
23 / 100
5053 ms2988 KiB
#include"holiday.h"
#include<bits/stdc++.h>
#ifdef EVAL
#else
#include"grader.cpp"
#endif
using namespace std;
typedef long long ll;
ll findMaxAttraction(int n,int start,int d,int attraction[]){
    ll rs=0;
    for(int i=0;i<=start;i++){
        priority_queue<ll>q;
        ll sum=0;
        for(int j=i;j<n;j++){
            q.push(-attraction[j]);
            sum+=attraction[j];
            if(j<start)continue;
            ll rem=d-min((start-i)+(j-i),(j-start)+(j-i));
            while(!q.empty()&&q.size()>rem){
                sum+=q.top();
                q.pop();
            }
            rs=max(rs,sum);
        }
    }
    return rs;
}
/*
5 2 7
10 2 20 30 1

*/

Compilation message (stderr)

holiday.cpp: In function 'll findMaxAttraction(int, int, int, int*)':
holiday.cpp:19:39: warning: comparison of integer expressions of different signedness: 'std::priority_queue<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   19 |             while(!q.empty()&&q.size()>rem){
      |                               ~~~~~~~~^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...