oj.uz

Submission #304642

# Submission time Handle Problem Language Result Execution time Memory
304642 2020-09-21T16:19:22 Z Falcon Toll (BOI17_toll) C++17
100 / 100
 457 ms 60408 KB 
#pragma GCC optimize("O2")

#include <bits/stdc++.h>
#ifdef DEBUG
	#include "debug.hpp"
#endif

using namespace std;

#define all(c) (c).begin(), (c).end()
#define traverse(c, it) for(auto it = (c).begin(); it != (c).end(); it++)
#define rep(i, N) for(int i = 0; i < (N); i++)
#define rep1(i, N) for(int i = 1; i <= (N); i++)
#define rep2(i, s, e) for(int i = (s); i <= (e); i++)
#define rep3(i, s, e, d) for(int i = (s); (d) >= 0 ? i <= (e) : i >= (e); i += (d))
#define pb push_back


#ifdef DEBUG
	#define debug(x...) { dbg::depth++; string dbg_vals = dbg::to_string(x); dbg::depth--; dbg::fprint(__func__, __LINE__, #x, dbg_vals); }
	#define light_debug(x) { dbg::light = 1; dbg::dout << __func__ << ":" << __LINE__ << "  " << #x << " = " << x << endl; dbg::light = 0; }
#else
	#define debug(x...)
	#define light_debug(x) 
#endif

template<typename T>
inline T& ckmin(T& a, T b) { return a = a > b ? b : a; }

template<typename T>
inline T& ckmax(T& a, T b) { return a = a < b ? b : a; }

using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;

