oj.uz

Submission #567698

# Submission time Handle Problem Language Result Execution time Memory
567698 2022-05-24T05:00:38 Z _karan_gandhi Toll (BOI17_toll) C++17
100 / 100
 165 ms 198820 KB 
#include <bits/stdc++.h>
using namespace std;

#define all(v) v.begin(), v.end()
#define endl '\n'
#define pl(var) " [" << #var << ": " << (var) << "] "
#define ll long long

void solve() {
	ll int k, n, m, o; cin >> k >> n >> m >> o;

	const ll int LOG = 20;
	// dp[i][i + 2 ^ k][x][y];
	ll int dp[n / k][LOG][5][5];
	memset(dp, 1, sizeof dp);

	vector<vector<pair<ll int, ll int>>> adj(n);

	for (ll int i = 0; i < m; i++) {
		ll int a, b; cin >> a >> b;
		ll int c; cin >> c;

		adj[a].emplace_back(b, c);
	}

	for (ll int i = 0; i < n; i++) {
		for (auto [v, wt] : adj[i]) {
			dp[i / k][0][i % k][v % k] = wt;
		}
	}

	auto combine = [&](ll int target[5][5], ll int a[5][5], ll int b[5][5]) {
		for (ll int i = 0; i < k; i++) {
			for (ll int j = 0; j < k; j++) {
				for (ll int l = 0; l < k; l++) {
					target[i][j] = min(target[i][j], a[i][l] + b[l][j]);
				}
			}
		}
	};

	for (ll int i = 1; i < LOG; i++) {
		for (ll int j = 0; j < n / k; j++) {
			if (j + (1 << (i - 1)) >= n / k) continue;
			combine(dp[j][i], dp[j][i - 1], dp[j + (1 << (i - 1))][i - 1]);
		}
	}

	// TODO: write query again

	auto query = [&](ll int start, ll int end) {
		ll int res[5][5];
		memset(res, 1, sizeof res);
		for (int i = 0; i < 5; i++) res[i][i] = 0;
		ll int level = start / k;
		ll int target = end / k;
		int pow = LOG;

		while (level != target) {
			while (level + (1 << pow) > target) pow--;
	
			ll int new_res[5][5];
			memset(new_res, 1, sizeof new_res);

			combine(new_res, res, dp[level][pow]);
			memcpy(res, new_res, sizeof res);

			level += (1 << pow);
		}

		return res[start % k][end % k];
	};

	while (o--) {
		int a, b; cin >> a >> b;

		ll int res = query(a, b);

		if (res > 1e16) cout << -1 << endl;
		else cout << res << endl;
	}
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	ll int T = 1;
	// cin >> T;
	while (T--)
		solve();
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 198820 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 3 ms 4220 KB Output is correct
6 Correct 2 ms 4180 KB Output is correct
7 Correct 3 ms 4180 KB Output is correct
8 Correct 140 ms 198676 KB Output is correct
9 Correct 160 ms 198664 KB Output is correct
10 Correct 118 ms 197128 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 131 ms 101840 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 7 ms 4308 KB Output is correct
8 Correct 6 ms 2388 KB Output is correct
9 Correct 140 ms 198764 KB Output is correct
10 Correct 117 ms 70660 KB Output is correct
11 Correct 125 ms 101992 KB Output is correct
12 Correct 110 ms 68668 KB Output is correct
13 Correct 87 ms 29184 KB Output is correct
14 Correct 64 ms 42732 KB Output is correct
15 Correct 58 ms 26516 KB Output is correct
16 Correct 55 ms 26504 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 3 ms 4180 KB Output is correct
7 Correct 2 ms 2260 KB Output is correct
8 Correct 3 ms 1192 KB Output is correct
9 Correct 2 ms 1364 KB Output is correct
10 Correct 128 ms 198684 KB Output is correct
11 Correct 112 ms 101732 KB Output is correct
12 Correct 122 ms 70580 KB Output is correct
13 Correct 123 ms 70996 KB Output is correct
14 Correct 98 ms 69836 KB Output is correct
15 Correct 68 ms 26516 KB Output is correct
16 Correct 57 ms 26396 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 3 ms 4180 KB Output is correct
7 Correct 2 ms 2260 KB Output is correct
8 Correct 3 ms 1192 KB Output is correct
9 Correct 2 ms 1364 KB Output is correct
10 Correct 128 ms 198684 KB Output is correct
11 Correct 112 ms 101732 KB Output is correct
12 Correct 122 ms 70580 KB Output is correct
13 Correct 123 ms 70996 KB Output is correct
14 Correct 98 ms 69836 KB Output is correct
15 Correct 68 ms 26516 KB Output is correct
16 Correct 57 ms 26396 KB Output is correct
17 Correct 106 ms 101884 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 4 ms 4180 KB Output is correct
24 Correct 12 ms 2356 KB Output is correct
25 Correct 5 ms 1236 KB Output is correct
26 Correct 4 ms 1364 KB Output is correct
27 Correct 133 ms 198648 KB Output is correct
28 Correct 111 ms 70636 KB Output is correct
29 Correct 119 ms 71080 KB Output is correct
30 Correct 131 ms 69792 KB Output is correct

Subtask #5
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 198820 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 3 ms 4220 KB Output is correct
6 Correct 2 ms 4180 KB Output is correct
7 Correct 3 ms 4180 KB Output is correct
8 Correct 140 ms 198676 KB Output is correct
9 Correct 160 ms 198664 KB Output is correct
10 Correct 118 ms 197128 KB Output is correct
11 Correct 131 ms 101840 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 7 ms 4308 KB Output is correct
18 Correct 6 ms 2388 KB Output is correct
19 Correct 140 ms 198764 KB Output is correct
20 Correct 117 ms 70660 KB Output is correct
21 Correct 125 ms 101992 KB Output is correct
22 Correct 110 ms 68668 KB Output is correct
23 Correct 87 ms 29184 KB Output is correct
24 Correct 64 ms 42732 KB Output is correct
25 Correct 58 ms 26516 KB Output is correct
26 Correct 55 ms 26504 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 3 ms 4180 KB Output is correct
33 Correct 2 ms 2260 KB Output is correct
34 Correct 3 ms 1192 KB Output is correct
35 Correct 2 ms 1364 KB Output is correct
36 Correct 128 ms 198684 KB Output is correct
37 Correct 112 ms 101732 KB Output is correct
38 Correct 122 ms 70580 KB Output is correct
39 Correct 123 ms 70996 KB Output is correct
40 Correct 98 ms 69836 KB Output is correct
41 Correct 68 ms 26516 KB Output is correct
42 Correct 57 ms 26396 KB Output is correct
43 Correct 106 ms 101884 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 0 ms 212 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 4 ms 4180 KB Output is correct
50 Correct 12 ms 2356 KB Output is correct
51 Correct 5 ms 1236 KB Output is correct
52 Correct 4 ms 1364 KB Output is correct
53 Correct 133 ms 198648 KB Output is correct
54 Correct 111 ms 70636 KB Output is correct
55 Correct 119 ms 71080 KB Output is correct
56 Correct 131 ms 69792 KB Output is correct
57 Correct 165 ms 54728 KB Output is correct
58 Correct 138 ms 198732 KB Output is correct
59 Correct 123 ms 101944 KB Output is correct