Submission #899651

#TimeUsernameProblemLanguageResultExecution timeMemory
899651LudisseyOvertaking (IOI23_overtaking)C++17
0 / 100
0 ms348 KiB
#include "overtaking.h" #include <bits/stdc++.h> using namespace std; #define int long long int l,n,x,m; vector<int> t,w,s; void init(signed L, signed N, std::vector<long long> T, std::vector<signed> W, signed X, signed M, std::vector<signed> S) { l=L; n=N; x=X; m=M; swap(t,T); s.assign(S.begin(),S.end()); w.assign(W.begin(),W.end()); return; } long long arrival_time(long long Y) { if(x>=w[0]||s[0]<=Y) return x*l + Y; int eqPos=m+1; for (int i = 1; i < m; i++) { if(x*s[i]+Y<=t[0]+w[0]*s[i]) {eqPos=i; break;} } //cerr << eqPos << "\n"; if(eqPos>=m) return x*l + Y; if(eqPos==m-1) return w[0]*l+t[0]; return (w[0]*s[eqPos]+t[0])+(l-s[eqPos])*x; }
#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...