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 <bits/stdc++.h>
#define rep(a,b,c) for(int a=b; a<c; a++)
#define repr(a,b,c) for(int a=b-1; a>c-1; a--)
#define repa(a,b) for(auto a:b)
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define pb push_back
using namespace std;
const int lim=2e5+5;
vector<pll> bus(lim);
vector<ll> ss;
ll n, l, x;
void init(int L, int N, std::vector<long long> T, std::vector<int> W, int X, int M, std::vector<int> S){
ss.clear();
rep(i,0,N) bus[i]={T[i],W[i]};
rep(i,0,M) ss.pb(S[i]);
x=X;
l=L;
n=N;
}
long long arrival_time(long long Y){
if(Y<=bus[0].fi) return Y+(x*l);
repa(e,ss){
if(bus[0].fi+bus[0].se*e<=Y+x*e){
return bus[0].fi+(bus[0].se*(ss.back()-e));
}
}
return Y+(x*l);
}
# | 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... |