제출 #500774

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
500774		InternetPerson10	휴가 (IOI14_holiday)	C++17	0 / 100	427 ms	5956 KiB

holiday

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

using namespace std;
typedef long long ll;

long long int findMaxAttraction(int n, int start, int d, int attraction[]) {
    ll best = 0;
    // Try left
    ll ans = 0;
    multiset<int> s;
    int g = d;
    cout << "Yes\n";
    for(int i = start; i < n; i++) {
        cout << i << '\n';
        ans += attraction[i];
        s.insert(attraction[i]);
        while(g < s.size()) {
            auto it = s.begin();
            ans -= *(it);
            s.erase(it); 
        }
        g--;
        best = max(ans, best);
        if(g == 0) break;
    }
    multiset<int>().swap(s);
    // Try right
    g = d;
    ans = 0;
    for(int i = start; i >= 0; i--) {
        ans += attraction[i];
        s.insert(attraction[i]);
        while(g < s.size()) {
            auto it = s.begin();
            ans -= *(it);
            s.erase(it);
        }
        g--;
        best = max(ans, best);
        if(g == 0) break;
    }
    multiset<int>().swap(s);
    if(n <= 20) { // Subtask 1
        for(int le = 0; le < start; le++) {
            ll ans = 0;
            int l = start - le;
            for(int i = le; i <= start; i++) {
                s.insert(attraction[i]);
                ans += attraction[i];
            }
            for(int rr = start+1; rr < n; rr++) {
                int r = rr - start;
                s.insert(attraction[rr]);
                ans += attraction[rr];
                int g = d - (l + r + min(l, r));
                cout << g << '\n';
                if(g <= 0) break;
                while(g < s.size()) {
                    auto it = s.begin();
                    ans -= *(it);
                    s.erase(it);
                }
                best = max(ans, best);
            }
            multiset<int>().swap(s);
        }
        return best;
    }
    else if(start == 0) { // Subtask 2
        return best;
    }
    else if(n <= 3000) { // Subtask 3
        for(int le = 0; le < start; le++) {
            cout << le << '\n';
            ll ans = 0;
            int l = start - le;
            for(int i = le; i <= start; i++) {
                s.insert(attraction[i]);
                ans += attraction[i];
            }
            for(int rr = start+1; rr < n; rr++) {
                int r = rr - start;
                s.insert(attraction[rr]);
                ans += attraction[rr];
                int g = d - (l + r + min(l, r));
                cout << g << '\n';
                if(g <= 0) break;
                while(g < s.size()) {
                    auto it = s.begin();
                    ans -= *(it);
                    s.erase(it);
                }
                best = max(ans, best);
            }
            multiset<int>().swap(s);
        }
        return best;
    }
    // Subtask 4
    return 0;
}

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

holiday.cpp: In function 'long long int findMaxAttraction(int, int, int, int*)':
holiday.cpp:19:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::multiset<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |         while(g < s.size()) {
      |               ~~^~~~~~~~~~
holiday.cpp:35:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::multiset<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |         while(g < s.size()) {
      |               ~~^~~~~~~~~~
holiday.cpp:60:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::multiset<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |                 while(g < s.size()) {
      |                       ~~^~~~~~~~~~
holiday.cpp:90:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::multiset<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |                 while(g < s.size()) {
      |                       ~~^~~~~~~~~~

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