#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 50000;
const int maxo = 10000;
const int maxk = 5;
const int logn = 17;
const int INF = 1e15;
int k, n, m, o;
int dp[maxn][logn][maxk][maxk];
int ans[maxk][maxk], ans2[maxk][maxk];
// inline void comb(int a2[maxk][maxk], int a[maxk][maxk], int m[maxk][maxk]) {
// for (int i = 0; i < k; i++)
// for (int j = 0; j < k; j++)
// for (int l = 0; l < k; l++)
// a2[i][l] = min(a2[i][l], a[i][j] + m[j][l]);
// }
// signed main() {
// cin.tie(nullptr) -> ios::sync_with_stdio(false);
// freopen("main.in", "r", stdin);
// fill(dp[0][0][0], dp[0][0][0] + maxn*logn*maxk*maxk, INF);
// cin >> k >> n >> m >> o;
// for (int i = 0; i < m; i++) {
// int a, b, t; cin >> a >> b >> t;
// dp[a/k][0][a%k][b%k] = t;
// }
// // set up binary lifting
// for (int i = 1; i < logn; i++) { // for each power of 2 jump
// for (int j = 0; j + (1 << i) <= (n-k+1)/k; j++) { // do all j where j+(power of 2) is still an actual section
// comb(dp[j][i], dp[j][i-1], dp[j+(1<<(i-1))][i-1]);
// }
// }
// for (int i = 0; i < o; i++) {
// int a, b; cin >> a >> b;
// int A = a/k, B = b/k;
// fill(ans[0], ans[0] + maxk*maxk, INF);
// ans[a%k][a%k] = 0;
// for (int j = logn-1; j >= 0; j--)
// if (((B-A)>>j) & 1) {
// fill(ans2[0], ans2[0] + maxk*maxk, INF);
// comb(ans2, ans, dp[A][j]);
// A += (1<<j);
// for (int c = 0; c < k; c++)
// for (int d = 0; d < k; d++)
// ans[c][d] = ans2[c][d];
// }
// cout << (ans[a%k][b%k] == INF ? -1 : ans[a%k][b%k]) << endl;
// }
// return 0;
// }
// int k, n, m, o;
// int dp[50000][17][5][5], ans[5][5], ans2[5][5];
void combine(int target[5][5], int a[5][5], int b[5][5]) {
for (int x = 0; x < k; x++) {
for (int y = 0; y < k; y++) {
for (int z = 0; z < k; z++) {
target[x][y] = min(target[x][y], a[x][z] + b[z][y]);
}
}
}
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> k >> n >> m >> o;
memset(dp, 0x3f, sizeof dp);
while (m--) {
int a, b, t;
cin >> a >> b >> t;
dp[a / k][0][a % k][b % k] = t;
}
for (int j = 1; j < 17; j++) {
for (int i = 0; i + (1 << j) < (n + k - 1) / k; i++) {
combine(dp[i][j], dp[i][j - 1], dp[i + (1 << j - 1)][j - 1]);
}
}
while (o--) {
int a, b;
cin >> a >> b;
memset(ans, 0x3f, sizeof ans);
for (int i = 0; i < 5; i++) ans[i][i] = 0;
for (int curr = a / k, dest = b / k, i = 16; ~i; i--) {
if (curr + (1 << i) <= dest) {
memset(ans2, 0x3f, sizeof ans2);
combine(ans2, ans, dp[curr][i]);
memcpy(ans, ans2, sizeof ans);
curr += (1 << i);
}
}
cout << (ans[a % k][b % k] == 0x3f3f3f3f ? -1 : ans[a % k][b % k])
<< '\n';
}
return 0;
}
Compilation message
toll.cpp: In function 'int main()':
toll.cpp:88:51: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
88 | combine(dp[i][j], dp[i][j - 1], dp[i + (1 << j - 1)][j - 1]);
| ~~^~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
102 ms |
166732 KB |
Output is correct |
| 2 |
Incorrect |
61 ms |
166624 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
116 ms |
166716 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
62 ms |
166524 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
62 ms |
166524 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
102 ms |
166732 KB |
Output is correct |
| 2 |
Incorrect |
61 ms |
166624 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
