Submission #335361

#	Time	Username	Problem	Language	Result	Execution time	Memory
335361		ncduy0303	Journey (NOI18_journey)	C++17	100 / 100	69 ms	17516 KiB

journey

#include <bits/stdc++.h>

using namespace std;

#define ar array
#define ll long long

const int MAX_N = 1e4 + 1;
const int MAX_M = 4e2 + 1;
const int MAX = 5e8 + 1;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = 1e18;

int n, m, h, dp[MAX_N][MAX_M];

void solve() {
    cin >> n >> m >> h;
    dp[0][0] = 1;
    for (int u = 0; u < n - 1; u++) {
        for (int i = 0; i < h; i++) {
            int v, t; cin >> v >> t;
            if (v <= u) continue;
            int s = 0;
            for (int j = 0; j + t < m; j++) {
                s = min(s + dp[u][j], MAX);
                dp[v][j + t] = min(dp[v][j + t] + s, MAX);
            }
        }
    }
    for (int i = 0; i < m; i++) cout << dp[n - 1][i] << " ";
    cout << "\n";
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "t", stdout);

    int tc = 1;
    // cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case #" << t  << ": ";
        solve();
    }
}

• Subtask 1: 20 / 20
• Subtask 2: 23 / 23
• Subtask 3: 26 / 26
• Subtask 4: 31 / 31