Submission #1038933

#TimeUsernameProblemLanguageResultExecution timeMemory
1038933fv3Overtaking (IOI23_overtaking)C++17
0 / 100
1 ms348 KiB
#include "overtaking.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; int L, N, M; ll X; vector<ll> T; vector<int> W, S; ll arrival; void init(int l, int n, vector<ll> t, vector<int> w, int x, int m, vector<int> s) { L = l; N = n; T = t; W = w; X = x; M = m; S = s; arrival = T[0] + W[0] * L; return; } ll arrival_time(ll Y) { if (X <= W[0] || Y <= T[0]) return Y + X * L; return max(arrival, Y + X * L); }
#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...