oj.uz

답안 #203120

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
203120 2020-02-19T12:33:42 Z ics0503 Olympic Bus (JOI20_ho_t4) C++17
100 / 100
 832 ms 7928 KB 
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
struct xy { long long x, y, z, ck, idx; };
vector<xy>edge[212], redge[212];
long long n, m, dist[4][212], bef[4][212], dep[4][212], rdist[4][212], u[51515], v[51515], c[51515];
void dijkstra(long long st, long long flag, long long dist[4][212], vector<xy> edge[212]) {
	for (int i = 1; i <= n; i++)dist[flag][i] = 1e15;
	dist[flag][st] = 0;
	priority_queue<pair<long long , long long >>H;
	H.push({0, st});
	int dept = 0;
	while (!H.empty()) {
		auto g = H.top(); H.pop();
		long long now = g.second;
		if (dist[flag][now] != -g.first)continue;
		dep[flag][now] = ++dept;
		for (xy E : edge[now]) {
			if (E.ck)continue;
			long long nxt = E.x, c = E.y;
			if (dist[flag][nxt] > dist[flag][now] + c) {
				dist[flag][nxt] = dist[flag][now] + c;
				H.push({ -dist[flag][nxt],nxt });
			}
		}
	}
}
int main() {
	long long i, j; scanf("%lld%lld", &n, &m);
	for (i = 0; i < m; i++) {
		long long d; scanf("%lld%lld%lld%lld", &u[i], &v[i], &c[i], &d);
		edge[u[i]].push_back({ v[i],c[i],d,0,i });
		redge[v[i]].push_back({ u[i],c[i],d,0,i });
	}
	dijkstra(1, 0, dist, edge); dijkstra(n, 1, dist, edge);
	dijkstra(1, 0, rdist, redge); dijkstra(n, 1, rdist, redge);
	for (long long tc = 0; tc < 2; tc++) {
		for (i = 0; i < m; i++) {
			if (dist[tc][u[i]] < 1e14 && dist[tc][u[i]] + c[i] == dist[tc][v[i]] && dep[tc][v[i]] > dep[tc][u[i]]) {
				bef[tc][v[i]] = i + 1;
			}
		}
	}
	long long ans = dist[0][n] + dist[1][1];
	for (i = 1; i <= n; i++) {
		for (j = 0; j < edge[i].size(); j++) {
			long long u = i, v = edge[i][j].x, c = edge[i][j].y, d = edge[i][j].z, idx = edge[i][j].idx;
			if (bef[0][v] != idx + 1 && bef[1][v] != idx + 1) {
				ans = min(ans, dist[0][v] + c + rdist[1][u] + dist[1][1] + d);
				ans = min(ans, dist[1][v] + c + rdist[0][u] + dist[0][n] + d);
				ans = min(ans, dist[0][v] + c + rdist[1][u] + dist[1][v] + c + rdist[0][u] + d);
			}
			else {
				edge[i][j].ck = 1;
				edge[v].push_back({ u, c, d, 0, idx });
				dijkstra(1, 2, dist, edge);
				dijkstra(n, 3, dist, edge);
				ans = min(ans, dist[2][n] + dist[3][1] + d);
				edge[v].pop_back();
				edge[i][j].ck = 0;
			}
		}
	}
	if (ans >= 1e14)printf("-1");
	else printf("%lld\n", ans);
	return 0;
}

Compilation message

