Submission #775638

#	Time	Username	Problem	Language	Result	Execution time	Memory
775638		danikoynov	휴가 (IOI14_holiday)	C++14	47 / 100	5083 ms	5380 KiB

holiday

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

using namespace std;
typedef long long ll;

long long int findMaxAttraction(int n, int start, int d, int attraction[])
{
    ll ans = 0;
    for (int i = 0; i <= start; i ++)
    {
        multiset < ll > st;
        ll sum = 0;
        for (int j = i; j < start; j ++)
        {
            sum = sum + attraction[j];
            st.insert(attraction[j]);
        }
        for (int j = start; j < n; j ++)
        {
            sum = sum + attraction[j];
            st.insert(attraction[j]);
            int lf = start - i, rf = j - start;
            int left = d - min(lf, rf) * 2 - max(lf, rf);
            if (left < 0)
                break;
            while(st.size() > left)
            {
                sum = sum - *st.begin();
                st.erase(st.begin());
            }
            if (sum > ans)
                ans = sum;
        }
    }

    return ans;
}

Compilation message (stderr)

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

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