Submission #1233822

#	Time	Username	Problem	Language	Result	Execution time	Memory
1233822		Ghulam_Junaid	Overtaking (IOI23_overtaking)	C++20	0 / 100	0 ms	328 KiB

overtaking

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

typedef long long ll;

const int MXN = 1005;
int n, m, l;
vector<ll> T;
vector<int> W, S;
vector<vector<ll>> dp;

void init(int L, int N, vector<ll> tt, vector<int> ww, int xx, int M, vector<int> ss){
    n = N, l = L, m = M;
    ww.push_back(xx), tt.push_back(-1);
    W = ww, T = tt, S = ss;
    return;
}

ll arrival_time(ll Y){
    T[n] = Y;
    dp.resize(n + 1);
    for (int i = 0; i <= n; i ++){
        dp[i].resize(m);
        dp[i][0] = T[i];
    }

    vector<pair<pair<ll, int>, int>> order;
    for (int j = 1; j < m; j ++){
        order.clear();
        for (int i = 0; i <= n; i ++)
            order.push_back({{dp[j - 1][i], W[i]}, i});
        sort(order.begin(), order.end());

        ll mx = 0;
        for (auto [P, i] : order){
            mx = max(mx, dp[i][j - 1] + 1ll * W[i] * (S[j] - S[j - 1]));
            dp[i][j] = mx;
        }
    }
    return dp[n][m - 1];
}

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