# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1078064 | MohamedFaresNebili | Overtaking (IOI23_overtaking) | C++17 | 3546 ms | 8408 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 <bits/stdc++.h>
#include "overtaking.h"
using namespace std;
int L, N, X, M;
vector<int> S, W;
vector<long long> T;
bool comp(array<long long, 3> U, array<long long, 3> V) {
if(U[0] != V[0]) return U[0] < V[0];
if(U[1] != V[1]) return U[1] < V[1];
return U[2] < V[2];
}
void init(int _L, int _N, vector<long long> _T, vector<int> _W, int _X, int _M, vector<int> _S) {
L = _L, N = _N, X = _X, M = _M;
swap(S, _S);
swap(W, _W);
swap(T, _T);
W.push_back(X);
}
long long arrival_time(long long Y) {
vector<vector<long long>> A(N + 1, vector<long long> (M));
for(int l = 0; l < N; l++)
A[l][0] = T[l];
A[N][0] = Y;
for(int i = 1; i < M; i++) {
vector<array<long long, 3>> ord;
# | 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... |