oj.uz

답안 #1053565

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1053565 2024-08-11T13:19:03 Z ArthuroWich Toll (BOI17_toll) C++17
0 / 100
 208 ms 128336 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long int
vector<vector<int>> calc(vector<vector<int>> a, vector<vector<int>> b, int k) {
    vector<vector<int>> ans(k, vector<int>(k, INT_MAX));
    for (int x = 0; x < k; x++) {
        for (int i = 0; i < k; i++) {
            for (int j = 0; j < k; j++) {
                ans[i][j] = min(ans[i][j], a[i][x]+b[x][j]);
            }
        }
    }
    return ans;
}
void solve() { // I dont really like this problem
    int n, o, m, k;
    cin >> k >> n >> m >> o;
    vector<vector<vector<vector<int>>>> dp(n+1, vector<vector<vector<int>>>(17, vector<vector<int>>(k, vector<int>(k, INT_MAX))));
    for (int i = 0; i < m; i++) {
        int u, v, w;
        cin >> u >> v >> w;
        dp[u/k][0][u%k][v%k] = dp[u/k][0][u%k][v%k];
    }
    for (int j = 1; j < 17; j++) {
        for (int i = 0; i < (n+k-1)/k; i++) {
            if (i+(1<<j) >= (n+k-1)/k) {
                break;
            }
            dp[i][j] = calc(dp[i][j-1], dp[i+(1<<(j-1))][j-1], k);
        }
    }
    while(o--) {
        int a, b;
        cin >> a >> b;
        vector<vector<int>> ans(k, vector<int>(k, INT_MAX));
        for (int i = 0; i < k; i++) {
            for (int j = 0; j < k; j++) {
                ans[i][i] = 0;
            }
        }
        int i = a/k;
        for (int j = 16; j >= 0; j--) {
            if (i+(1<<j) <= b/k) {
                ans = calc(ans, dp[i][j], k);
                i += (1<<j);
            }
        }
        if (ans[a%k][b%k] == INT_MAX) {
            cout << -1 << endl;
        } else {
            cout << ans[a%k][b%k] << endl;
        }
    }
}
int32_t main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;
    t = 1;
    while(t--) {
        solve();
    }
}

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 208 ms 75088 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 202 ms 128336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 600 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 600 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 208 ms 75088 KB Output isn't correct
2 Halted 0 ms 0 KB -