oj.uz

Submission #958780

# Submission time Handle Problem Language Result Execution time Memory
958780 2024-04-06T15:17:57 Z AlperenT Olympic Bus (JOI20_ho_t4) C++17
16 / 100
 1000 ms 3772 KB 
#include <bits/stdc++.h>

using namespace std;

const int INF = 2e9;

int n, m, ans = INF;

vector<vector<pair<int, int>>> normalgraph, revgraph, brutegraph;

vector<int> a, b, c, d, from1, to1, fromn, ton;

vector<bool> isinsp;

void dijkstra(int x, vector<int> &dist, vector<vector<pair<int, int>>> &graph){
	vector<bool> vis(n + 1, false);
	vector<int> par(n + 1, -1);

	dist.assign(n + 1, INF);
	dist[x] = 0;

	while(true){
		int v = -1;

		for(int i = 1; i <= n; i++){
			if(!vis[i] && dist[i] != INF && (v == -1 || dist[i] < dist[v])){
				v = i;
			}
		}

		if(v == -1) break;

		if(par[v] != -1) isinsp[par[v]] = true;

		vis[v] = true;

		for(auto [u, i] : graph[v]){
			if(dist[v] + c[i] < dist[u]){
				dist[u] = dist[v] + c[i];
				par[u] = i;
			}
		}
	}
}

int main() {
	ios_base::sync_with_stdio(false);cin.tie(NULL);

	cin >> n >> m;

	normalgraph = revgraph = vector(n + 1, vector<pair<int, int>>{});

	a = b = c = d = vector(m + 1, 0);
	isinsp = vector(m + 1, false);

	for(int i = 1; i <= m; i++){
		cin >> a[i] >> b[i] >> c[i] >> d[i];

		normalgraph[a[i]].push_back({b[i], i});
		revgraph[b[i]].push_back({a[i], i});
	}

	dijkstra(1, from1, normalgraph);
	dijkstra(1, to1, revgraph);
	dijkstra(n, fromn, normalgraph);
	dijkstra(n, ton, revgraph);

	if(from1[n] != INF && fromn[1] != INF) ans = from1[n] + fromn[1];

	for(int i = 1; i <= m; i++){
		int useton = INF, useto1 = INF;

		if(isinsp[i]){
			brutegraph = vector(n + 1, vector<pair<int, int>>{});

			for(int j = 1; j <= m; j++){
				if(j == i) brutegraph[b[j]].push_back({a[j], j});
				else brutegraph[a[j]].push_back({b[j], j});
			}

			vector<int> brutedist;

			dijkstra(1, brutedist, brutegraph);

			useton = brutedist[n];

			dijkstra(n, brutedist, brutegraph);

			useto1 = brutedist[1];
		}
		else{
			useton = from1[n], useto1 = fromn[1];

			if(from1[b[i]] != INF && ton[a[i]] != INF) useton = min(useton, from1[b[i]] + c[i] + ton[a[i]]);

			if(fromn[b[i]] != INF && to1[a[i]] != INF) useto1 = min(useto1, fromn[b[i]] + c[i] + to1[a[i]]);
		}

		if(useton != INF && useto1 != INF) ans = min(ans, d[i] + useton + useto1);
	}

	cout << (ans == INF ? -1 : ans);
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 348 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
3 Correct 127 ms 520 KB Output is correct
4 Correct 130 ms 344 KB Output is correct
5 Correct 4 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 122 ms 540 KB Output is correct
11 Correct 103 ms 344 KB Output is correct
12 Correct 100 ms 540 KB Output is correct
13 Correct 51 ms 348 KB Output is correct
14 Correct 85 ms 348 KB Output is correct
15 Correct 88 ms 516 KB Output is correct
16 Correct 81 ms 348 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 685 ms 3236 KB Output is correct
2 Correct 738 ms 3316 KB Output is correct
3 Correct 664 ms 3312 KB Output is correct
4 Correct 173 ms 344 KB Output is correct
5 Correct 115 ms 516 KB Output is correct
6 Correct 4 ms 344 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 497 ms 3192 KB Output is correct
10 Correct 442 ms 3324 KB Output is correct
11 Correct 586 ms 3276 KB Output is correct
12 Correct 556 ms 3152 KB Output is correct
13 Correct 519 ms 3372 KB Output is correct
14 Correct 520 ms 3772 KB Output is correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 348 KB Output is correct
2 Correct 10 ms 504 KB Output is correct
3 Correct 655 ms 2460 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 769 ms 3484 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Execution timed out 1088 ms 3580 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 348 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
3 Correct 127 ms 520 KB Output is correct
4 Correct 130 ms 344 KB Output is correct
5 Correct 4 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 122 ms 540 KB Output is correct
11 Correct 103 ms 344 KB Output is correct
12 Correct 100 ms 540 KB Output is correct
13 Correct 51 ms 348 KB Output is correct
14 Correct 85 ms 348 KB Output is correct
15 Correct 88 ms 516 KB Output is correct
16 Correct 81 ms 348 KB Output is correct
17 Correct 685 ms 3236 KB Output is correct
18 Correct 738 ms 3316 KB Output is correct
19 Correct 664 ms 3312 KB Output is correct
20 Correct 173 ms 344 KB Output is correct
21 Correct 115 ms 516 KB Output is correct
22 Correct 4 ms 344 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 497 ms 3192 KB Output is correct
26 Correct 442 ms 3324 KB Output is correct
27 Correct 586 ms 3276 KB Output is correct
28 Correct 556 ms 3152 KB Output is correct
29 Correct 519 ms 3372 KB Output is correct
30 Correct 520 ms 3772 KB Output is correct
31 Correct 97 ms 348 KB Output is correct
32 Correct 10 ms 504 KB Output is correct
33 Correct 655 ms 2460 KB Output is correct
34 Correct 5 ms 504 KB Output is correct
35 Correct 769 ms 3484 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Execution timed out 1088 ms 3580 KB Time limit exceeded
39 Halted 0 ms 0 KB -