제출 #1103653

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1103653		ortsac	Toll (BOI17_toll)	C++17	17 / 100	1879 ms	6732 KiB

toll

#include <bits/stdc++.h>

using namespace std;

#define pii pair<int, int>
#define fm first
#define t second

const int MAXN = 5e4 + 10;

vector<pii> rec[MAXN];
int ans[MAXN];

void calc(int a, int b) {
    for (int i = max(a - 5, 0); i <= b; i++) ans[i] = -1;
    ans[a] = 0;
    for (int i = a + 1; i <= b; i++) {
        for (auto u : rec[i]) {
            if (ans[u.fm] != -1) {
                if (ans[i] == -1) ans[i] = (ans[u.fm] + u.t);
                else ans[i] = min(ans[i], ans[u.fm] + u.t);
            }
        }
    }
}

int32_t main() {
    int k, n, m, o;
    cin >> k >> n >> m >> o;
    for (int i = 0; i < m; i++) {
        int a, b, toll;
        cin >> a >> b >> toll;
        rec[b].push_back({a, toll});
    }
    for (int i = 0; i < o; i++) {
        int a, b;
        cin >> a >> b;
        calc(a, b);
        cout << ans[b] << "\n";
    }
}

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