Submission #980972

#TimeUsernameProblemLanguageResultExecution timeMemory
980972vjudge1Overtaking (IOI23_overtaking)C++17
0 / 100
1 ms600 KiB
#include "overtaking.h" #include <bits/stdc++.h> using namespace std; using ll = long long; using vll = vector <ll>; using vi = vector <int>; int 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, ::t = t, ::w = w, ::x = x, ::m = m, ::s = s; assert(::m == 2); assert(::s[0] == 0 && ::s[1] == ::l); } ll arrival_time (ll y) { ll maxN = ll(x)+y*ll(l); for (ll i = 0; i < n; i++) { if (t[i] < y) maxN = max(maxN, t[i]+ll(w[i])*ll(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...