Submission #316260

#	Time	Username	Problem	Language	Result	Execution time	Memory
316260		qpwoeirut	휴가 (IOI14_holiday)	C++17	47 / 100	5097 ms	5496 KiB

holiday

#include <bits/stdc++.h>
#include "holiday.h"

using namespace std;

typedef long long ll;

ll findMaxAttraction(int n, int start, int d, int attraction[]) {
    ll ans = 0;
    for (int i=0; i<=start; ++i) {
        multiset<ll> in;
        ll sum = 0;
        for (int j=i; j<n; ++j) {
            in.insert(attraction[j]);
            sum += attraction[j];

            if (j >= start) {
                ll travel = min((start - i) + (j - i), (j - start) + (j - i));

                ll rem = d - travel;
                if (rem <= 0) {
                    continue;
                }
                while (in.size() > rem) {
                    sum -= *in.begin();
                    in.erase(in.begin());
                }

                //cerr << "i,j,sum,rem: " << i << ' '<< j << ' ' << sum << ' ' << rem << endl;
                //cerr << "in:"; for (auto it=in.begin(); it!=in.end(); ++it) { cerr << ' ' << *it; } cerr << endl;

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

    return ans;
}

Compilation message (stderr)

holiday.cpp: In function 'll findMaxAttraction(int, int, int, int*)':
holiday.cpp:24:34: warning: comparison of integer expressions of different signedness: 'std::multiset<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   24 |                 while (in.size() > rem) {
      |                        ~~~~~~~~~~^~~~~

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