제출 #1306423

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1306423		zxzuam	Toll (BOI17_toll)	C++20	100 / 100	2007 ms	6664 KiB

toll

#include <bits/stdc++.h>
#define int long long
using namespace std;
constexpr int MAXN = 50009, inf = 1e18;
vector <pair <int, int>> g[MAXN];
void solve() {
    int k, n, m, q;
    cin >> k >> n >> m >> q;
    for(int i = 1; i <= m; i++) {
        int a, b, t;
        cin >> a >> b >> t;
        g[a].emplace_back(b, t);
    }
    vector <int> dp(n);
    while(q--) {
        int a, b;
        cin >> a >> b;
        for(int i = a; i <= b; i++) {
            dp[i] = inf;
        }
        dp[a] = 0;
        for(int i = a; i <= b; i++) {
            for(auto [to, w] : g[i]) {
                dp[to] = min(dp[to], dp[i] + w);
            }
        }
        cout<<(dp[b] == inf ? -1 : dp[b]) << '\n';
    }
}
signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    //freopen("7-router.in", "r", stdin);
    //freopen("7-router.out.txt", "w", stdout);
    int tt = 1;
    //cin >> tt;
    while (tt--){
        solve();
    }
}

• Subtask 1: 7 / 7
• Subtask 2: 10 / 10
• Subtask 3: 8 / 8
• Subtask 4: 31 / 31
• Subtask 5: 44 / 44