제출 #848511

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
848511		mohammedMonem	추월 (IOI23_overtaking)	C++17	39 / 100	3572 ms	8360 KiB

overtaking

#include <bits/stdc++.h>
#include "overtaking.h"

#define ll long long

using namespace std;

class bus {
public:
    int id;
    ll speed, arrivalTime;

    explicit bus(int idP = 0, ll speedP = 0, ll arrivalTimeP = 0) {
        id = idP, speed = speedP, arrivalTime = arrivalTimeP;
    }

    friend bool operator<(bus bus1, bus bus2) {
        if (bus1.arrivalTime == bus2.arrivalTime) {
            return bus1.speed < bus2.speed;
        }
        return bus1.arrivalTime < bus2.arrivalTime;
    }
};

ll reserveBusSpeed;
vector<vector<ll>> trueArrivalTime;//for i bus and j station
vector<ll> sortingStations;

void init(int L, int N, vector<ll> T, vector<int> W, int X, int M, vector<int> S) {
    trueArrivalTime.resize(N, vector<ll>(M));
    for (int i = 0; i < N; ++i) {
        trueArrivalTime[i][0] = T[i];
    }
    reserveBusSpeed = X;
    for (const auto &i: S) {
        sortingStations.push_back(i);
    }
    vector<ll> expectedArrivalTime(N);//for i bus and j station
    vector<bus> sortedBuses(N);
    for (int j = 1; j < M; ++j) {
        for (int i = 0; i < N; ++i) {
            sortedBuses[i] = bus(i, (ll)W[i], trueArrivalTime[i][j - 1]);
            expectedArrivalTime[i] = trueArrivalTime[i][j - 1] + (ll)W[i] * (ll)(S[j] - S[j - 1]);
        }
        ll movingBusesArrivalTime = 0;
        sort(sortedBuses.begin(), sortedBuses.end());
        for (const auto &i: sortedBuses) {
            movingBusesArrivalTime = trueArrivalTime[i.id][j] =
                    max(movingBusesArrivalTime, expectedArrivalTime[i.id]);
        }
    }
}

long long arrival_time(long long Y) {
    ll prevStationDepartingTime = Y;
    for (int j = 1; j < (int) sortingStations.size(); ++j) {
        ll reserveBusArrivalTime = prevStationDepartingTime
                                   + reserveBusSpeed * (sortingStations[j] - sortingStations[j - 1]);
        for (const auto &i: trueArrivalTime) {
            if (i[j - 1] < prevStationDepartingTime) {
                reserveBusArrivalTime = max(reserveBusArrivalTime, i[j]);
            }
        }
        prevStationDepartingTime = reserveBusArrivalTime;
    }
    return prevStationDepartingTime;
}

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