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 "overtaking.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector <ll>;
using vi = vector <int>;
const ll MAXN = 1E3+16;
ll l, n, x, m;
vll t;
vi w, s;
// bus i moves 1 km in w[i] s/km
void init (int L, int N, vll T, vi W, int X, int M, vi S) {
l = L; n = N; x = X; m = M;
}
ll arrival_time (ll y) {
ll dis = (s[m-1]-s[0]);
assert(dis == l);
ll maxN = y + dis*x;
for (ll i = 0; i < n; i++) {
if (t[i] < y)
maxN = max(maxN, t[i] + w[i]*dis);
}
return maxN;
}
# | 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... |