oj.uz

Submission #290994

# Submission time Handle Problem Language Result Execution time Memory
290994 2020-09-04T15:19:14 Z cheissmart Olympic Bus (JOI20_ho_t4) C++14
37 / 100
 1000 ms 8696 KB 
#include <iostream>
#include <queue>
#include <vector>
#include <array>
#pragma GCC optimize("Ofast")
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define V vector
#define ALL(v) (v).begin(), (v).end()

using namespace std;

typedef long long ll;
typedef pair<int, int> pi;
typedef V<int> vi;

const int N = 1e5 + 7, INF = 1e9 + 7;

int u[N], v[N], c[N], d[N], d1[N], d2[N], tmp[N], from[N], is1[N], is2[N], dd1[N], dd2[N], is11[N], is22[N];
int n, m;
V<array<int, 3>> G[N], rG[N];

void go(V<array<int, 3>>* G, int s, int* d, int no = -1) {
	for(int i = 1; i <= n; i++) d[i] = INF;
	d[s] = 0;
	priority_queue<pi, V<pi>, greater<pi>> pq;
	pq.push({0, s});
	while(pq.size()) {
		pi p = pq.top(); pq.pop();
		int u = p.S;
		if(d[u] < p.F) continue;
		for(auto e:G[u]) {
			int v = e[0], w = e[1];
			if(e[2] == no) continue;
			if(d[u] + w < d[v]) {
				d[v] = d[u] + w;
				from[v] = e[2];
				pq.push({d[v], v});
			}
		}
	}
}

int no1(int i, int u) {
	if(!is1[i]) return d1[u];
	go(G, 1, tmp, i);
	return tmp[u];
}

int no2(int i, int u) {
	if(!is2[i]) return d2[u];
	go(G, n, tmp, i);
	return tmp[u];
}

int no11(int i, int u) {
	if(!is11[i]) return dd1[u];
	go(rG, 1, tmp, i);
	return tmp[u];
}

int no22(int i, int u) {
	if(!is22[i]) return dd2[u];
	go(rG, n, tmp, i);
	return tmp[u];
}

