Submission #1246525

#	Time	Username	Problem	Language	Result	Execution time	Memory
1246525		colossal_pepe	추월 (IOI23_overtaking)	C++20	65 / 100	3595 ms	33352 KiB

overtaking

#include "overtaking.h"
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

ll l, x;
int n, m;
vector<ll> s;
vector<vector<tuple<ll, ll, int>>> table;
vector<vector<ll>> et;
vector<vector<ll>> dp;

void init(int L, int N, vector<ll> T, vector<int> W, int X, int M, vector<int> S) {
    l = L, x = X;
    m = M;
    s.assign(S.begin(), S.end());
    table.resize(m, vector<tuple<ll, ll, int>>(0));
    for (int i = 0; i < N; i++) {
        if (W[i] <= x) continue;
        table[0].emplace_back(T[i], W[i], table[0].size());
    }
    n = table[0].size();
    et.resize(m, vector<ll>(n));
    for (int i = 0; i < n; i++) {
        et[0][i] = get<0>(table[0][i]);
    }
    for (int i = 1; i < m; i++) {
        sort(table[i - 1].begin(), table[i - 1].end());
        table[i] = table[i - 1];
        for (int j = 0; j < n; j++) {
            auto &[t_nxt, w, idx] = table[i][j];
            t_nxt = et[i - 1][idx] + w * (s[i] - s[i - 1]);
            if (j) t_nxt = max(t_nxt, get<0>(table[i][j - 1]));
            et[i][idx] = get<0>(table[i][j]);
        }
    }
    return;
}

ll arrival_time(ll Y) {
    ll start = Y, arrive;
    for (int i = 1; i < m; i++) {
        arrive = start + x * (s[i] - s[i - 1]);
        auto itr = lower_bound(table[i - 1].begin(), table[i - 1].end(), make_tuple(start, x, n + 1));
        if (itr != table[i - 1].begin()) {
            auto [_, __, j] = *prev(itr);
            arrive = max(arrive, et[i][j]);
        }
        start = arrive;
    }
    return start;
}

• Subtask 0: 0 / 0
• Subtask 1: 9 / 9
• Subtask 2: 10 / 10
• Subtask 3: 20 / 20
• Subtask 4: 26 / 26
• Subtask 5: 0 / 35