제출 #1022701

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1022701		thinknoexit	추월 (IOI23_overtaking)	C++17	0 / 100	1 ms	348 KiB

overtaking

#include "overtaking.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1010;
pair<ll, ll> a[N][N];
ll e[N][N], pref[N][N], s[N];
int n, m;
ll X;
void init(int L, int NN, vector<ll> T, vector<int> W, int X, int M, vector<int> S) {
    n = NN;
    m = M;
    ::X = X;
    for (int i = 0;i < m;i++) {
        s[i] = S[i];
    }
    for (int i = 0;i < n;i++) {
        a[0][i] = { T[i], W[i] };
    }
    for (int K = 0;K < m - 1;K++) {
        sort(a[K], a[K] + n);
        int idx = 0;
        ll mx = 0;
        for (int i = 0, j;i < n;i = j) {
            for (j = i;j < n && a[K][i].first == a[K][j].first;j++) {
                pref[K][j] = mx;
                a[K + 1][idx++] = { max(a[K][j].first + a[K][j].second * (s[K + 1] - s[K]), mx)
                                    , a[K][j].second };
            }
            for (j = i;j < n && a[K][i] == a[K][j];j++) {
                e[K][j] = a[K][j].first + a[K][j].second * (s[K + 1] - s[K]);
                mx = max(mx, e[K][j]);
            }
        }
    }
    sort(a[m - 1], a[m - 1] + n);
}

ll arrival_time(ll Y) {
    ll now = Y;
    for (int i = 0;i < m - 1;i++) {
        int idx = lower_bound(a[i], a[i] + n, pair<ll, ll>(now, 0ll)) - a[i];
        now = max(pref[i][min(idx, n - 1)], now + X * (s[i + 1] - s[i]));
    }
    return now;
}

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