oj.uz

답안 #526705

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
526705 2022-02-16T02:23:40 Z siewjh Autobus (COCI22_autobus) C++17
70 / 70
 349 ms 2312 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
const int inf = 1'000'000'007;
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	int nodes, edges; cin >> nodes >> edges;
	vector<vector<int>> adjmat(nodes + 1, vector<int>(nodes + 1, inf));
	vector<vector<pair<int, int>>> adjlist(nodes + 1);
	for (int i = 0; i < edges; i++) {
		int a, b, t; cin >> a >> b >> t;
		adjmat[a][b] = min(adjmat[a][b], t);
	}
	for (int i = 1; i <= nodes; i++)
		for (int j = 1; j <= nodes; j++)
			if (adjmat[i][j] != inf)
				adjlist[i].push_back({ j,adjmat[i][j] });
	int maxbus, queries; cin >> maxbus >> queries;
	maxbus = min(maxbus, nodes - 1);
	int dist[71][71][71];
	for (int i = 0; i < 71; i++)
		for (int j = 0; j < 71; j++)
			for (int k = 0; k < 71; k++)
				dist[i][j][k] = inf;
	for (int i = 1; i <= nodes; i++) {
		dist[i][i][0] = 0;
		priority_queue<pair<pair<int, int>, int>, vector<pair<pair<int, int>, int>>, greater<pair<pair<int, int>, int>>> pq;
		pq.push({ {0,i}, 0 });
		while (!pq.empty()) {
			int d = pq.top().first.first, x = pq.top().first.second, bus = pq.top().second;
			pq.pop();
			if (d != dist[i][x][bus] || bus == maxbus) continue;
			for (auto nxt : adjlist[x]) {
				int nn = nxt.first, nd = nxt.second;
				if (d + nd < dist[i][nn][bus + 1]) {
					dist[i][nn][bus + 1] = d + nd;
					pq.push({ {dist[i][nn][bus + 1], nn}, bus + 1 });
				}
			}
		}
	}
	for (int i = 0; i < queries; i++) {
		int a, b; cin >> a >> b;
		int ans = inf;
		for (int j = 0; j <= maxbus; j++) ans = min(ans, dist[a][b][j]);
		cout << ((ans == inf) ? -1 : ans) << '\n';
	}
	return 0;
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1612 KB Output is correct
2 Correct 1 ms 1612 KB Output is correct
3 Correct 1 ms 1612 KB Output is correct
4 Correct 1 ms 1612 KB Output is correct
5 Correct 1 ms 1612 KB Output is correct
6 Correct 1 ms 1708 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1760 KB Output is correct
2 Correct 3 ms 1740 KB Output is correct
3 Correct 4 ms 1740 KB Output is correct
4 Correct 4 ms 1740 KB Output is correct
5 Correct 5 ms 1740 KB Output is correct
6 Correct 7 ms 1772 KB Output is correct
7 Correct 7 ms 1740 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1612 KB Output is correct
2 Correct 1 ms 1612 KB Output is correct
3 Correct 1 ms 1612 KB Output is correct
4 Correct 1 ms 1612 KB Output is correct
5 Correct 1 ms 1612 KB Output is correct
6 Correct 1 ms 1708 KB Output is correct
7 Correct 26 ms 1784 KB Output is correct
8 Correct 98 ms 1828 KB Output is correct
9 Correct 6 ms 1740 KB Output is correct
10 Correct 67 ms 1772 KB Output is correct
11 Correct 27 ms 1824 KB Output is correct
12 Correct 140 ms 1944 KB Output is correct
13 Correct 95 ms 1740 KB Output is correct
14 Correct 102 ms 1848 KB Output is correct
15 Correct 284 ms 1976 KB Output is correct
16 Correct 162 ms 1876 KB Output is correct
17 Correct 95 ms 1812 KB Output is correct
18 Correct 87 ms 1724 KB Output is correct
19 Correct 255 ms 1872 KB Output is correct
20 Correct 185 ms 1720 KB Output is correct
21 Correct 88 ms 1736 KB Output is correct
22 Correct 139 ms 1728 KB Output is correct
23 Correct 121 ms 1840 KB Output is correct
24 Correct 185 ms 1732 KB Output is correct
25 Correct 98 ms 1724 KB Output is correct
26 Correct 132 ms 1848 KB Output is correct
27 Correct 165 ms 1740 KB Output is correct
28 Correct 143 ms 1840 KB Output is correct
29 Correct 99 ms 1740 KB Output is correct
30 Correct 131 ms 1852 KB Output is correct
31 Correct 219 ms 2060 KB Output is correct
32 Correct 345 ms 2312 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1612 KB Output is correct
2 Correct 1 ms 1612 KB Output is correct
3 Correct 1 ms 1612 KB Output is correct
4 Correct 1 ms 1612 KB Output is correct
5 Correct 1 ms 1612 KB Output is correct
6 Correct 1 ms 1708 KB Output is correct
7 Correct 3 ms 1760 KB Output is correct
8 Correct 3 ms 1740 KB Output is correct
9 Correct 4 ms 1740 KB Output is correct
10 Correct 4 ms 1740 KB Output is correct
11 Correct 5 ms 1740 KB Output is correct
12 Correct 7 ms 1772 KB Output is correct
13 Correct 7 ms 1740 KB Output is correct
14 Correct 26 ms 1784 KB Output is correct
15 Correct 98 ms 1828 KB Output is correct
16 Correct 6 ms 1740 KB Output is correct
17 Correct 67 ms 1772 KB Output is correct
18 Correct 27 ms 1824 KB Output is correct
19 Correct 140 ms 1944 KB Output is correct
20 Correct 95 ms 1740 KB Output is correct
21 Correct 102 ms 1848 KB Output is correct
22 Correct 284 ms 1976 KB Output is correct
23 Correct 162 ms 1876 KB Output is correct
24 Correct 95 ms 1812 KB Output is correct
25 Correct 87 ms 1724 KB Output is correct
26 Correct 255 ms 1872 KB Output is correct
27 Correct 185 ms 1720 KB Output is correct
28 Correct 88 ms 1736 KB Output is correct
29 Correct 139 ms 1728 KB Output is correct
30 Correct 121 ms 1840 KB Output is correct
31 Correct 185 ms 1732 KB Output is correct
32 Correct 98 ms 1724 KB Output is correct
33 Correct 132 ms 1848 KB Output is correct
34 Correct 165 ms 1740 KB Output is correct
35 Correct 143 ms 1840 KB Output is correct
36 Correct 99 ms 1740 KB Output is correct
37 Correct 131 ms 1852 KB Output is correct
38 Correct 219 ms 2060 KB Output is correct
39 Correct 345 ms 2312 KB Output is correct
40 Correct 23 ms 1768 KB Output is correct
41 Correct 78 ms 1748 KB Output is correct
42 Correct 14 ms 1720 KB Output is correct
43 Correct 147 ms 1788 KB Output is correct
44 Correct 28 ms 1824 KB Output is correct
45 Correct 265 ms 2224 KB Output is correct
46 Correct 93 ms 1728 KB Output is correct
47 Correct 199 ms 1944 KB Output is correct
48 Correct 131 ms 1852 KB Output is correct
49 Correct 349 ms 2108 KB Output is correct
50 Correct 92 ms 1716 KB Output is correct
51 Correct 133 ms 1732 KB Output is correct
52 Correct 88 ms 1712 KB Output is correct
53 Correct 274 ms 1880 KB Output is correct
54 Correct 100 ms 1732 KB Output is correct
55 Correct 101 ms 1844 KB Output is correct
56 Correct 269 ms 1812 KB Output is correct
57 Correct 281 ms 1732 KB Output is correct
58 Correct 92 ms 1712 KB Output is correct
59 Correct 188 ms 1868 KB Output is correct
60 Correct 281 ms 1844 KB Output is correct
61 Correct 321 ms 1836 KB Output is correct
62 Correct 87 ms 1740 KB Output is correct
63 Correct 134 ms 1860 KB Output is correct
64 Correct 153 ms 1944 KB Output is correct
65 Correct 334 ms 2176 KB Output is correct