oj.uz

Submission #972558

# Submission time Handle Problem Language Result Execution time Memory
972558 2024-04-30T14:55:52 Z c2zi6 Toll (BOI17_toll) C++14
100 / 100
 306 ms 76188 KB 
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

void solve() {
	int K, n, m, q;
	cin >> K >> n >> m >> q;
	VVVL dist(n, VVL(20, VL(K, 1e18)));
	rep(i, m) {
		ll u, v, w;
		cin >> u >> v >> w;
		setmin(dist[u][0][v%K], w);
	}
	for (int i = 1; i < 20; i++) rep(u, n) {
		int tmp1 = (u/K + (1<<(i-1)))*K;
		int tmp2 = (u/K + (1<<i))*K;
		replr(m, tmp1, min(n-1, tmp1+K-1)) replr(f, tmp2, min(n-1, tmp2+K-1)) setmin(dist[u][i][f%K], dist[u][i-1][m%K] + dist[m][i-1][f%K]);
	}
	while (q--) {
		int u, v;
		cin >> u >> v;
		int d = v/K - u/K;
		VL a(K, 1e18);
		a[u%K] = 0;
		u = u/K*K;
		for (int i = 0; i < 20; i++) if (d & (1<<i)) {
			VL b(K, 1e18);
			replr(s, u, min(n-1, u+K-1)) rep(f, K) {
				setmin(b[f], a[s%K] + dist[s][i][f]);
			}
			a = b;
			u += (1<<i)*K;
		}
		ll ans = a[v%K];
		if (ans == 1e18) cout << -1 << endl;
		else cout << ans << endl;
	}
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    int t = 1;
    /* cin >> t; */
    while (t--) solve();
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 58196 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 3 ms 1600 KB Output is correct
6 Correct 3 ms 1372 KB Output is correct
7 Correct 3 ms 1372 KB Output is correct
8 Correct 127 ms 57948 KB Output is correct
9 Correct 125 ms 57936 KB Output is correct
10 Correct 109 ms 57116 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 170 ms 58804 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 456 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 16 ms 1628 KB Output is correct
8 Correct 17 ms 1628 KB Output is correct
9 Correct 116 ms 57960 KB Output is correct
10 Correct 217 ms 59448 KB Output is correct
11 Correct 164 ms 58840 KB Output is correct
12 Correct 192 ms 58508 KB Output is correct
13 Correct 196 ms 46416 KB Output is correct
14 Correct 110 ms 35924 KB Output is correct
15 Correct 178 ms 44888 KB Output is correct
16 Correct 169 ms 45096 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 456 KB Output is correct
6 Correct 2 ms 1372 KB Output is correct
7 Correct 2 ms 1600 KB Output is correct
8 Correct 4 ms 1884 KB Output is correct
9 Correct 3 ms 1884 KB Output is correct
10 Correct 106 ms 58004 KB Output is correct
11 Correct 149 ms 58996 KB Output is correct
12 Correct 194 ms 59468 KB Output is correct
13 Correct 201 ms 59392 KB Output is correct
14 Correct 203 ms 58880 KB Output is correct
15 Correct 165 ms 44884 KB Output is correct
16 Correct 167 ms 44884 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 456 KB Output is correct
6 Correct 2 ms 1372 KB Output is correct
7 Correct 2 ms 1600 KB Output is correct
8 Correct 4 ms 1884 KB Output is correct
9 Correct 3 ms 1884 KB Output is correct
10 Correct 106 ms 58004 KB Output is correct
11 Correct 149 ms 58996 KB Output is correct
12 Correct 194 ms 59468 KB Output is correct
13 Correct 201 ms 59392 KB Output is correct
14 Correct 203 ms 58880 KB Output is correct
15 Correct 165 ms 44884 KB Output is correct
16 Correct 167 ms 44884 KB Output is correct
17 Correct 192 ms 58988 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 460 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 6 ms 1624 KB Output is correct
24 Correct 7 ms 1628 KB Output is correct
25 Correct 8 ms 1884 KB Output is correct
26 Correct 8 ms 1884 KB Output is correct
27 Correct 108 ms 58044 KB Output is correct
28 Correct 200 ms 59420 KB Output is correct
29 Correct 207 ms 59476 KB Output is correct
30 Correct 197 ms 58948 KB Output is correct

Subtask #5
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 58196 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 3 ms 1600 KB Output is correct
6 Correct 3 ms 1372 KB Output is correct
7 Correct 3 ms 1372 KB Output is correct
8 Correct 127 ms 57948 KB Output is correct
9 Correct 125 ms 57936 KB Output is correct
10 Correct 109 ms 57116 KB Output is correct
11 Correct 170 ms 58804 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 456 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 16 ms 1628 KB Output is correct
18 Correct 17 ms 1628 KB Output is correct
19 Correct 116 ms 57960 KB Output is correct
20 Correct 217 ms 59448 KB Output is correct
21 Correct 164 ms 58840 KB Output is correct
22 Correct 192 ms 58508 KB Output is correct
23 Correct 196 ms 46416 KB Output is correct
24 Correct 110 ms 35924 KB Output is correct
25 Correct 178 ms 44888 KB Output is correct
26 Correct 169 ms 45096 KB Output is correct
27 Correct 1 ms 600 KB Output is correct
28 Correct 0 ms 600 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 456 KB Output is correct
32 Correct 2 ms 1372 KB Output is correct
33 Correct 2 ms 1600 KB Output is correct
34 Correct 4 ms 1884 KB Output is correct
35 Correct 3 ms 1884 KB Output is correct
36 Correct 106 ms 58004 KB Output is correct
37 Correct 149 ms 58996 KB Output is correct
38 Correct 194 ms 59468 KB Output is correct
39 Correct 201 ms 59392 KB Output is correct
40 Correct 203 ms 58880 KB Output is correct
41 Correct 165 ms 44884 KB Output is correct
42 Correct 167 ms 44884 KB Output is correct
43 Correct 192 ms 58988 KB Output is correct
44 Correct 0 ms 344 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 460 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 6 ms 1624 KB Output is correct
50 Correct 7 ms 1628 KB Output is correct
51 Correct 8 ms 1884 KB Output is correct
52 Correct 8 ms 1884 KB Output is correct
53 Correct 108 ms 58044 KB Output is correct
54 Correct 200 ms 59420 KB Output is correct
55 Correct 207 ms 59476 KB Output is correct
56 Correct 197 ms 58948 KB Output is correct
57 Correct 306 ms 76188 KB Output is correct
58 Correct 128 ms 58112 KB Output is correct
59 Correct 173 ms 58964 KB Output is correct