제출 #1188359

#제출 시각아이디문제언어결과실행 시간메모리
1188359MatteoArcari추월 (IOI23_overtaking)C++20
0 / 100
0 ms324 KiB
#include "overtaking.h" #include <bits/stdc++.h> using namespace std; using ll = long long; using vi = vector<int>; vector<ll> ex; ll x, n, m, l; vector<ll> w, t, s; void init(int _l, int _n, vector<ll> _t, vi _w, int _x, int _m, vi _s) { n = _n; m = _m; x = _x; l = _l; t = _t; w = vector<ll>(_w.begin(), _w.end()); s = vector<ll>(_s.begin(), _s.end()); ex.resize(m); for (int i = 0; i < m; i++) { ex[i] = s[i] * w[0] + t[0]; } } ll arrival_time(ll y) { for (int i = 0; i < m; i++) { if (ex[i] >= y + s[i] * x) { return ex[i] + x * (l - s[i]); } } return y + l * x; }
#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...