제출 #1128632

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1128632		pcheloveks	Toll (BOI17_toll)	C++20	39 / 100	3094 ms	5988 KiB

toll

//#pragma GCC optimize("O3")
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <fstream>
#include <algorithm>
#include <cstring> // Для memset

#define endl '\n'
using namespace std;

typedef long long LL;
typedef pair<LL, LL> pii;

const LL DIM = 50007;
const LL INF = 999999999999;

LL n, k, o, m;

class edge {
public:
    LL to, w;
};

vector < edge > v[DIM];

class tran {
public:
    LL mat[6][6];
    void init() {
        for (int i = 1; i <= k; i++) {
            for (int j = 1; j <= k; j++) {
                mat[i][j] = INF;
            }
        }
    }
};

tran solve(LL L, LL R) {
    tran ans;
    if (R - L == 1) {
        ans.init();
        for (int i = 1; i <= k; i++) {
            LL val = (L - 1) * k + i - 1;
            for (auto to : v[val]) {
                ans.mat[i][to.to - ((R - 1) * k) + 1] = to.w;
            }
        }
        return ans;
    }
    
    LL mid = (L + R) / 2;

    tran m1 = solve(L, mid);
    tran m2 = solve(mid, R);

    for (int l = 1; l <= k; l++) {
        for (int r = 1; r <= k; r++) {
            ans.mat[l][r] = INF;
            for (int m = 1; m <= k; m++)  {
                if (m1.mat[l][m] != INF && m2.mat[m][r] != INF) ans.mat[l][r] = min(ans.mat[l][r], m1.mat[l][m] + m2.mat[m][r]);
            }
        }
    }

    return ans;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin >> k >> n >> m >> o;
    for (int i = 1; i <= m; i++) {
        LL a, b, t;
        cin >> a >> b >> t;
        v[a].push_back({ b, t });
    }

    for (int i = 1; i <= o; i++) {
        LL a, b;
        cin >> a >> b;

        LL b1 = a / k + 1;
        LL b2 = b / k + 1;
        if (b1 >= b2) cout << -1 << endl;
        else {
            LL res = solve(b1, b2).mat[a - ((b1 - 1) * k) + 1][b - ((b2 - 1) * k) + 1];
            if (res == INF) cout << -1;
            else cout << res;
            cout << endl;
        }
    }

    return 0;
}

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