#include <iostream>
#include "nile.h"
#include <algorithm>
using namespace std;
vector<long long> calculate_costs(vector<int> W, vector<int> A,vector<int> B, vector<int> E)
{
long long i,j,n,rasp;
n=W.size();
vector<long long> R;
R.resize(E.size());
sort(W.begin(),W.end());
for(i=0;i<R.size();i++)
{
rasp=0;j=0;
while(j<n)
{
if(j<n-1 && W[j+1]-W[j]<=E[i])
{
rasp+=B[j+1]+B[j];
j+=2;
}
else
{
rasp+=A[j];
j++;
}
}
R[i]=rasp;
}
return R;
}
# | 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... |