# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
251153 | 2020-07-20T12:21:42 Z | AaronNaidu | Dreaming (IOI13_dreaming) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> #include "dreaming.h" using namespace std; vector<pair<int, int>> graph[100001]; int travelTime(int n, int m, int l, vector<int> a, vector<int> b, vector<int> t) { int maxDist = 0; int secondMaxDist = 0; for (int i = 0; i < t.size(); i++) { if (t[i] > maxDist) { secondMaxDist = maxDist; maxDist = t[i]; } else if (t[i] > secondMaxDist) { secondMaxDist = t[i]; } } return max(maxDist, secondMaxDist + l); }