oj.uz

Submission #1008083

# Submission time Handle Problem Language Result Execution time Memory
1008083 2024-06-26T07:31:34 Z overwatch9 Swapping Cities (APIO20_swap) C++17
0 / 100
 2000 ms 524288 KB 
#include "swap.h"

#include <bits/stdc++.h>
using namespace std;

vector <vector <pair <int, int>>> adj;
vector <array <int, 3>> edges;
int n, m;
void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
    adj.resize(N+1);
	n = N;
	m = M;
    for (int i = 0; i < M; i++) {
        adj[U[i]].push_back({V[i], W[i]});
		adj[V[i]].push_back({U[i], W[i]});
		edges.push_back({U[i], V[i], W[i]});
		edges.push_back({V[i], U[i], W[i]});
	}
}

int getMinimumFuelCapacity(int x, int y) {
	vector <vector <int>> dis(n, vector <int> (n, 1e9 + 1));
	dis[x][y] = 0;
	priority_queue <array <int, 3>> pq;
	pq.push({0, x, y});
	vector <vector <bool>> processed(n, vector <bool> (n));
	while (!pq.empty()) {
		int a = pq.top()[1], b = pq.top()[2];
		pq.pop();
		if (processed[a][b])
			continue;
		processed[a][b] = true;
		for (auto i : adj[a]) {
			for (auto j : adj[b]) {
				int d = max({dis[a][b], i.second, j.second});
				if (d < dis[i.first][j.first] && i.first != j.first && (i.first != b || j.first != a)) {
					dis[i.first][j.first] = d;
					pq.push({-d, i.first, j.first});
				}
				d = max(dis[a][b], i.second);
				if (d < dis[i.first][b] && i.first != b) {
					dis[i.first][b] = d;
					pq.push({-d, i.first, b});
				}
				d = max(dis[a][b], j.second);
				if (d < dis[a][j.first] && a != j.first) {
					dis[a][j.first] = d;
					pq.push({-d, a, j.first});
				}
			}
		}
	}
	if (dis[y][x] == 1e9 + 1)
		dis[y][x] = -1;
	return dis[y][x];
}
// int main() {
// 	int N, M;
// 	cin >> N >> M;
// 	vector <int> u(M), v(M), w(M);
// 	for (int i = 0; i < M; i++)
// 		cin >> u[i] >> v[i] >> w[i];
// 	init(N, M, u, v, w);
// 	int q;
// 	cin >> q;
// 	while (q--) {
// 		int x, y;
// 		cin >> x >> y;
// 		cout << getMinimumFuelCapacity(x, y) << '\n';
// 	}
// }

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 61 ms 1604 KB Output is correct
5 Correct 264 ms 6404 KB Output is correct
6 Correct 299 ms 6152 KB Output is correct
7 Correct 369 ms 9144 KB Output is correct
8 Correct 357 ms 5948 KB Output is correct
9 Runtime error 215 ms 524288 KB Execution killed with signal 9
10 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Runtime error 244 ms 524288 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 61 ms 1604 KB Output is correct
5 Correct 264 ms 6404 KB Output is correct
6 Correct 299 ms 6152 KB Output is correct
7 Correct 369 ms 9144 KB Output is correct
8 Correct 357 ms 5948 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 714 ms 12588 KB Output is correct
11 Correct 719 ms 7744 KB Output is correct
12 Correct 683 ms 10076 KB Output is correct
13 Correct 512 ms 8428 KB Output is correct
14 Correct 572 ms 5984 KB Output is correct
15 Correct 702 ms 6132 KB Output is correct
16 Correct 690 ms 6856 KB Output is correct
17 Correct 703 ms 7268 KB Output is correct
18 Correct 932 ms 11712 KB Output is correct
19 Correct 640 ms 14316 KB Output is correct
20 Correct 709 ms 9488 KB Output is correct
21 Correct 973 ms 16140 KB Output is correct
22 Correct 343 ms 6712 KB Output is correct
23 Correct 557 ms 8088 KB Output is correct
24 Execution timed out 2031 ms 43756 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 61 ms 1604 KB Output is correct
6 Correct 264 ms 6404 KB Output is correct
7 Correct 299 ms 6152 KB Output is correct
8 Correct 369 ms 9144 KB Output is correct
9 Correct 357 ms 5948 KB Output is correct
10 Runtime error 215 ms 524288 KB Execution killed with signal 9
11 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 61 ms 1604 KB Output is correct
5 Correct 264 ms 6404 KB Output is correct
6 Correct 299 ms 6152 KB Output is correct
7 Correct 369 ms 9144 KB Output is correct
8 Correct 357 ms 5948 KB Output is correct
9 Runtime error 215 ms 524288 KB Execution killed with signal 9
10 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 61 ms 1604 KB Output is correct
6 Correct 264 ms 6404 KB Output is correct
7 Correct 299 ms 6152 KB Output is correct
8 Correct 369 ms 9144 KB Output is correct
9 Correct 357 ms 5948 KB Output is correct
10 Runtime error 215 ms 524288 KB Execution killed with signal 9
11 Halted 0 ms 0 KB -