Submission #1366257

#	Time	Username	Problem	Language	Result	Execution time	Memory
1366257		backer8002	Tycho (BOI23_tycho)	C++20	27 / 100	2095 ms	1960 KiB

Main

#include <bits/stdc++.h>
using namespace std;

int main() {
    long B,P,D,N;
    cin >> B >> P >> D >> N;

    vector<long> places(N+2);
    places[0] = 0, places.back() = B;
    for (int i = 0; i < N; i++)
        cin >> places[i+1];
    vector<long> dp(N+1);
    for (int i = N;i >= 0; i--) {
        long cost = (places[i+1]-places[i]-1)/P * D + places[i+1]-places[i];
        long time = places[i+1] - places[i];
        long minCost = LONG_MAX;
        for (int j = i+1; j < N+1 and cost < minCost; j++) {
            minCost = min(minCost,dp[j] + cost + (P-time%P)%P);
            cost += (places[j+1]-places[j]-1 + time%P)/P * D + places[j+1] - places[j];
            time += places[j+1]-places[j];
        }
        dp[i] = min(minCost,cost);
    }
    cout << dp.front();
}

• Subtask 1: 0 / 0
• Subtask 2: 0 / 8
• Subtask 3: 5 / 5
• Subtask 4: 7 / 7
• Subtask 5: 15 / 15
• Subtask 6: 0 / 20
• Subtask 7: 0 / 35
• Subtask 8: 0 / 10