제출 #1110510

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
1110510	2024-11-09 15:29:51	VMaksimoski008	나일강 (IOI24_nile)	C++17	67 / 100	2059 ms	7996 KiB

nile

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
#include "nile.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<long long> calculate_costs(vector<int> W, vector<int> A, vector<int> B, vector<int> E) {
    int Q = (int)E.size(), n = (int)A.size();
    vector<long long> R(Q, 0);
    vector<array<int, 3> > a(n+1);
    for(int i=1; i<=n; i++) a[i] = { W[i-1], A[i-1], B[i-1] };
    sort(a.begin()+1, a.end());
    for(int t=0; t<Q; t++) {
        vector<ll> dp(n+1, 1e18); dp[0] = 0;
        for(int i=1; i<=n; i++) {
            dp[i] = dp[i-1] + a[i][1];
            if(i > 1 && a[i][0] - a[i-1][0] <= E[t])
                dp[i] = min(dp[i], dp[i-2] + a[i-1][2] + a[i][2]);
            if(i > 2 && a[i][0] - a[i-2][0] <= E[t])
                dp[i] = min(dp[i], dp[i-3] + a[i-2][2] + a[i-1][1] + a[i][2]);
        }
        R[t] = dp[n];
    }
    return R;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• 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