제출 #980967

#제출 시각아이디문제언어결과실행 시간메모리
980967vjudge1추월 (IOI23_overtaking)C++17
0 / 100
1 ms348 KiB
#include "overtaking.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector <ll>;
using vi = vector <int>;

ll l, n, x, m;
vll t, 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, ::t = t, ::w = vll(w.begin(), w.end()), ::x = x, ::m = m, ::s = vll(s.begin(), s.end());
    assert(::m == 2);
    assert(::s[0] == 0 && ::s[1] == ::l);
}

ll arrival_time (ll y) {
    ll maxN = x+y*l;
    for (ll i = 0; i < n; i++) {
        if (t[i] < y) maxN = max(maxN, t[i]+w[i]*l);
    }
    return maxN;
}
#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...