Submission #1147735

#TimeUsernameProblemLanguageResultExecution timeMemory
1147735KickingKunDreaming (IOI13_dreaming)C++20
0 / 100
13 ms1344 KiB
#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 == 2) return L; return 2 * L; } int alone = N - M - 1; int res = 0; if (M >= 2) res = max(res, T[0] + T[1] + L); if (alone > 0) res = max(res, L * 2 + T[1]); return res; }
#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...