Submission #841455

#TimeUsernameProblemLanguageResultExecution timeMemory
841455model_codeOvertaking (IOI23_overtaking)C++17
10 / 100
4 ms340 KiB
// correct/solution-subtask2.cpp

#include "overtaking.h"

#include <vector>
#include <algorithm>
#include <iostream>

#define MAXNM 1001000
#define MAXTIME 1000000000000000000

using namespace std;

long long X, N, L;
long long T[MAXNM];
long long W[MAXNM];
void init(int LL, int NN, std::vector<long long> TT, std::vector<int> WW, int XX, int /*MM*/, std::vector<int> /*SS*/)
{
    L = LL;
    N = NN;
    X = XX;
    int id = 0;
    for (long long i : TT)
        T[id++] = i;
    id = 0;
    for (int i : WW)
        W[id++] = i;
}

long long arrival_time(long long Y)
{
    long long ret = Y + L * X;
    for (int i = 0; i < N; i++)
    {
        if (T[i] < Y)
            ret = std::max(ret, T[i] + L * W[i]);
    }
    return ret;
}
#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...