oj.uz

답안 #291010

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
291010 2020-09-04T15:25:27 Z cheissmart Olympic Bus (JOI20_ho_t4) C++14
100 / 100
 475 ms 9888 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];
int vis[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, vis[i] = 0;
	d[s] = 0;
	for(int i = 1; i <= n; i++) {
		int u = -1, mn = INF + 1;
		for(int j = 1; j <= n; j++) {
			if(!vis[j] && d[j] < mn) {
				mn = d[j];
				u = j;
			}
		}
		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];
			}
		}
		vis[u] = 1;
	}
	
}

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

# 결과 실행 시간 메모리 Grader output
1 Correct 89 ms 5120 KB Output is correct
2 Correct 11 ms 5120 KB Output is correct
3 Correct 141 ms 5240 KB Output is correct
4 Correct 143 ms 5240 KB Output is correct
5 Correct 7 ms 5120 KB Output is correct
6 Correct 19 ms 5120 KB Output is correct
7 Correct 4 ms 5120 KB Output is correct
8 Correct 3 ms 5120 KB Output is correct
9 Correct 6 ms 5120 KB Output is correct
10 Correct 145 ms 5120 KB Output is correct
11 Correct 154 ms 5216 KB Output is correct
12 Correct 142 ms 5120 KB Output is correct
13 Correct 59 ms 5120 KB Output is correct
14 Correct 103 ms 5212 KB Output is correct
15 Correct 103 ms 5120 KB Output is correct
16 Correct 102 ms 5120 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 345 ms 8600 KB Output is correct
2 Correct 349 ms 8568 KB Output is correct
3 Correct 366 ms 8572 KB Output is correct
4 Correct 145 ms 5248 KB Output is correct
5 Correct 126 ms 5120 KB Output is correct
6 Correct 31 ms 5120 KB Output is correct
7 Correct 9 ms 5120 KB Output is correct
8 Correct 4 ms 5120 KB Output is correct
9 Correct 220 ms 8440 KB Output is correct
10 Correct 227 ms 8488 KB Output is correct
11 Correct 293 ms 8636 KB Output is correct
12 Correct 289 ms 8568 KB Output is correct
13 Correct 287 ms 8696 KB Output is correct
14 Correct 285 ms 8824 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 87 ms 5240 KB Output is correct
2 Correct 36 ms 5120 KB Output is correct
3 Correct 216 ms 7672 KB Output is correct
4 Correct 24 ms 5120 KB Output is correct
5 Correct 258 ms 8568 KB Output is correct
6 Correct 3 ms 5120 KB Output is correct
7 Correct 3 ms 5120 KB Output is correct
8 Correct 189 ms 8312 KB Output is correct
9 Correct 190 ms 8312 KB Output is correct
10 Correct 236 ms 8312 KB Output is correct
11 Correct 229 ms 8440 KB Output is correct
12 Correct 228 ms 8440 KB Output is correct
13 Correct 3 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 234 ms 8696 KB Output is correct
20 Correct 231 ms 8440 KB Output is correct
21 Correct 225 ms 8440 KB Output is correct
22 Correct 231 ms 8432 KB Output is correct

Subtask #4
63.0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 89 ms 5120 KB Output is correct
2 Correct 11 ms 5120 KB Output is correct
3 Correct 141 ms 5240 KB Output is correct
4 Correct 143 ms 5240 KB Output is correct
5 Correct 7 ms 5120 KB Output is correct
6 Correct 19 ms 5120 KB Output is correct
7 Correct 4 ms 5120 KB Output is correct
8 Correct 3 ms 5120 KB Output is correct
9 Correct 6 ms 5120 KB Output is correct
10 Correct 145 ms 5120 KB Output is correct
11 Correct 154 ms 5216 KB Output is correct
12 Correct 142 ms 5120 KB Output is correct
13 Correct 59 ms 5120 KB Output is correct
14 Correct 103 ms 5212 KB Output is correct
15 Correct 103 ms 5120 KB Output is correct
16 Correct 102 ms 5120 KB Output is correct
17 Correct 345 ms 8600 KB Output is correct
18 Correct 349 ms 8568 KB Output is correct
19 Correct 366 ms 8572 KB Output is correct
20 Correct 145 ms 5248 KB Output is correct
21 Correct 126 ms 5120 KB Output is correct
22 Correct 31 ms 5120 KB Output is correct
23 Correct 9 ms 5120 KB Output is correct
24 Correct 4 ms 5120 KB Output is correct
25 Correct 220 ms 8440 KB Output is correct
26 Correct 227 ms 8488 KB Output is correct
27 Correct 293 ms 8636 KB Output is correct
28 Correct 289 ms 8568 KB Output is correct
29 Correct 287 ms 8696 KB Output is correct
30 Correct 285 ms 8824 KB Output is correct
31 Correct 87 ms 5240 KB Output is correct
32 Correct 36 ms 5120 KB Output is correct
33 Correct 216 ms 7672 KB Output is correct
34 Correct 24 ms 5120 KB Output is correct
35 Correct 258 ms 8568 KB Output is correct
36 Correct 3 ms 5120 KB Output is correct
37 Correct 3 ms 5120 KB Output is correct
38 Correct 189 ms 8312 KB Output is correct
39 Correct 190 ms 8312 KB Output is correct
40 Correct 236 ms 8312 KB Output is correct
41 Correct 229 ms 8440 KB Output is correct
42 Correct 228 ms 8440 KB Output is correct
43 Correct 3 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 234 ms 8696 KB Output is correct
50 Correct 231 ms 8440 KB Output is correct
51 Correct 225 ms 8440 KB Output is correct
52 Correct 231 ms 8432 KB Output is correct
53 Correct 355 ms 8464 KB Output is correct
54 Correct 344 ms 8696 KB Output is correct
55 Correct 345 ms 8696 KB Output is correct
56 Correct 145 ms 5120 KB Output is correct
57 Correct 140 ms 5120 KB Output is correct
58 Correct 305 ms 7800 KB Output is correct
59 Correct 308 ms 7804 KB Output is correct
60 Correct 308 ms 7932 KB Output is correct
61 Correct 309 ms 7800 KB Output is correct
62 Correct 307 ms 7800 KB Output is correct
63 Correct 310 ms 7800 KB Output is correct
64 Correct 475 ms 8068 KB Output is correct
65 Correct 438 ms 8824 KB Output is correct
66 Correct 419 ms 8824 KB Output is correct
67 Correct 86 ms 7992 KB Output is correct
68 Correct 230 ms 9848 KB Output is correct
69 Correct 222 ms 9720 KB Output is correct
70 Correct 288 ms 9592 KB Output is correct
71 Correct 292 ms 9720 KB Output is correct
72 Correct 289 ms 9720 KB Output is correct
73 Correct 300 ms 9888 KB Output is correct
74 Correct 289 ms 9720 KB Output is correct