제출 #1032219

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1032219		tolbi	휴가 (IOI14_holiday)	C++17	0 / 100	5018 ms	2436 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 l = 0; l < n; l++){
        priority_queue<int,vector<int>,greater<int>> pq;
        ll somma = 0;
        for (int i = l; i < start; i++){
            pq.push(attraction[i]);
            somma+=attraction[i];
        }
        for (int r = l; r < n; r++){
            pq.push(attraction[r]);
            somma+=attraction[r];
            int mv;
            if (l<=start && r>=start){
                mv = r-l+min(start-l,r-start);
            }
            else mv=max(abs(start-l),abs(start-r));
            int kal = d-mv;
            while (pq.size()>kal){
                somma-=pq.top();
                pq.pop();
            }
            ans=max(ans,somma);
        }
    }
    return ans;
}

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

holiday.cpp: In function 'long long int findMaxAttraction(int, int, int, int*)':
holiday.cpp:23: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]
   23 |             while (pq.size()>kal){
      |                    ~~~~~~~~~^~~~

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