Submission #980964

#TimeUsernameProblemLanguageResultExecution timeMemory
980964vjudge1추월 (IOI23_overtaking)C++17
9 / 100
4 ms464 KiB
#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 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...