제출 #1134143

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1134143		sohamsen15	Nile (IOI24_nile)	C++20	0 / 100	30 ms	8260 KiB

nile

#include "nile.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

vector<ll> calculate_costs(vector<int> w, vector<int> a, vector<int> b, vector<int> e) {
    int q = e.size();
    int n = w.size();

    vector<vector<int>> artifacts(n, vector<int>(3));
    for (int i = 0; i < n; i++) artifacts[i] = {w[i], a[i], b[i]};
    sort(artifacts.begin(), artifacts.end());

    vector<ll> ans;

    for (int d: e) {
        ll cost = 0;
        int idx = 0;

        for (;;) {
            if (idx == n - 1) {
                cost += artifacts[idx][1];
                break;
            } else {
                if (artifacts[idx + 1][0] - artifacts[idx][0] <= d) {
                    cost += artifacts[idx][2] + artifacts[idx + 1][2];
                    idx += 2;
                } else {
                    cost += artifacts[idx][1];
                    idx++;
                }
            }
        }

        ans.push_back(cost);
    }

    return ans;
}

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