oj.uz

Submission #365592

# Submission time Handle Problem Language Result Execution time Memory
365592 2021-02-11T22:26:33 Z LucaDantas Toll (BOI17_toll) C++17
100 / 100
 304 ms 17256 KB 
#include<cstdio>
#include<vector>
#include<utility>
#include<queue>
#include<algorithm>
using namespace std;

constexpr int maxn = 1e5+10, inf = 0x3f3f3f3f;

vector<pair<int,int>> g[maxn], rev_g[maxn], query[maxn];

int K, dist[maxn][5], ans[maxn];

void min_self(int& a, int b) {a = min(a,b);}

void solve(int l, int r) {
	if(l == r) return;
	int m = (l+r) >> 1;
	solve(l, m); solve(m+1, r);

	for(int i = K*l; i < K*(r+1); i++)
		for(int j = 0; j < K; j++)
			dist[i][j] = inf;

	for(int x = K*m; x < K*(m+1); x++) {
		dist[x][x%K] = 0;
		queue<int> q;

		// andando pra esquerda
		q.push(x);
		while(q.size()) {
			int u = q.front(); q.pop();
			for(auto pp : rev_g[u]) {
				auto [v, w] = pp;
				if(dist[v][x%K] == inf) q.push(v);
				min_self(dist[v][x%K], dist[u][x%K] + w);
			}
		}

		// andando pra direita
		q.push(x);
		while(q.size()) {
			int u = q.front(); q.pop();
			for(auto pp : g[u]) {
				auto [v, w] = pp;
				if(dist[v][x%K] == inf) q.push(v);
				min_self(dist[v][x%K], dist[u][x%K] + w);
			}
		}
	}

	for(int i = K*l; i < K*(m+1); i++) {
		while(query[i].size() && query[i].back().first/K <= r) {
			auto [b, id] = query[i].back();
			query[i].pop_back();
			for(int x = 0; x < K; x++)
				min_self(ans[id], dist[i][x]+dist[b][x]);
		}
	}
}

int main() {
	int n, m, q; scanf("%d %d %d %d", &K, &n, &m, &q);
	for(int i = 0, a, b, c; i < m; i++) {
		scanf("%d %d %d", &a, &b, &c);
		g[a].push_back({b, c});
		rev_g[b].push_back({a, c});
	}
	for(int i = 0; i < q; i++) {
		int a, b; scanf("%d %d", &a, &b);
		query[a].push_back({b, i});
		ans[i] = inf;
	}
	for(int i = 0; i < n; i++)
		sort(query[i].begin(), query[i].end()), reverse(query[i].begin(), query[i].end());
	solve(0, (n-1)/K);
	for(int i = 0; i < q; i++)
		printf("%d\n", ans[i]<inf?ans[i]:-1);
}

Compilation message

toll.cpp: In function 'int main()':
toll.cpp:63:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   63 |  int n, m, q; scanf("%d %d %d %d", &K, &n, &m, &q);
      |               ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
toll.cpp:65:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   65 |   scanf("%d %d %d", &a, &b, &c);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
toll.cpp:70:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   70 |   int a, b; scanf("%d %d", &a, &b);
      |             ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 12524 KB Output is correct
2 Correct 5 ms 7404 KB Output is correct
3 Correct 6 ms 7404 KB Output is correct
4 Correct 6 ms 7404 KB Output is correct
5 Correct 6 ms 7532 KB Output is correct
6 Correct 7 ms 7532 KB Output is correct
7 Correct 8 ms 7532 KB Output is correct
8 Correct 66 ms 12780 KB Output is correct
9 Correct 57 ms 12500 KB Output is correct
10 Correct 20 ms 8700 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 12480 KB Output is correct
2 Correct 6 ms 7404 KB Output is correct
3 Correct 5 ms 7404 KB Output is correct
4 Correct 5 ms 7404 KB Output is correct
5 Correct 5 ms 7404 KB Output is correct
6 Correct 6 ms 7404 KB Output is correct
7 Correct 10 ms 7916 KB Output is correct
8 Correct 11 ms 7788 KB Output is correct
9 Correct 67 ms 12652 KB Output is correct
10 Correct 208 ms 15916 KB Output is correct
11 Correct 141 ms 13564 KB Output is correct
12 Correct 88 ms 12908 KB Output is correct
13 Correct 222 ms 15924 KB Output is correct
14 Correct 151 ms 12780 KB Output is correct
15 Correct 127 ms 11884 KB Output is correct
16 Correct 138 ms 11976 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 5 ms 7404 KB Output is correct
3 Correct 7 ms 7404 KB Output is correct
4 Correct 6 ms 7552 KB Output is correct
5 Correct 5 ms 7404 KB Output is correct
6 Correct 6 ms 7552 KB Output is correct
7 Correct 8 ms 7532 KB Output is correct
8 Correct 12 ms 7808 KB Output is correct
9 Correct 8 ms 7532 KB Output is correct
10 Correct 58 ms 12268 KB Output is correct
11 Correct 128 ms 13036 KB Output is correct
12 Correct 223 ms 15596 KB Output is correct
13 Correct 238 ms 16288 KB Output is correct
14 Correct 177 ms 14444 KB Output is correct
15 Correct 127 ms 11756 KB Output is correct
16 Correct 121 ms 11756 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 5 ms 7404 KB Output is correct
3 Correct 7 ms 7404 KB Output is correct
4 Correct 6 ms 7552 KB Output is correct
5 Correct 5 ms 7404 KB Output is correct
6 Correct 6 ms 7552 KB Output is correct
7 Correct 8 ms 7532 KB Output is correct
8 Correct 12 ms 7808 KB Output is correct
9 Correct 8 ms 7532 KB Output is correct
10 Correct 58 ms 12268 KB Output is correct
11 Correct 128 ms 13036 KB Output is correct
12 Correct 223 ms 15596 KB Output is correct
13 Correct 238 ms 16288 KB Output is correct
14 Correct 177 ms 14444 KB Output is correct
15 Correct 127 ms 11756 KB Output is correct
16 Correct 121 ms 11756 KB Output is correct
17 Correct 122 ms 13292 KB Output is correct
18 Correct 6 ms 7404 KB Output is correct
19 Correct 7 ms 7532 KB Output is correct
20 Correct 5 ms 7532 KB Output is correct
21 Correct 5 ms 7404 KB Output is correct
22 Correct 5 ms 7404 KB Output is correct
23 Correct 7 ms 7532 KB Output is correct
24 Correct 8 ms 7532 KB Output is correct
25 Correct 10 ms 7660 KB Output is correct
26 Correct 9 ms 7660 KB Output is correct
27 Correct 60 ms 12524 KB Output is correct
28 Correct 207 ms 15608 KB Output is correct
29 Correct 268 ms 16364 KB Output is correct
30 Correct 158 ms 14444 KB Output is correct