signed main()
{
	cin >> n >> m;
	for(int i = 0; i < m; i++) {
		cin >> u[i] >> v[i] >> c[i] >> d[i];
		G[u[i]].PB({v[i], c[i], i});
		rG[v[i]].PB({u[i], c[i], i});
 	}
 	go(G, 1, d1);
 	for(int i = 2; i <= n; i++) {
		if(d1[i] < INF) is1[from[i]] = 1;
	}
 	go(G, n, d2);
 	for(int i = 1; i < n; i++) {
		if(d2[i] < INF) is2[from[i]] = 1;
	}
	
	go(rG, 1, dd1);
 	for(int i = 2; i <= n; i++) {
		if(dd1[i] < INF) is11[from[i]] = 1;
	}
	go(rG, n, dd2);
 	for(int i = 1; i < n; i++) {
		if(dd2[i] < INF) is22[from[i]] = 1;
	}
/*	
	for(int i = 0; i < m; i++) if(is1[i]) cerr << i << " ";
	cerr << endl;
	for(int i = 0; i < m; i++) if(is2[i]) cerr << i << " ";
	cerr << endl;
*/
 	ll ans = d1[n] + d2[1];
  	for(int i = 0; i < m; i++) {
		int ans1 = min(no1(i, v[i]) + no22(i, u[i]) + c[i], no1(i, n));
		int ans2 = min(no11(i, u[i]) + no2(i, v[i]) + c[i], no2(i, 1));
 		ans = min(ans, (ll) ans1 + ans2 + d[i]);
	}
 	if(ans >= INF) ans = -1;
 	cout << ans << endl;
 	
	
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 5248 KB Output is correct
2 Correct 5 ms 5120 KB Output is correct
3 Correct 42 ms 5120 KB Output is correct
4 Correct 42 ms 5120 KB Output is correct
5 Correct 8 ms 5120 KB Output is correct
6 Correct 5 ms 5120 KB Output is correct
7 Correct 4 ms 5120 KB Output is correct
8 Correct 4 ms 5120 KB Output is correct
9 Correct 6 ms 5120 KB Output is correct
10 Correct 55 ms 5120 KB Output is correct
11 Correct 53 ms 5120 KB Output is correct
12 Correct 54 ms 5120 KB Output is correct
13 Correct 14 ms 5120 KB Output is correct
14 Correct 27 ms 5120 KB Output is correct
15 Correct 23 ms 5120 KB Output is correct
16 Correct 27 ms 5120 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 324 ms 8572 KB Output is correct
2 Correct 311 ms 8568 KB Output is correct
3 Correct 327 ms 8568 KB Output is correct
4 Correct 40 ms 5248 KB Output is correct
5 Correct 21 ms 5152 KB Output is correct
6 Correct 7 ms 5120 KB Output is correct
7 Correct 5 ms 5120 KB Output is correct
8 Correct 4 ms 5120 KB Output is correct
9 Correct 159 ms 8440 KB Output is correct
10 Correct 157 ms 8312 KB Output is correct
11 Correct 240 ms 8496 KB Output is correct
12 Correct 244 ms 8572 KB Output is correct
13 Correct 245 ms 8668 KB Output is correct
14 Correct 237 ms 8696 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 5120 KB Output is correct
2 Correct 6 ms 5120 KB Output is correct
3 Correct 178 ms 7544 KB Output is correct
4 Correct 5 ms 5120 KB Output is correct
5 Correct 220 ms 8568 KB Output is correct
6 Correct 4 ms 5120 KB Output is correct
7 Correct 3 ms 5120 KB Output is correct
8 Correct 120 ms 8352 KB Output is correct
9 Correct 124 ms 8312 KB Output is correct
10 Correct 174 ms 8312 KB Output is correct
11 Correct 176 ms 8440 KB Output is correct
12 Correct 179 ms 8440 KB Output is correct
13 Correct 4 ms 5120 KB Output is correct
14 Correct 4 ms 5120 KB Output is correct
15 Correct 4 ms 5120 KB Output is correct
16 Correct 4 ms 5120 KB Output is correct
17 Correct 4 ms 5120 KB Output is correct
18 Correct 4 ms 5120 KB Output is correct
19 Correct 177 ms 8568 KB Output is correct
20 Correct 177 ms 8440 KB Output is correct
21 Correct 175 ms 8440 KB Output is correct
22 Correct 175 ms 8440 KB Output is correct

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 5248 KB Output is correct
2 Correct 5 ms 5120 KB Output is correct
3 Correct 42 ms 5120 KB Output is correct
4 Correct 42 ms 5120 KB Output is correct
5 Correct 8 ms 5120 KB Output is correct
6 Correct 5 ms 5120 KB Output is correct
7 Correct 4 ms 5120 KB Output is correct
8 Correct 4 ms 5120 KB Output is correct
9 Correct 6 ms 5120 KB Output is correct
10 Correct 55 ms 5120 KB Output is correct
11 Correct 53 ms 5120 KB Output is correct
12 Correct 54 ms 5120 KB Output is correct
13 Correct 14 ms 5120 KB Output is correct
14 Correct 27 ms 5120 KB Output is correct
15 Correct 23 ms 5120 KB Output is correct
16 Correct 27 ms 5120 KB Output is correct
17 Correct 324 ms 8572 KB Output is correct
18 Correct 311 ms 8568 KB Output is correct
19 Correct 327 ms 8568 KB Output is correct
20 Correct 40 ms 5248 KB Output is correct
21 Correct 21 ms 5152 KB Output is correct
22 Correct 7 ms 5120 KB Output is correct
23 Correct 5 ms 5120 KB Output is correct
24 Correct 4 ms 5120 KB Output is correct
25 Correct 159 ms 8440 KB Output is correct
26 Correct 157 ms 8312 KB Output is correct
27 Correct 240 ms 8496 KB Output is correct
28 Correct 244 ms 8572 KB Output is correct
29 Correct 245 ms 8668 KB Output is correct
30 Correct 237 ms 8696 KB Output is correct
31 Correct 30 ms 5120 KB Output is correct
32 Correct 6 ms 5120 KB Output is correct
33 Correct 178 ms 7544 KB Output is correct
34 Correct 5 ms 5120 KB Output is correct
35 Correct 220 ms 8568 KB Output is correct
36 Correct 4 ms 5120 KB Output is correct
37 Correct 3 ms 5120 KB Output is correct
38 Correct 120 ms 8352 KB Output is correct
39 Correct 124 ms 8312 KB Output is correct
40 Correct 174 ms 8312 KB Output is correct
41 Correct 176 ms 8440 KB Output is correct
42 Correct 179 ms 8440 KB Output is correct
43 Correct 4 ms 5120 KB Output is correct
44 Correct 4 ms 5120 KB Output is correct
45 Correct 4 ms 5120 KB Output is correct
46 Correct 4 ms 5120 KB Output is correct
47 Correct 4 ms 5120 KB Output is correct
48 Correct 4 ms 5120 KB Output is correct
49 Correct 177 ms 8568 KB Output is correct
50 Correct 177 ms 8440 KB Output is correct
51 Correct 175 ms 8440 KB Output is correct
52 Correct 175 ms 8440 KB Output is correct
53 Correct 344 ms 8476 KB Output is correct
54 Correct 341 ms 8572 KB Output is correct
55 Correct 333 ms 8568 KB Output is correct
56 Correct 41 ms 5120 KB Output is correct
57 Correct 43 ms 5120 KB Output is correct
58 Correct 293 ms 7704 KB Output is correct
59 Correct 312 ms 7672 KB Output is correct
60 Correct 317 ms 7600 KB Output is correct
61 Correct 291 ms 7672 KB Output is correct
62 Correct 297 ms 7672 KB Output is correct
63 Correct 312 ms 7800 KB Output is correct
64 Execution timed out 1095 ms 8180 KB Time limit exceeded
65 Halted 0 ms 0 KB -