| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 909143 | xynex | 추월 (IOI23_overtaking) | C++17 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
/**
* Author: Tenjin
* Created: 27.04.2022 18:58
* Why am I so stupid? :c
* Slishkom slab
**/
#include <bits/stdc++.h>
// #pragma GCC optimize("inline")
// #pragma GCC optimize("-fgcse,-fgcse-lm")
// #pragma GCC optimize("-ftree-pre,-ftree-vrp")
// #pragma GCC optimize("-ffast-math")
// #pragma GCC optimize("-fipa-sra")
// #pragma GCC optimize("-fpeephole2")
// #pragma GCC optimize("-fsched-spec")
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("unroll-loops")
using namespace std;
#define ll long long
#define dl double long
#define ull unsigned long long
#define pr pair
#define vt vector
#define ff first
#define ss second
#define mp make_pair
#define sz(a) (int)a.size()
#define pb push_back
#define pf push_front
#define popB pop_back
#define popF pop_front
#define bit_count __builtin_popcount
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sp(x) fixed << setprecision(x)
template<typename T> T get_rand(T l, T r) {
random_device rd;
mt19937 gen(rd());
return uniform_int_distribution<T>(l, r)(gen);
}
template<typename T> T lcm(T a, T b) { return a * (b / __gcd(a, b)); }
template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(array<A, S>& a);
template<class T> void read(T& x) { cin >> x; }
void read(double& d) { string t; read(t); d = stod(t); }
void read(long double& d) { string t; read(t); d = stold(t); }
template<class H, class... T> void read(H& h, T&... t) { read(h); read(t...); }
template<class A> void read(vt<A>& x) { for (auto& a : x) read(a); }
template<class A, size_t S> void read(array<A, S>& x) { for (auto& a : x) read(a); }
string to_string(char c) { return string(1, c); }
string to_string(bool b) { return b ? "true" : "false"; }
string to_string(const char* s) { return string(s); }
string to_string(string s) { return s; }
string to_string(vt<bool> v) { string res; for (int i = 0; i < sz(v); ++i) res += char('0' + v[i]); return res; }
template<size_t S> string to_string(bitset<S> b) { string res; for (int i = 0; i < S; ++i) res += char('0' + b[i]); return res; }
template<class T> string to_string(T v) { bool f = 1; string res; for (auto x : v) { if (!f) res += ' '; f = 0; res += to_string(x); } return res; }
template<class A> void write(A x) { cout << to_string(x); }
template<class H, class... T> void write(const H& h, const T&... t) { write(h); write(t...); }
void print() { write("\n"); }
template<class H, class... T> void print(const H& h, const T&... t) { write(h); if (sizeof...(t)) write(' '); print(t...); }
void freop(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
const int MOD = 1e9 + 7;
const ll INF = 1e14;
const int M = 1e3 + 5;
const dl pi = acos(-1);
const dl eps = 1e-12;
const int sq = 700;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
/* ll vs int*/
/*
6 4 10 7 2
20 10 40 0
5 20 20 30
0 1 2 3 4 5 6
*/
pr<pr<ll, ll>, int> x[M][M];
int poses[M][M];
ll l, vel;
int n, m;
vt<int> arr;
/*
6 5 5 7 2
20 10 40 0 30
5 20 20 30 5
0 1 2 3 4 5 6
0
30
*/
void init(int L, int N, vt<ll> T, vt<int> W, int X, int M, vt<int> S) {
l = L;
n = N, m = M;
arr = S;
vel = X;
for(int i = 0; i < N; ++i) {
x[0][i] = {{T[i], W[i]}, i};
}
sort(x[0], x[0] + N);
for(int i = 1; i < M; ++i) {
ll ost = S[i] - S[i - 1];
for(int j = 0; j < N; ++j) x[i][j] = {{x[i - 1][j].ff.ff + ost * 1ll * x[i - 1][j].ff.ss, x[i - 1][j].ff.ss}, x[i - 1][j].ss};
for(int j = 1; j < N; ++j) x[i][j].ff.ff = max(x[i][j].ff.ff, x[i][j - 1].ff.ff);
sort(x[i], x[i] + N);
for(int j = 0; j < N; ++j) {
poses[i][x[i][j].ss] = j;
}
}
/*for(int i = 0; i < M; ++i) {
for(int j = 0; j < N; ++j) print(x[i][j].ff.ff, x[i][j].ff.ss, x[i][j].ss);
print("");
}*/
}
ll arrival_time(ll num) {
ll mx = 0;
vt<pr<ll, int>> ord;
ll res = num;
int pos = 0;
for(int i = 0; i < n; ++i) {
if(x[pos][i].ff.ff > num || pos == sz(arr) - 1) break;
//print(x[pos][i].ff.ff, x[pos][i].ff.ss);
if(x[pos][i].ff.ss > vel) {
ll mn = (max(0ll, num - x[pos][i].ff.ff) + x[pos][i].ff.ss - vel - 1) / (x[pos][i].ff.ss - vel);
if(mn == 0) continue;
int MX = mx;
int pos1 = pos;
mx += mn;
mx = min(mx, l);
while(arr[pos] < mx) pos++;
//print(num, i, mx, mn, pos, arr[pos], poses[pos][x[pos1][i].ss]);
ll cur = max(x[pos][poses[pos][x[pos1][i].ss]].ff.ff, num + (mx - MX) * 1ll * vel);
res = max(res, cur);
num = res;
//print(num);
i = 0;
}
}
num += (l - arr[pos]) * 1ll * vel;
return num;
}
int main()
{
int L, N, X, M, Q;
assert(5 == scanf("%d %d %d %d %d", &L, &N, &X, &M, &Q));
std::vector<long long> T(N);
for (int i = 0; i < N; i++)
assert(1 == scanf("%lld", &T[i]));
std::vector<int> W(N);
for (int i = 0; i < N; i++)
assert(1 == scanf("%d", &W[i]));
std::vector<int> S(M);
for (int i = 0; i < M; i++)
assert(1 == scanf("%d", &S[i]));
std::vector<long long> Y(Q);
for (int i = 0; i < Q; i++)
assert(1 == scanf("%lld", &Y[i]));
fclose(stdin);
init(L, N, T, W, X, M, S);
std::vector<long long> res(Q);
for (int i = 0; i < Q; i++)
res[i] = arrival_time(Y[i]);
for (int i = 0; i < Q; i++)
printf("%lld\n", res[i]);
fclose(stdout);
return 0;
}
/*
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
//freop("");
int t = 1;
//read(t);
for (int i = 1; i <= t; ++i) {
//write("Case #" + to_string(i) + ": ");
solve();
}
return 0;
}*/