제출 #1176354

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1176354		minhpk	Toll (BOI17_toll)	C++20	0 / 100	80 ms	25924 KiB

toll

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

int k, a, b, c;
int z[100005][5][5];
int bruh = 1e16;
vector<vector<int>> f[400005];
vector<vector<int>> v;

vector<vector<int>> combine(vector<vector<int>> left, vector<vector<int>> right, int mid) {
    vector<vector<int>> res(k, vector<int>(k, bruh));
    for (int i = 0; i < k; i++) {
        for (int j = 0; j < k; j++) {
            for (int l = 0; l < k; l++) {
                for (int r = 0; r < k; r++) {
                    res[i][j] = min(res[i][j], left[i][l] + z[mid][l][r] + right[r][j]);
                }
            }
        }
    }
    return res;
}

void build(int id, int l, int r) {
    f[id].resize(k, vector<int>(k, bruh));
    if (l == r) {
        for (int i = 0; i < k; i++) {
            f[id][i][i] = 0;
        }
        return;
    }
    int mid = (l + r) / 2;
    build(id * 2, l, mid);
    build(id * 2 + 1, mid + 1, r);
    f[id] = combine(f[id * 2], f[id * 2 + 1], mid);
}

vector<vector<int>> get(int id, int l, int r, int x, int y) {
    if (x > r || y < l) {
        return vector<vector<int>>(k, vector<int>(k, bruh)); 
    }
    if (l >= x && y >= r) {
        return f[id];
    }
    int mid = (l + r) / 2;
    vector<vector<int>> pre1 = get(id * 2, l, mid, x, y);
    vector<vector<int>> pre2 = get(id * 2 + 1, mid + 1, r, x, y);

    if (pre1 == vector<vector<int>>(k, vector<int>(k, bruh))) {
        return pre2;
    }
    if (pre2 == vector<vector<int>>(k, vector<int>(k, bruh))) {
        return pre1;
    }
    return combine(pre1, pre2, mid);
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> k >> a >> b >> c;

  
    for (int i = 0; i < 10005; i++) {
        for (int j = 0; j < k; j++) {
            for (int t = 0; t < k; t++) {
                z[i][j][t] = bruh;
            }
        }
    }

    for (int i = 1; i <= b; i++) {
        int x, y, t;
        cin >> x >> y >> t;
        z[x / k][x % k][y % k] = t;
    }

    int n = a / k + 1;
    build(1, 0, n);

    for (int i = 1; i <= c; i++) {
        int x, y;
        cin >> x >> y;

        int sta = x / k;
        int fin = y / k;
        if (sta==fin){
            cout << -1 << "\n";
            continue;
        }
        vector<vector<int>> r = get(1, 0, n, sta, fin);

        if (r[x % k][y % k] >= bruh) {
            cout << -1 << "\n";
        } else {
            cout << r[x % k][y % k] << "\n";
        }
    }

    return 0;
}

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