# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
251157 | AaronNaidu | Dreaming (IOI13_dreaming) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "dreaming.h"
using namespace std;
vector<pair<int, int>> graph[100001];
int travelTime(int n, int m, int l, int[] a, int[] b, int[] t) {
int maxDist = 0;
int secondMaxDist = 0;
for (int i = 0; i < m; i++)
{
if (t[i] > maxDist)
{
secondMaxDist = maxDist;
maxDist = t[i];
}
else if (t[i] > secondMaxDist)
{
secondMaxDist = t[i];
}
}
return max(maxDist, secondMaxDist + l);
}