Subtask #5
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 12524 KB Output is correct
2 Correct 5 ms 7404 KB Output is correct
3 Correct 6 ms 7404 KB Output is correct
4 Correct 6 ms 7404 KB Output is correct
5 Correct 6 ms 7532 KB Output is correct
6 Correct 7 ms 7532 KB Output is correct
7 Correct 8 ms 7532 KB Output is correct
8 Correct 66 ms 12780 KB Output is correct
9 Correct 57 ms 12500 KB Output is correct
10 Correct 20 ms 8700 KB Output is correct
11 Correct 126 ms 12480 KB Output is correct
12 Correct 6 ms 7404 KB Output is correct
13 Correct 5 ms 7404 KB Output is correct
14 Correct 5 ms 7404 KB Output is correct
15 Correct 5 ms 7404 KB Output is correct
16 Correct 6 ms 7404 KB Output is correct
17 Correct 10 ms 7916 KB Output is correct
18 Correct 11 ms 7788 KB Output is correct
19 Correct 67 ms 12652 KB Output is correct
20 Correct 208 ms 15916 KB Output is correct
21 Correct 141 ms 13564 KB Output is correct
22 Correct 88 ms 12908 KB Output is correct
23 Correct 222 ms 15924 KB Output is correct
24 Correct 151 ms 12780 KB Output is correct
25 Correct 127 ms 11884 KB Output is correct
26 Correct 138 ms 11976 KB Output is correct
27 Correct 5 ms 7404 KB Output is correct
28 Correct 5 ms 7404 KB Output is correct
29 Correct 7 ms 7404 KB Output is correct
30 Correct 6 ms 7552 KB Output is correct
31 Correct 5 ms 7404 KB Output is correct
32 Correct 6 ms 7552 KB Output is correct
33 Correct 8 ms 7532 KB Output is correct
34 Correct 12 ms 7808 KB Output is correct
35 Correct 8 ms 7532 KB Output is correct
36 Correct 58 ms 12268 KB Output is correct
37 Correct 128 ms 13036 KB Output is correct
38 Correct 223 ms 15596 KB Output is correct
39 Correct 238 ms 16288 KB Output is correct
40 Correct 177 ms 14444 KB Output is correct
41 Correct 127 ms 11756 KB Output is correct
42 Correct 121 ms 11756 KB Output is correct
43 Correct 122 ms 13292 KB Output is correct
44 Correct 6 ms 7404 KB Output is correct
45 Correct 7 ms 7532 KB Output is correct
46 Correct 5 ms 7532 KB Output is correct
47 Correct 5 ms 7404 KB Output is correct
48 Correct 5 ms 7404 KB Output is correct
49 Correct 7 ms 7532 KB Output is correct
50 Correct 8 ms 7532 KB Output is correct
51 Correct 10 ms 7660 KB Output is correct
52 Correct 9 ms 7660 KB Output is correct
53 Correct 60 ms 12524 KB Output is correct
54 Correct 207 ms 15608 KB Output is correct
55 Correct 268 ms 16364 KB Output is correct
56 Correct 158 ms 14444 KB Output is correct
57 Correct 304 ms 17256 KB Output is correct
58 Correct 70 ms 12780 KB Output is correct
59 Correct 123 ms 13548 KB Output is correct