제출 #1242311

#제출 시각아이디문제언어결과실행 시간메모리
1242311bangan추월 (IOI23_overtaking)C++20
10 / 100
2 ms328 KiB
#include "overtaking.h"
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define chmin(a, b) a = min(a, b)
#define chmax(a, b) a = max(a, b)

#define pb push_back

int n;
vector<ll> t, w;

int m;
vector<ll> s;

void init(int L, int N, std::vector<long long> T, std::vector<int> W, int X, int M, std::vector<int> S) {
    n = N;
    for (auto it : T) t.pb(it);
    t.pb(0);
    for (auto it : W) w.pb(it);
    w.pb(X);

    m = M;
    for (auto it : S) s.pb(it);

    assert(s[0]==0);
    assert(s[m-1]==L);
}

ll arrival_time(ll Y) {
    t[n] = Y;
    ll ans = t[n] + w[n] * s[m-1];

    for (int i=0; i<n; i++) if (t[i] < t[n]) {
        chmax(ans, t[i] + w[i] * s[m-1]);
    }

    return ans;
}
#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...