Submission #1302493

#TimeUsernameProblemLanguageResultExecution timeMemory
1302493kawhietNile (IOI24_nile)C++20
0 / 100
24 ms4268 KiB
#include <bits/stdc++.h>
#include "nile.h"
using namespace std;

constexpr long long inf = 1e18;

vector<long long> calculate_costs(vector<int> w, vector<int> a, vector<int> b, vector<int> e) {
    int n = w.size();
    int q = e.size();
    vector<array<int, 3>> to_sort;
    for (int i = 0; i < n; i++) {
        to_sort.push_back({w[i], a[i], b[i]});
    }
    sort(to_sort.begin(), to_sort.end());
    for (int i = 0; i < n; i++) {
        w[i] = to_sort[i][0];
        a[i] = to_sort[i][1];
        b[i] = to_sort[i][2];
    }
    vector<long long> ret;
    for (auto d : e) {
        long long ans = 0;
        vector<bool> is(n);
        for (int i = 1; i < n; i++) {
            if (w[i] - w[i - 1] <= d && !is[i] && !is[i - 1]) {
                is[i] = is[i - 1] = 1;
                ans++;
            }
        }
        for (int i = 0; i < n; i++) {
            if (!is[i]) {
                ans += 2;
            }
        }
        ret.push_back(ans);
    }
    return ret;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...