oj.uz

Submission #756302

# Submission time Handle Problem Language Result Execution time Memory
756302 2023-06-11T12:51:10 Z Shreyan_Paliwal Toll (BOI17_toll) C++17
100 / 100
 198 ms 166756 KB 
#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);
    // freopen("main.in", "r", stdin);

	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] == 0x3f3f3f3f3f3f3f3f ? -1 : ans[a % k][b % k])
		     << '\n';
	}
	return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 166732 KB Output is correct
2 Correct 62 ms 166524 KB Output is correct
3 Correct 63 ms 166516 KB Output is correct
4 Correct 62 ms 166596 KB Output is correct
5 Correct 62 ms 166520 KB Output is correct
6 Correct 63 ms 166516 KB Output is correct
7 Correct 63 ms 166556 KB Output is correct
8 Correct 107 ms 166604 KB Output is correct
9 Correct 105 ms 166560 KB Output is correct
10 Correct 87 ms 166568 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 166588 KB Output is correct
2 Correct 62 ms 166608 KB Output is correct
3 Correct 61 ms 166592 KB Output is correct
4 Correct 70 ms 166568 KB Output is correct
5 Correct 64 ms 166540 KB Output is correct
6 Correct 64 ms 166604 KB Output is correct
7 Correct 68 ms 166640 KB Output is correct
8 Correct 73 ms 166636 KB Output is correct
9 Correct 104 ms 166640 KB Output is correct
10 Correct 144 ms 166648 KB Output is correct
11 Correct 172 ms 166728 KB Output is correct
12 Correct 121 ms 166616 KB Output is correct
13 Correct 118 ms 166552 KB Output is correct
14 Correct 111 ms 166600 KB Output is correct
15 Correct 106 ms 166604 KB Output is correct
16 Correct 102 ms 166572 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 166636 KB Output is correct
2 Correct 63 ms 166576 KB Output is correct
3 Correct 73 ms 166632 KB Output is correct
4 Correct 75 ms 166636 KB Output is correct
5 Correct 65 ms 166548 KB Output is correct
6 Correct 66 ms 166612 KB Output is correct
7 Correct 66 ms 166572 KB Output is correct
8 Correct 64 ms 166596 KB Output is correct
9 Correct 66 ms 166608 KB Output is correct
10 Correct 101 ms 166644 KB Output is correct
11 Correct 117 ms 166756 KB Output is correct
12 Correct 152 ms 166612 KB Output is correct
13 Correct 134 ms 166604 KB Output is correct
14 Correct 125 ms 166616 KB Output is correct
15 Correct 99 ms 166644 KB Output is correct
16 Correct 111 ms 166528 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 166636 KB Output is correct
2 Correct 63 ms 166576 KB Output is correct
3 Correct 73 ms 166632 KB Output is correct
4 Correct 75 ms 166636 KB Output is correct
5 Correct 65 ms 166548 KB Output is correct
6 Correct 66 ms 166612 KB Output is correct
7 Correct 66 ms 166572 KB Output is correct
8 Correct 64 ms 166596 KB Output is correct
9 Correct 66 ms 166608 KB Output is correct
10 Correct 101 ms 166644 KB Output is correct
11 Correct 117 ms 166756 KB Output is correct
12 Correct 152 ms 166612 KB Output is correct
13 Correct 134 ms 166604 KB Output is correct
14 Correct 125 ms 166616 KB Output is correct
15 Correct 99 ms 166644 KB Output is correct
16 Correct 111 ms 166528 KB Output is correct
17 Correct 130 ms 166640 KB Output is correct
18 Correct 64 ms 166552 KB Output is correct
19 Correct 62 ms 166576 KB Output is correct
20 Correct 62 ms 166608 KB Output is correct
21 Correct 67 ms 166604 KB Output is correct
22 Correct 65 ms 166604 KB Output is correct
23 Correct 65 ms 166540 KB Output is correct
24 Correct 93 ms 166624 KB Output is correct
25 Correct 69 ms 166540 KB Output is correct
26 Correct 69 ms 166604 KB Output is correct
27 Correct 103 ms 166604 KB Output is correct
28 Correct 155 ms 166600 KB Output is correct
29 Correct 160 ms 166604 KB Output is correct
30 Correct 131 ms 166652 KB Output is correct

Subtask #5
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 166732 KB Output is correct
2 Correct 62 ms 166524 KB Output is correct
3 Correct 63 ms 166516 KB Output is correct
4 Correct 62 ms 166596 KB Output is correct
5 Correct 62 ms 166520 KB Output is correct
6 Correct 63 ms 166516 KB Output is correct
7 Correct 63 ms 166556 KB Output is correct
8 Correct 107 ms 166604 KB Output is correct
9 Correct 105 ms 166560 KB Output is correct
10 Correct 87 ms 166568 KB Output is correct
11 Correct 123 ms 166588 KB Output is correct
12 Correct 62 ms 166608 KB Output is correct
13 Correct 61 ms 166592 KB Output is correct
14 Correct 70 ms 166568 KB Output is correct
15 Correct 64 ms 166540 KB Output is correct
16 Correct 64 ms 166604 KB Output is correct
17 Correct 68 ms 166640 KB Output is correct
18 Correct 73 ms 166636 KB Output is correct
19 Correct 104 ms 166640 KB Output is correct
20 Correct 144 ms 166648 KB Output is correct
21 Correct 172 ms 166728 KB Output is correct
22 Correct 121 ms 166616 KB Output is correct
23 Correct 118 ms 166552 KB Output is correct
24 Correct 111 ms 166600 KB Output is correct
25 Correct 106 ms 166604 KB Output is correct
26 Correct 102 ms 166572 KB Output is correct
27 Correct 66 ms 166636 KB Output is correct
28 Correct 63 ms 166576 KB Output is correct
29 Correct 73 ms 166632 KB Output is correct
30 Correct 75 ms 166636 KB Output is correct
31 Correct 65 ms 166548 KB Output is correct
32 Correct 66 ms 166612 KB Output is correct
33 Correct 66 ms 166572 KB Output is correct
34 Correct 64 ms 166596 KB Output is correct
35 Correct 66 ms 166608 KB Output is correct
36 Correct 101 ms 166644 KB Output is correct
37 Correct 117 ms 166756 KB Output is correct
38 Correct 152 ms 166612 KB Output is correct
39 Correct 134 ms 166604 KB Output is correct
40 Correct 125 ms 166616 KB Output is correct
41 Correct 99 ms 166644 KB Output is correct
42 Correct 111 ms 166528 KB Output is correct
43 Correct 130 ms 166640 KB Output is correct
44 Correct 64 ms 166552 KB Output is correct
45 Correct 62 ms 166576 KB Output is correct
46 Correct 62 ms 166608 KB Output is correct
47 Correct 67 ms 166604 KB Output is correct
48 Correct 65 ms 166604 KB Output is correct
49 Correct 65 ms 166540 KB Output is correct
50 Correct 93 ms 166624 KB Output is correct
51 Correct 69 ms 166540 KB Output is correct
52 Correct 69 ms 166604 KB Output is correct
53 Correct 103 ms 166604 KB Output is correct
54 Correct 155 ms 166600 KB Output is correct
55 Correct 160 ms 166604 KB Output is correct
56 Correct 131 ms 166652 KB Output is correct
57 Correct 198 ms 166640 KB Output is correct
58 Correct 104 ms 166660 KB Output is correct
59 Correct 129 ms 166664 KB Output is correct