Submission #805809

#TimeUsernameProblemLanguageResultExecution timeMemory
805809Mouad_oujDreaming (IOI13_dreaming)C++17
18 / 100
19 ms2888 KiB
#include "dreaming.h"
#include<bits/stdc++.h>
using namespace std;
int n,m,l;
int travelTime(int ne,int me,int le,int u[],int ve[],int te[])
{
    n=ne;m=me;l=le;
    vector<int> v;
    for(int x=0;x<m;x++)
    v.push_back(te[x]);
    for(int x=0;x<n-2*m;x++)
    v.push_back(0);
    sort(v.begin(),v.end());
    int ans=0,s=v.size();
    if(s-1>=0)ans=v[s-1];
    if(s-2>=0)
    ans=v[s-1]+v[s-2]+l;
    if(s-3>=0)
    ans=max(ans,v[s-2]+v[s-3]+2*l);
    return ans;
}   //sub5
#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...