제출 #242454

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
242454		joseacaz	휴가 (IOI14_holiday)	C++17	47 / 100	5034 ms	2072 KiB

holiday

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

#define pb push_back
#define all(x) x.begin(), x.end()

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;


ll findMaxAttraction(int N, int start, int d, int a[])
{
    int k;
    ll ans = 0, sum = 0;
    priority_queue<ll> PQ;
    //only right
    if(start == 0)
    {
        k = d;
        for(int j = 0; j < N; j++)
        {
            sum += a[j];
            PQ.push(-a[j]);
            while(PQ.size() > k)
            {
                sum += PQ.top();
                PQ.pop();
            }
            ans = max(ans, sum);
            //cerr << i << " " << j << " " << sum << "\n";
            k--;
            if(k < 0)
                break;
        }
        return ans;
    }

    //first left then right
    for(int i = start; i >= 0; i--)
    {
        k = d - (start - i);
        sum = 0;
        while(!PQ.empty())
            PQ.pop();
        //cerr << k << "\n";
        for(int j = i; j < N; j++)
        {
            sum += a[j];
            PQ.push(-a[j]);
            while(PQ.size() > k)
            {
                sum += PQ.top();
                PQ.pop();
            }
            ans = max(ans, sum);
            //cerr << i << " " << j << " " << sum << "\n";
            k--;
            if(k < 0)
                break;
        }
    }

    //first right then left
    for(int i = start; i < N; i++)
    {
        k = d - (i - start);
        sum = 0;
        while(!PQ.empty())
            PQ.pop();
        //cerr << k << "\n";
        for(int j = i; j >= 0; j--)
        {
            sum += a[j];
            PQ.push(-a[j]);
            while(PQ.size() > k)
            {
                sum += PQ.top();
                PQ.pop();
            }
            //cerr << i << " " << j << " " << sum << "\n";
            ans = max(ans, sum);
            k--;
            if(k < 0)
                break;
        }
    }

    return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

holiday.cpp: In function 'll findMaxAttraction(int, int, int, int*)':
holiday.cpp:30:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while(PQ.size() > k)
                   ~~~~~~~~~~^~~
holiday.cpp:56:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while(PQ.size() > k)
                   ~~~~~~~~~~^~~
holiday.cpp:81:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while(PQ.size() > k)
                   ~~~~~~~~~~^~~

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