# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1024991 | Mardonbekhazratov | Overtaking (IOI23_overtaking) | C++17 | 0 ms | 0 KiB |
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"
#include <iostream>
using namespace std;
int l,n,x,m;
vector<long long>t;
vector<int>w,s;
void init(int L, int N, std::vector<long long> T, std::vector<int> W, int X, int M, std::vector<int> S){
tie(l,n,x,m,t,w,s)=tie(L,N,X,M,T,W,S);
return;
}
long long arrival_time(long long Y){
if(n==1) return Y+1ll*x*l;
}