#include <bits/stdc++.h>
#include <cstdlib>
#include <stdlib.h>
using namespace std;
#define ull unsigned long long
#define ld long double
#define ll long long
// #define int long long
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
int mod = 1e9 + 7;
// const int inf = 1e18;
const int N = 1e5 + 50, K = 22;
// #include "nile.h"
vector<long long> calculate_costs(vector<int> w, vector<int> a, vector<int> b, vector<int> e){
int n = a.size();
int q = e.size();
vector<ll> ans(q);
ll sum = 0;
for(auto i : b)
sum += i;
if(n % 2){
ll mn = 1e18;
for(int i = 0; i < n; i++)
mn = min(mn, (ll)a[i] - b[i]);
sum += mn;
}
for(int i = 0; i < q; i++)
ans[i] = sum;
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |