Submission #587130

#	Time	Username	Problem	Language	Result	Execution time	Memory
587130		Jomnoi	Holiday (IOI14_holiday)	C++17	30 / 100	125 ms	1716 KiB

holiday

#include <bits/stdc++.h>
#include"holiday.h"
using namespace std;

const int MAX_N = 1e5 + 5;

int N;
int A[MAX_N];

long long int findMaxAttraction(int n, int start, int d, int attraction[]) {
    N = n;
    int maxAttraction = 0;
    for(int i = 0; i < N; i++) {
        A[i] = attraction[i];
        maxAttraction = max(maxAttraction, A[i]);
    }

    long long ans = 0;
    if(N <= 20) {
        for(int mask = 0; mask < (1<<N); mask++) {
            int lm = -1, rm = -1, cnt = 0;
            long long sum = 0;
            for(int i = 0; i < N; i++) {
                if(mask & (1<<i)) {
                    if(lm == -1) {
                        lm = i;
                    }
                    rm = i;
                    cnt++;
                    sum += A[i];
                }
            }

            if(rm - lm + min(abs(start - lm), abs(start - rm)) + cnt <= d) {
                ans = max(ans, sum);
            }
        }
    }
    else if(maxAttraction <= 100 and start == 0) {
        long long sum = 0;
        priority_queue <int, vector <int>, greater <int>> pq;
        for(int i = 0; i < min(N, d); i++) {
            sum += A[i];
            pq.push(A[i]);
            while(pq.size() > d - i) {
                sum -= pq.top();
                pq.pop();
            }
            
            ans = max(ans, sum);
        }
    }
    else if(N <= 3000) {
        for(int l = start; l >= 0; l--) {
            long long sum = 0;
            priority_queue <int, vector <int>, greater <int>> pq;
            for(int i = l; i < start; i++) {
                sum += A[i];
                pq.push(A[i]);
            }
            for(int r = start; r < n; r++) {
                sum += A[r];
                pq.push(A[r]);
                while(!pq.empty() and pq.size() > d - (r - l) - min(start - l, r - start)) {
                    sum -= pq.top();
                    pq.pop();
                }

                ans = max(ans, sum);
            }
        }
    }
    return ans;
}

Compilation message (stderr)

holiday.cpp: In function 'long long int findMaxAttraction(int, int, int, int*)':
holiday.cpp:45:29: warning: comparison of integer expressions of different signedness: 'std::priority_queue<int, std::vector<int>, std::greater<int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   45 |             while(pq.size() > d - i) {
      |                   ~~~~~~~~~~^~~~~~~
holiday.cpp:64:49: warning: comparison of integer expressions of different signedness: 'std::priority_queue<int, std::vector<int>, std::greater<int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   64 |                 while(!pq.empty() and pq.size() > d - (r - l) - min(start - l, r - start)) {
      |                                       ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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