제출 #1333800

#제출 시각아이디문제언어결과실행 시간메모리
1333800marzuq01Nile (IOI24_nile)C++20
13 / 100
27 ms4012 KiB
#include "nile.h"
#include <bits/stdc++.h>
using namespace std;
#define lint long long
std::vector<long long> calculate_costs(std::vector<int> W, std::vector<int> A,
                                       std::vector<int> B, std::vector<int> E) {
    lint n = W.size();
    lint q = E.size();
    //wi = i+1
    lint sum = 0ll;
    for (auto i: B) sum += i;
    vector<lint> arr(n);
    for (lint i = 0; i < n;i++) arr[i] = A[i] - B[i];
    vector<lint> reduced;
    for (int i = 0;i < n;i+=2) reduced.push_back(arr[i]);
    sort(arr.begin(),arr.end());
    sort(reduced.begin(),reduced.end());
    vector<lint> ans(q);
    for (int i = 0; i < q;i++) {
        if (n % 2 == 0) ans[i] = sum;
        else if (E[i] >= 2) ans[i] = sum + arr[0];
        else ans[i] = sum + reduced[0];
    }
    return ans;
}
#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...