constexpr int MAXN{50'000};
constexpr ll INF{1LL << 40};

int K, N, M, O;
vector<vector<pii>> adj;
ll dist[MAXN][20][5]{}; //dist[a][b][c] = distance between [a] and [K * (a/K + 2^b) + c]

void precalc() {
	int max_k = __lg((N + K - 1) / K);
	rep(i, N) 
		rep(j, 1 + max_k)
			rep(k, K)
				dist[i][j][k] = INF;
	rep(v, N)
		for(auto u : adj[v])
			dist[v][0][u.first % K] = u.second;

	rep1(k, max_k)
		rep(v, N)
			rep(x, K) 
				rep(y, K) {
					int u = K * (v / K + (1 << (k - 1))) + y;
					if(u >= N) continue;
					ckmin(dist[v][k][x], dist[v][k - 1][y] + dist[u][k - 1][x]);
				}
}


map<pii, ll> memo;
ll query(int a, int b) { 
	if(memo.find({a, b}) != memo.end()) return memo[{a, b}];
	if(a == b)
		return 0;
	else if(a / K >= b / K)
		return INF;
	int d = __lg(b / K - a / K);
	ll ans = INF;
	rep(i, K) {
		int u = K * (a / K + (1 << d)) + i;
		if(u >= N) continue;
		ckmin(ans, dist[a][d][i] + query(u, b));
	}
	return memo[{a, b}] = ans;
}


int main() {

	ios_base::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);

	#ifdef DEBUG
		freopen("debug", "w", stderr);
	#endif
	
	cin >> K >> N >> M >> O;
	adj.resize(N);

	rep(_, M) {
		int a, b, t; cin >> a >> b >> t;
		adj[a].pb({b, t});
	}

	precalc();

	rep(_, O) {
		int a, b; cin >> a >> b;
		ll d = query(a, b);
		if(d < INF)
			cout << d << '\n';
		else
			cout << -1 << '\n';
	}


	#ifdef DEBUG
		dbg::dout << "\nExecution time: " << clock() << "ms\n";
	#endif

	return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 46840 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 404 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 3 ms 1408 KB Output is correct
6 Correct 3 ms 1408 KB Output is correct
7 Correct 3 ms 1408 KB Output is correct
8 Correct 115 ms 46712 KB Output is correct
9 Correct 108 ms 46712 KB Output is correct
10 Correct 85 ms 45180 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 200 ms 49912 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 7 ms 1536 KB Output is correct
8 Correct 10 ms 1792 KB Output is correct
9 Correct 104 ms 46588 KB Output is correct
10 Correct 304 ms 54012 KB Output is correct
11 Correct 198 ms 51576 KB Output is correct
12 Correct 290 ms 54220 KB Output is correct
13 Correct 219 ms 34340 KB Output is correct
14 Correct 123 ms 30712 KB Output is correct
15 Correct 166 ms 31736 KB Output is correct
16 Correct 178 ms 31864 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 1152 KB Output is correct
7 Correct 2 ms 1184 KB Output is correct
8 Correct 4 ms 1280 KB Output is correct
9 Correct 3 ms 1280 KB Output is correct
10 Correct 63 ms 42232 KB Output is correct
11 Correct 103 ms 42232 KB Output is correct
12 Correct 142 ms 43128 KB Output is correct
13 Correct 154 ms 43384 KB Output is correct
14 Correct 128 ms 42784 KB Output is correct
15 Correct 92 ms 25976 KB Output is correct
16 Correct 90 ms 26016 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 1152 KB Output is correct
7 Correct 2 ms 1184 KB Output is correct
8 Correct 4 ms 1280 KB Output is correct
9 Correct 3 ms 1280 KB Output is correct
10 Correct 63 ms 42232 KB Output is correct
11 Correct 103 ms 42232 KB Output is correct
12 Correct 142 ms 43128 KB Output is correct
13 Correct 154 ms 43384 KB Output is correct
14 Correct 128 ms 42784 KB Output is correct
15 Correct 92 ms 25976 KB Output is correct
16 Correct 90 ms 26016 KB Output is correct
17 Correct 137 ms 44576 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 0 ms 384 KB Output is correct
23 Correct 8 ms 1920 KB Output is correct
24 Correct 15 ms 2308 KB Output is correct
25 Correct 32 ms 3064 KB Output is correct
26 Correct 26 ms 2816 KB Output is correct
27 Correct 68 ms 43640 KB Output is correct
28 Correct 186 ms 46404 KB Output is correct
29 Correct 215 ms 46608 KB Output is correct
30 Correct 188 ms 45992 KB Output is correct

Subtask #5
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 46840 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 404 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 3 ms 1408 KB Output is correct
6 Correct 3 ms 1408 KB Output is correct
7 Correct 3 ms 1408 KB Output is correct
8 Correct 115 ms 46712 KB Output is correct
9 Correct 108 ms 46712 KB Output is correct
10 Correct 85 ms 45180 KB Output is correct
11 Correct 200 ms 49912 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 7 ms 1536 KB Output is correct
18 Correct 10 ms 1792 KB Output is correct
19 Correct 104 ms 46588 KB Output is correct
20 Correct 304 ms 54012 KB Output is correct
21 Correct 198 ms 51576 KB Output is correct
22 Correct 290 ms 54220 KB Output is correct
23 Correct 219 ms 34340 KB Output is correct
24 Correct 123 ms 30712 KB Output is correct
25 Correct 166 ms 31736 KB Output is correct
26 Correct 178 ms 31864 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 0 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 1152 KB Output is correct
33 Correct 2 ms 1184 KB Output is correct
34 Correct 4 ms 1280 KB Output is correct
35 Correct 3 ms 1280 KB Output is correct
36 Correct 63 ms 42232 KB Output is correct
37 Correct 103 ms 42232 KB Output is correct
38 Correct 142 ms 43128 KB Output is correct
39 Correct 154 ms 43384 KB Output is correct
40 Correct 128 ms 42784 KB Output is correct
41 Correct 92 ms 25976 KB Output is correct
42 Correct 90 ms 26016 KB Output is correct
43 Correct 137 ms 44576 KB Output is correct
44 Correct 0 ms 384 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 8 ms 1920 KB Output is correct
50 Correct 15 ms 2308 KB Output is correct
51 Correct 32 ms 3064 KB Output is correct
52 Correct 26 ms 2816 KB Output is correct
53 Correct 68 ms 43640 KB Output is correct
54 Correct 186 ms 46404 KB Output is correct
55 Correct 215 ms 46608 KB Output is correct
56 Correct 188 ms 45992 KB Output is correct
57 Correct 457 ms 60408 KB Output is correct
58 Correct 111 ms 47740 KB Output is correct
59 Correct 244 ms 52044 KB Output is correct