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"
using namespace std;
using lli=long long;
lli Ti;
lli Wi;
lli Xi;
vector<int> st;
void init(int L, int N, vector<long long> T, vector<int> W, int X, int M, vector<int> S)
{
Ti=T[0];
Wi=W[0];
Xi=X;
st=S;
return;
}
long long arrival_time(long long Y)
{
lli M=st.size();
vector<lli> t (M);
vector<lli> yi (M);
t[0]=Ti;
yi[0]=Y;
for(lli i=1; i<M; ++i){
t[i]=t[i-1]+(st[i]-st[i-1])*Wi;
yi[i]=yi[i-1]+(st[i]-st[i-1])*Xi;
if(t[i-1]>yi[i-1]){
if(t[i]<yi[i]){
t[i]=yi[i];
}
}
else if(t[i-1]<yi[i-1]){
if(t[i]>yi[i]){
yi[i]=t[i];
}
}
}
return yi[M-1];
}
# | 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... |