제출 #1235771

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1235771		RakhimovAmir	추월 (IOI23_overtaking)	C++20	0 / 100	0 ms	328 KiB

overtaking

#include "overtaking.h"
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int L, N, X, M;
vector<vector<ll>> e;
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;
    ::T = T;
    ::W = W;
    ::X = X;
    ::M = M;
    ::S = S;
    e.resize(N);
    for (int i = 0; i < N; i++) {
        e[i].resize(M);
    }
    for (int i = 0; i < M; i++) {
        e[0][i] = T[i];
    }
    for (int i = 1; i < N; i++) {
        vector<pair<ll, int>> ord;
        for (int j = 0; j < M; j++) {
            ord.push_back({e[i - 1][j], j});
        }
        sort(ord.begin(), ord.end());
        ll mx = 0;
        for (int j = 0; j < M; j++) {
            ll nw = ord[j].second;
            e[i][nw] = max(mx, e[i - 1][nw] + W[nw] * (S[i] - S[i - 1]));
            if (j < M - 1 && ord[j].first != ord[j + 1].first)
                mx = max(mx, e[i][nw]);
        }
    }
    return;
}

ll arrival_time(ll Y) {
    ll tim = Y;
    for (int i = 1; i < N; i++) {
        ll nx = tim + X * (S[i] - S[i - 1]);
        for (int j = 0; j < M; j++) {
            if (e[i - 1][j] < tim)
                nx = max(nx, e[i][j]);
        }
        tim = nx;
    }
    return tim;
}

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