Submission #1231073

#TimeUsernameProblemLanguageResultExecution timeMemory
1231073banganNile (IOI24_nile)C++20
6 / 100
17 ms2632 KiB
#include "nile.h"
#include <bits/stdc++.h>
using namespace std;

#define ll long long

std::vector<long long> calculate_costs(std::vector<int> W, std::vector<int> A, std::vector<int> B, std::vector<int> E) {
    int N = W.size();
    int Q = E.size();
    ll sum = 0;
    for (int i=0; i<N; i++) sum += B[i];
    ll ans = LLONG_MAX;
    if (N%2 == 0) ans = sum;
    else for (int i=0; i<N; i++) ans = min(ans, sum - B[i] + A[i]);
    return vector<ll> (Q, 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...