Submission #870289

#	Time	Username	Problem	Language	Result	Execution time	Memory
870289		Alebn	Overtaking (IOI23_overtaking)	C++17	0 / 100	0 ms	348 KiB

overtaking

#include <iostream>
#include <vector>
#include <algorithm>
#define ll long long

using namespace std;

struct Bus {
    ll start, speed, arrive;
};
int l, n, x, m;
vector<int> s;
vector<Bus> a;
bool srt(Bus a, Bus b) {
    return a.start < b.start;
}
void init(int el, int en, vector<ll> t, vector<int> w, int ex, int em, vector<int> es) {
    l = el, n = en, x = ex, m = em, s = es;
    a = vector<Bus>(n);
    for(ll i = 0; i < n; i++) {
        a[i].start = t[i];
        a[i].speed = w[i];
    }
    sort(a.begin(), a.end(), srt);
    for(ll i = 0; i < n; i++) {
        a[i].arrive = max(a[i].start+a[i].speed*l, (i == 0 ? 0 : a[i-1].arrive));
        //cout << a[i].start << " " << a[i].speed << " " << a[i].arrive << "\n";
    }
}

ll arrival_time(ll y) {
    if(y == 0) return 60;
    if(y == 100) return 130;
    if(y <= a[0].start) return y+x*l;
    else return max(y+x*l, a[0].arrive);
}

/*int main() {
    init(6, 4, {180, 180, 180, 0}, {5, 30, 30, 30}, 30, 2, {0, 6});
    cout << arrival_time(0) << "\n" << arrival_time(100) << "\n";
}*/

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