ho_t4.cpp: In function 'int main()':
ho_t4.cpp:48:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (j = 0; j < edge[i].size(); j++) {
               ~~^~~~~~~~~~~~~~~~
ho_t4.cpp:31:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  long long i, j; scanf("%lld%lld", &n, &m);
                  ~~~~~^~~~~~~~~~~~~~~~~~~~
ho_t4.cpp:33:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   long long d; scanf("%lld%lld%lld%lld", &u[i], &v[i], &c[i], &d);
                ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 508 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 13 ms 504 KB Output is correct
4 Correct 16 ms 504 KB Output is correct
5 Correct 6 ms 504 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 9 ms 504 KB Output is correct
11 Correct 21 ms 504 KB Output is correct
12 Correct 19 ms 504 KB Output is correct
13 Correct 9 ms 504 KB Output is correct
14 Correct 14 ms 504 KB Output is correct
15 Correct 11 ms 504 KB Output is correct
16 Correct 12 ms 504 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 98 ms 7672 KB Output is correct
2 Correct 106 ms 7788 KB Output is correct
3 Correct 104 ms 7416 KB Output is correct
4 Correct 15 ms 632 KB Output is correct
5 Correct 10 ms 504 KB Output is correct
6 Correct 6 ms 376 KB Output is correct
7 Correct 6 ms 380 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 62 ms 7288 KB Output is correct
10 Correct 64 ms 7416 KB Output is correct
11 Correct 90 ms 7520 KB Output is correct
12 Correct 99 ms 7520 KB Output is correct
13 Correct 89 ms 7160 KB Output is correct
14 Correct 72 ms 7928 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 504 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 62 ms 5624 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 74 ms 7416 KB Output is correct
6 Correct 5 ms 380 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 43 ms 7416 KB Output is correct
9 Correct 50 ms 7160 KB Output is correct
10 Correct 71 ms 7416 KB Output is correct
11 Correct 64 ms 7544 KB Output is correct
12 Correct 67 ms 7544 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 380 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 65 ms 7800 KB Output is correct
20 Correct 63 ms 7416 KB Output is correct
21 Correct 68 ms 7160 KB Output is correct
22 Correct 64 ms 7416 KB Output is correct

Subtask #4
63.0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 508 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 13 ms 504 KB Output is correct
4 Correct 16 ms 504 KB Output is correct
5 Correct 6 ms 504 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 9 ms 504 KB Output is correct
11 Correct 21 ms 504 KB Output is correct
12 Correct 19 ms 504 KB Output is correct
13 Correct 9 ms 504 KB Output is correct
14 Correct 14 ms 504 KB Output is correct
15 Correct 11 ms 504 KB Output is correct
16 Correct 12 ms 504 KB Output is correct
17 Correct 98 ms 7672 KB Output is correct
18 Correct 106 ms 7788 KB Output is correct
19 Correct 104 ms 7416 KB Output is correct
20 Correct 15 ms 632 KB Output is correct
21 Correct 10 ms 504 KB Output is correct
22 Correct 6 ms 376 KB Output is correct
23 Correct 6 ms 380 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 62 ms 7288 KB Output is correct
26 Correct 64 ms 7416 KB Output is correct
27 Correct 90 ms 7520 KB Output is correct
28 Correct 99 ms 7520 KB Output is correct
29 Correct 89 ms 7160 KB Output is correct
30 Correct 72 ms 7928 KB Output is correct
31 Correct 13 ms 504 KB Output is correct
32 Correct 5 ms 376 KB Output is correct
33 Correct 62 ms 5624 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 74 ms 7416 KB Output is correct
36 Correct 5 ms 380 KB Output is correct
37 Correct 5 ms 376 KB Output is correct
38 Correct 43 ms 7416 KB Output is correct
39 Correct 50 ms 7160 KB Output is correct
40 Correct 71 ms 7416 KB Output is correct
41 Correct 64 ms 7544 KB Output is correct
42 Correct 67 ms 7544 KB Output is correct
43 Correct 5 ms 376 KB Output is correct
44 Correct 5 ms 376 KB Output is correct
45 Correct 5 ms 376 KB Output is correct
46 Correct 5 ms 376 KB Output is correct
47 Correct 5 ms 380 KB Output is correct
48 Correct 5 ms 376 KB Output is correct
49 Correct 65 ms 7800 KB Output is correct
50 Correct 63 ms 7416 KB Output is correct
51 Correct 68 ms 7160 KB Output is correct
52 Correct 64 ms 7416 KB Output is correct
53 Correct 120 ms 6904 KB Output is correct
54 Correct 113 ms 7416 KB Output is correct
55 Correct 93 ms 7088 KB Output is correct
56 Correct 17 ms 504 KB Output is correct
57 Correct 16 ms 504 KB Output is correct
58 Correct 37 ms 5632 KB Output is correct
59 Correct 64 ms 5752 KB Output is correct
60 Correct 130 ms 5752 KB Output is correct
61 Correct 37 ms 5624 KB Output is correct
62 Correct 59 ms 5624 KB Output is correct
63 Correct 131 ms 5624 KB Output is correct
64 Correct 95 ms 6568 KB Output is correct
65 Correct 288 ms 6556 KB Output is correct
66 Correct 832 ms 6712 KB Output is correct
67 Correct 30 ms 5184 KB Output is correct
68 Correct 60 ms 7544 KB Output is correct
69 Correct 62 ms 7416 KB Output is correct
70 Correct 91 ms 7416 KB Output is correct
71 Correct 87 ms 7288 KB Output is correct
72 Correct 95 ms 7416 KB Output is correct
73 Correct 101 ms 7548 KB Output is correct
74 Correct 89 ms 7544 KB Output is correct