제출 #1109710

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1109710		Trisanu_Das	나일강 (IOI24_nile)	C++17	67 / 100	2064 ms	7736 KiB

nile

#include <bits/stdc++.h>
#define ll long long
using namespace std;
 
vector<long long> calculate_costs(vector<int> W, vector<int> A, vector<int> B, vector<int> E){
    int N = W.size(), q = E.size();
    vector<tuple<int, int, int> > items;
    vector<ll> ans;
    for(int i = 0; i < N; ++i) items.push_back(make_tuple(W[i], A[i], B[i]));
    sort(items.begin(), items.end());
    sort(items.begin(), items.end());
    for (int i = 0; i < N; ++i) {
        auto [w, a, b] = items[i];
        W[i] = w, A[i] = a, B[i] = b;
    }
    for(int i = 0; i < q; ++i){
        int d = E[i];
        vector<ll> dp(N + 1, LLONG_MAX);
        for(int i = 0; i < N; ++i){
            if(i == 0) dp[i] = (ll)A[i];
            else if(i == 1){
                if(W[i] - W[i - 1] <= d) dp[i] = (ll)B[i] + (ll)B[i - 1];
                else dp[i] = dp[i - 1] + (ll)A[i];
            }
            else{
                dp[i] = dp[i - 1] + (ll)A[i];
                if(W[i] - W[i - 1] <= d) dp[i] = min(dp[i], (ll)((ll)B[i] + (ll)B[i - 1] + dp[i - 2]));
                if(W[i] - W[i - 2] <= d){
                    if(i >= 3) dp[i] = min(dp[i], (ll)((ll)B[i] + (ll)A[i - 1] + (ll)B[i - 2] + dp[i - 3]));
                    else dp[i] = min(dp[i], (ll)((ll)B[i] + (ll)A[i - 1] + (ll)B[i - 2]));
                }
            }
        }
        ans.push_back(dp[N - 1]);
    }
    return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 6 / 6
• Subtask 2: 13 / 13
• Subtask 3: 17 / 17
• Subtask 4: 11 / 11
• Subtask 5: 20 / 20
• Subtask 6: 0 / 15
• Subtask 7: 0 / 18