oj.uz

Submission #756299

# Submission time Handle Problem Language Result Execution time Memory
756299 2023-06-11T12:48:51 Z Shreyan_Paliwal Toll (BOI17_toll) C++17
100 / 100
 136 ms 86908 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;
// pair<int,int> orders[maxo];
// 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;
// }

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

int k, n, m, o;
int dp[50000][17][5][5], ans[5][5], tmp[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]);
			}
		}
	}
}

int 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(tmp, 0x3f, sizeof tmp);
				combine(tmp, ans, dp[curr][i]);
				memcpy(ans, tmp, 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:92:51: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   92 |    combine(dp[i][j], dp[i][j - 1], dp[i + (1 << j - 1)][j - 1]);
      |                                                 ~~^~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 83484 KB Output is correct
2 Correct 37 ms 83340 KB Output is correct
3 Correct 35 ms 83344 KB Output is correct
4 Correct 31 ms 83384 KB Output is correct
5 Correct 38 ms 83392 KB Output is correct
6 Correct 35 ms 83416 KB Output is correct
7 Correct 34 ms 83368 KB Output is correct
8 Correct 73 ms 83472 KB Output is correct
9 Correct 74 ms 83464 KB Output is correct
10 Correct 61 ms 83476 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 83472 KB Output is correct
2 Correct 39 ms 83436 KB Output is correct
3 Correct 32 ms 83412 KB Output is correct
4 Correct 33 ms 83440 KB Output is correct
5 Correct 32 ms 83468 KB Output is correct
6 Correct 39 ms 83448 KB Output is correct
7 Correct 40 ms 83592 KB Output is correct
8 Correct 38 ms 83548 KB Output is correct
9 Correct 78 ms 84344 KB Output is correct
10 Correct 107 ms 85792 KB Output is correct
11 Correct 91 ms 85224 KB Output is correct
12 Correct 89 ms 84764 KB Output is correct
13 Correct 91 ms 85876 KB Output is correct
14 Correct 77 ms 84992 KB Output is correct
15 Correct 97 ms 84608 KB Output is correct
16 Correct 70 ms 84608 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 83404 KB Output is correct
2 Correct 32 ms 83388 KB Output is correct
3 Correct 33 ms 83460 KB Output is correct
4 Correct 34 ms 83348 KB Output is correct
5 Correct 34 ms 83404 KB Output is correct
6 Correct 33 ms 83472 KB Output is correct
7 Correct 33 ms 83380 KB Output is correct
8 Correct 36 ms 83448 KB Output is correct
9 Correct 36 ms 83496 KB Output is correct
10 Correct 71 ms 84252 KB Output is correct
11 Correct 96 ms 84988 KB Output is correct
12 Correct 104 ms 85628 KB Output is correct
13 Correct 112 ms 85884 KB Output is correct
14 Correct 110 ms 85280 KB Output is correct
15 Correct 64 ms 84588 KB Output is correct
16 Correct 70 ms 84712 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 83404 KB Output is correct
2 Correct 32 ms 83388 KB Output is correct
3 Correct 33 ms 83460 KB Output is correct
4 Correct 34 ms 83348 KB Output is correct
5 Correct 34 ms 83404 KB Output is correct
6 Correct 33 ms 83472 KB Output is correct
7 Correct 33 ms 83380 KB Output is correct
8 Correct 36 ms 83448 KB Output is correct
9 Correct 36 ms 83496 KB Output is correct
10 Correct 71 ms 84252 KB Output is correct
11 Correct 96 ms 84988 KB Output is correct
12 Correct 104 ms 85628 KB Output is correct
13 Correct 112 ms 85884 KB Output is correct
14 Correct 110 ms 85280 KB Output is correct
15 Correct 64 ms 84588 KB Output is correct
16 Correct 70 ms 84712 KB Output is correct
17 Correct 97 ms 84964 KB Output is correct
18 Correct 33 ms 83436 KB Output is correct
19 Correct 35 ms 83352 KB Output is correct
20 Correct 33 ms 83424 KB Output is correct
21 Correct 40 ms 83432 KB Output is correct
22 Correct 40 ms 83528 KB Output is correct
23 Correct 34 ms 83520 KB Output is correct
24 Correct 34 ms 83504 KB Output is correct
25 Correct 37 ms 83536 KB Output is correct
26 Correct 35 ms 83500 KB Output is correct
27 Correct 68 ms 84228 KB Output is correct
28 Correct 102 ms 85708 KB Output is correct
29 Correct 123 ms 85972 KB Output is correct
30 Correct 105 ms 85244 KB Output is correct

Subtask #5
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 83484 KB Output is correct
2 Correct 37 ms 83340 KB Output is correct
3 Correct 35 ms 83344 KB Output is correct
4 Correct 31 ms 83384 KB Output is correct
5 Correct 38 ms 83392 KB Output is correct
6 Correct 35 ms 83416 KB Output is correct
7 Correct 34 ms 83368 KB Output is correct
8 Correct 73 ms 83472 KB Output is correct
9 Correct 74 ms 83464 KB Output is correct
10 Correct 61 ms 83476 KB Output is correct
11 Correct 86 ms 83472 KB Output is correct
12 Correct 39 ms 83436 KB Output is correct
13 Correct 32 ms 83412 KB Output is correct
14 Correct 33 ms 83440 KB Output is correct
15 Correct 32 ms 83468 KB Output is correct
16 Correct 39 ms 83448 KB Output is correct
17 Correct 40 ms 83592 KB Output is correct
18 Correct 38 ms 83548 KB Output is correct
19 Correct 78 ms 84344 KB Output is correct
20 Correct 107 ms 85792 KB Output is correct
21 Correct 91 ms 85224 KB Output is correct
22 Correct 89 ms 84764 KB Output is correct
23 Correct 91 ms 85876 KB Output is correct
24 Correct 77 ms 84992 KB Output is correct
25 Correct 97 ms 84608 KB Output is correct
26 Correct 70 ms 84608 KB Output is correct
27 Correct 39 ms 83404 KB Output is correct
28 Correct 32 ms 83388 KB Output is correct
29 Correct 33 ms 83460 KB Output is correct
30 Correct 34 ms 83348 KB Output is correct
31 Correct 34 ms 83404 KB Output is correct
32 Correct 33 ms 83472 KB Output is correct
33 Correct 33 ms 83380 KB Output is correct
34 Correct 36 ms 83448 KB Output is correct
35 Correct 36 ms 83496 KB Output is correct
36 Correct 71 ms 84252 KB Output is correct
37 Correct 96 ms 84988 KB Output is correct
38 Correct 104 ms 85628 KB Output is correct
39 Correct 112 ms 85884 KB Output is correct
40 Correct 110 ms 85280 KB Output is correct
41 Correct 64 ms 84588 KB Output is correct
42 Correct 70 ms 84712 KB Output is correct
43 Correct 97 ms 84964 KB Output is correct
44 Correct 33 ms 83436 KB Output is correct
45 Correct 35 ms 83352 KB Output is correct
46 Correct 33 ms 83424 KB Output is correct
47 Correct 40 ms 83432 KB Output is correct
48 Correct 40 ms 83528 KB Output is correct
49 Correct 34 ms 83520 KB Output is correct
50 Correct 34 ms 83504 KB Output is correct
51 Correct 37 ms 83536 KB Output is correct
52 Correct 35 ms 83500 KB Output is correct
53 Correct 68 ms 84228 KB Output is correct
54 Correct 102 ms 85708 KB Output is correct
55 Correct 123 ms 85972 KB Output is correct
56 Correct 105 ms 85244 KB Output is correct
57 Correct 136 ms 86908 KB Output is correct
58 Correct 82 ms 84416 KB Output is correct
59 Correct 95 ms 85188 KB Output is correct