Submission #1075634

#TimeUsernameProblemLanguageResultExecution timeMemory
1075634TrumlingDreaming (IOI13_dreaming)C++14
18 / 100
16 ms3792 KiB
#include "dreaming.h"
#include <bits/stdc++.h>
using namespace std; 

typedef long long ll;
#define pb push_back
#define F first
#define S second
#define enter cout<<'\n';
#define INF 99999999999999999
#define MOD 1000000007
#define all(x) x.begin(),x.end()

int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
	ll n=N,m=M;
    vector<ll>t;
	for(int i=0;i<m;i++)
		t.pb(T[i]);

	for(int i=0;i<n-2*m;i++)
		t.pb(0);
	sort(all(t));

	return max(((t.size()>=2)?t[t.size()-1] + t[t.size()-2] + L : 0),((t.size()>=3)? t[t.size()-2] + t[t.size()-3] + 2*L:0));
}
#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...