Submission #1147738

#	Time	Username	Problem	Language	Result	Execution time	Memory
1147738		KickingKun	Dreaming (IOI13_dreaming)	C++20	0 / 100	16 ms	1344 KiB

dreaming

#include "dreaming.h"
#include <bits/stdc++.h>
using namespace std;

int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
    sort (T, T + M, greater <int>());
    if (M == 0) {
    	if (N == 1) return 0;
		if (N == 2) return L;
		return 2 * L;
	}
	
	if (M == 1) {
		if (N == 2) return 0;
		if (N == 3) return L + T[0];
		return max(L * 2, L + T[0]);
	}
	
	int alone = N - M - 1;
	int res = T[0] + T[1] + L;
	if (alone > 0) res = max(res, L * 2 + T[1]);
	return res;
}

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