Submission #1230208

#	Time	Username	Problem	Language	Result	Execution time	Memory
1230208		vladilius	Overtaking (IOI23_overtaking)	C++20	0 / 100	2 ms	324 KiB

overtaking

#include <bits/stdc++.h>
#include "overtaking.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pli = pair<ll, int>;
#define pb push_back
#define ff first
#define ss second

int n, m, l, x;
vector<ll> t;
vector<int> w, s;

void init(int L, int N, vector<ll> T, vector<int> W, int X, int M, vector<int> S){
    l = L; n = N; x = X; m = M;
    t = T; w = W; s = S;
    t.resize(n + 1);
    w.resize(n + 1); w[n] = X;
}

ll arrival_time(ll y){
    vector<vector<ll>> e(n + 1, vector<ll>(m)), T = e;
    t[n] = y;
    for (int i = 0; i <= n; i++) T[i][0] = t[i];
    
    for (int j = 1; j < m; j++){
        for (int i = 0; i <= n; i++){
            e[i][j] = T[i][j - 1] + 1LL * w[i] * (s[j] - s[j - 1]);
            cout<<e[i][j]<<" ";
        }
        cout<<"\n";
        vector<pli> all;
        for (int i = 0; i <= n; i++){
            all.pb({T[i][j - 1], i});
        }
        sort(all.begin(), all.end());
        int k = 0; ll mx = 0;
        for (int i = 0; i <= n; i++){
            while (k < i && all[k].ff < all[i].ff){
                mx = max(mx, e[all[k].ss][j]);
                k++;
            }
            T[all[i].ss][j] = max(mx, e[all[i].ss][j]);
        }
    }
    
    return T[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