# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
728351 | NeroZein | Dreaming (IOI13_dreaming) | C++17 | 31 ms | 25932 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 "dreaming.h"
#include <bits/stdc++.h>
using namespace std;
const int NN = 1000005;
int a[NN], b[NN], t[NN];
vector<pair<int, int>> g[NN];
int vis[NN];
int far[NN];
int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
int n, m, l;
n = N, m = M, l = L;
for (int i = 0; i < m; ++i) {
a[i] = A[i];
b[i] = B[i];
t[i] = T[i];
}
int mx2 = 0, mx = 0;
for (int i = 0; i < m; ++i) {
mx2 = max(mx2, T[i]);
if (mx2 > mx) {
swap(mx, mx2);
}
}
int ans = max(mx + l, mx2 + 2 * l);
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |