Submission #842922

#	Time	Username	Problem	Language	Result	Execution time	Memory
842922		12345678	Dreaming (IOI13_dreaming)	C++17	0 / 100	18 ms	1884 KiB

dreaming

#include "dreaming.h"
#include <bits/stdc++.h>

using namespace std;

const int nx=1e5+5;
vector<int> nt(nx);

int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
    for (int i=0; i<M; i++) nt[i]=T[i];
    sort(nt.begin(), nt.end());
    reverse(nt.begin(), nt.end());
    return max(nt[0]+L+nt[1], nt[1]+2*L+nt[2]);
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 10
• Subtask 3: 0 / 23
• Subtask 4: 0 / 18
• Subtask 5: 0 / 12
• Subtask 6: 0 / 23