Submission #1218845

#TimeUsernameProblemLanguageResultExecution timeMemory
1218845laurraNile (IOI24_nile)C++20
0 / 100
18 ms2632 KiB
#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());
    for(i=0;i<R.size();i++)
    {
        rasp=0;j=0;
        while(j<n)
        {
            if(j<n-1 && W[j+1]-W[j]<=R[i])
            {
                rasp+=B[j+1]+B[j];
                j+=2;
            }
            else
            {
                rasp+=A[j];
                j++;
            }
        }
        R[i]=rasp;
    }
    return R;
}

#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...