제출 #585011

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
585011		Mazaalai	휴가 (IOI14_holiday)	C++17	17 / 100	538 ms	65536 KiB

holiday

#include <bits/stdc++.h>
#include"holiday.h"
#define ALL(x) x.begin(),x.end()
#define LLA(x) x.rbegin(),x.rend()
#define pb push_back
using namespace std;
using PII = pair <int, int>;
using ll = long long;
const int N = 3001;
const int D = 6000;
ll dp[2][N][D];
ll dp1[2][D];
long long int findMaxAttraction(int n, int st, int d, int nums[]) {
    ll ans = 0;
    // return 0;

    {
        for (int i = st; i >= 0; i--) {
            multiset <int> vals;
            ll sum = 0;
            int a = st - i;
            for (int j = i; j <= st; j++) {
                vals.insert(nums[j]);
                sum += nums[j];
            }
            for (int j = vals.size(); j > 0; j--) {
                if (a+j <= d) {
                    dp[0][i][a+j] = sum;
                    dp1[0][a+j] = max(dp1[0][a+j], sum);
                }
                sum -= *vals.begin();
                vals.erase(vals.begin());
            }
        }
        for (int i = st+1; i < n; i++) {
            multiset <int> vals;
            ll sum = 0;
            int b = i - st;
            for (int j = st+1; j <= i; j++) {
                vals.insert(nums[j]);
                sum += nums[j];
            }
            for (int j = vals.size(); j > 0; j--) {
                if (j+b <= d) {
                    dp[1][i][j+b] = sum;
                    dp1[1][j+b] = max(dp1[1][j+b], sum);
                }
                sum -= *vals.begin();
                vals.erase(vals.begin());
            }
        }
    }
    for (int i = 1; i <= d; i++) {
        ans = max(ans, dp1[0][d]);
        ans = max(ans, dp1[1][d]);
    }
    for (int i = 0; i <= st; i++) 
    for (int j = 0; j <= d; j++) {
        if (d-j-st+i >= 0){
            // if (dp[0][i][j] + dp1[1][d-j-st+i] == 72) {
            //     cout << "00 " << i << " " << j << "\n";
            //     cout << "01 " << d-j-st+i << "\n";
            //     cout << "02 " << dp[0][i][j] << ' ' << dp1[1][d-j-st+i] << "\n";
            // }
            ans = max(ans, dp[0][i][j] + dp1[1][d-j-st+i]);
        }
    }

    for (int i = st; i < n; i++) 
    for (int j = 0; j <= d; j++) {
        if (d-j-i+st >= 0) {

            // if (dp[1][i][j] + dp1[0][d-j-i+st] == 72) {
            //     cout << "10 " << i << " " << j << "\n";
            //     cout << "11 " << d-j-i+st<< "\n";
            //     cout << "12 " << dp[1][i][j] << ' ' << dp1[0][d-j-i+st] << "\n";
            // }
            ans = max(ans, dp[1][i][j] + dp1[0][d-j-i+st]);
        }
    }
        
    
    return ans;
}

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