Submission #1227344

#TimeUsernameProblemLanguageResultExecution timeMemory
1227344PVM_pvmNile (IOI24_nile)C++20
17 / 100
2095 ms6468 KiB
#include "nile.h"
#include<bits/stdc++.h>
using namespace std;
#define MAXN 100'007
int n;
struct art
{
    long long w,a,b;
} ar[MAXN];
bool cmp(art &a, art &b)
{
    return a.w<b.w;
}
vector<long long> calculate_costs(vector<int> W, vector<int> A, vector<int> B, vector<int> E)
{

    int Q = (int)E.size();
    n=A.size();
    for (int q=0;q<n;q++) ar[q]={W[q],A[q],B[q]};
    sort(ar,ar+n,cmp);
    vector<long long> R(Q);
    for (int cq=0;cq<Q;cq++)
    {
        int klkV=0;
        for (int q=0;q<n-1;q++)
        {
            if ((ar[q+1].w-ar[q].w)<=E[cq])
            {
                klkV++;
                q++;
            }
        }
        R[cq]=2*klkV+(n-2*klkV)*2;
    }
    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...