제출 #981022

#제출 시각아이디문제언어결과실행 시간메모리
981022vjudge1Overtaking (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>; 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]); 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 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...