oj.uz

Submission #206919

# Submission time Handle Problem Language Result Execution time Memory
206919 2020-03-05T23:08:40 Z savacska Olympic Bus (JOI20_ho_t4) C++14
100 / 100
 144 ms 2936 KB 
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define x first
#define y second

using namespace std;

typedef long long ll;

const ll INF = (ll) 1e18;

vector <pair <int, int> > g[205], rev[205];
ll start1[205], finish1[205], start2[205], finish2[205], len[50005], cost[50005];
ll dist[205];
pair <int, int> back[205], forw[205], rebr[50005];
bool used[205], sf[50005], fs[50005];

void dijkstra(int n, int start, ll dist[], pair <int, int> parent[], vector <pair <int, int> > g[])
{
 	for (int i = 1; i <= n; i++) dist[i] = INF, used[i] = false, parent[i] = mp(0, 0);
 	dist[start] = 0;
 	for (int rep = 1; rep <= n; rep++)
 	{
 	 	int v = -1;
 	 	for (int i = 1; i <= n; i++)
 	 		if (!used[i] && (v == -1 || dist[v] > dist[i])) v = i;
 	 	if (dist[v] == INF) break;

 	 	used[v] = true;
 	 	for (int i = 0; i < (int) g[v].size(); i++)
 	 	{
 	 	 	int u = g[v][i].x, num = g[v][i].y;
 	 	 	if (dist[u] > dist[v] + len[num])
 	 	 		dist[u] = dist[v] + len[num], parent[u] = mp(v, num);
 	 	}
 	}
 	return;
}

ll schet(int n, int start, int finish, int num)
{
 	for (int i = 1; i <= n; i++) dist[i] = INF, used[i] = false;
 	dist[start] = 0;
 	for (int rep = 1; rep <= n; rep++)
 	{
 	 	int v = -1;
 	 	for (int i = 1; i <= n; i++)
 	 		if (!used[i] && (v == -1 || dist[v] > dist[i])) v = i;
 	 	if (dist[v] == INF) break;

 	 	used[v] = true;
 	 	for (int i = 0; i < (int) g[v].size(); i++)
 	 	{
 	 	 	int u = g[v][i].x, nm = g[v][i].y;
 	 	 	if (nm == num) continue;
 	 	 	dist[u] = min(dist[u], dist[v] + len[nm]);
 	 	}
 	 	if (v == rebr[num].y) dist[rebr[num].x] = min(dist[rebr[num].x], dist[v] + len[num]);
 	}
 	return dist[finish];
}

int main()
{
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	ios_base::sync_with_stdio(0); cin.tie(0);
	int n, m;
	cin >> n >> m;
	for (int i = 1; i <= m; i++)
	{
	 	int u, v;
	 	cin >> u >> v >> len[i] >> cost[i];
	 	rebr[i] = mp(u, v);
	 	g[u].pb(mp(v, i)), rev[v].pb(mp(u, i));
	}
	dijkstra(n, 1, start2, back, rev);
	dijkstra(n, n, finish2, forw, rev);
	dijkstra(n, 1, start1, back, g);
	dijkstra(n, n, finish1, forw, g);

	int tek = n;
	while (back[tek].y > 0)
	{
		sf[back[tek].y] = true;
		tek = back[tek].x; 	
	}
	tek = 1;
	while (forw[tek].y > 0)
	{
	 	fs[forw[tek].y] = true;
	 	tek = forw[tek].x;
	}

	ll ans = min(INF, start1[n] + finish1[1]);
	for (int i = 1; i <= m; i++)
	{
	 	ll cs1 = 0, cs2 = 0;
	 	if (sf[i]) cs1 = schet(n, 1, n, i);
	 	else cs1 = min(start1[n], start1[rebr[i].y] + len[i] + finish2[rebr[i].x]);
	 	if (fs[i]) cs2 = schet(n, n, 1, i);
	 	else cs2 = min(finish1[1], finish1[rebr[i].y] + len[i] + start2[rebr[i].x]);
	 	ans = min(ans, cs1 + cs2 + cost[i]);
	}
	if (ans != INF) cout << ans << '\n';
	else cout << "-1\n";
	return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 7 ms 504 KB Output is correct
4 Correct 7 ms 376 KB Output is correct
5 Correct 6 ms 376 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 376 KB Output is correct
10 Correct 49 ms 376 KB Output is correct
11 Correct 50 ms 408 KB Output is correct
12 Correct 51 ms 376 KB Output is correct
13 Correct 6 ms 376 KB Output is correct
14 Correct 7 ms 376 KB Output is correct
15 Correct 6 ms 376 KB Output is correct
16 Correct 7 ms 504 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 2808 KB Output is correct
2 Correct 28 ms 2808 KB Output is correct
3 Correct 32 ms 2808 KB Output is correct
4 Correct 7 ms 504 KB Output is correct
5 Correct 7 ms 376 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 29 ms 2808 KB Output is correct
10 Correct 28 ms 2808 KB Output is correct
11 Correct 32 ms 2808 KB Output is correct
12 Correct 30 ms 2812 KB Output is correct
13 Correct 35 ms 2808 KB Output is correct
14 Correct 31 ms 2936 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 24 ms 2172 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 26 ms 2808 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 26 ms 2808 KB Output is correct
9 Correct 26 ms 2808 KB Output is correct
10 Correct 25 ms 2808 KB Output is correct
11 Correct 26 ms 2808 KB Output is correct
12 Correct 26 ms 2936 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 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 27 ms 2936 KB Output is correct
20 Correct 26 ms 2808 KB Output is correct
21 Correct 26 ms 2808 KB Output is correct
22 Correct 29 ms 2808 KB Output is correct

Subtask #4
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 7 ms 504 KB Output is correct
4 Correct 7 ms 376 KB Output is correct
5 Correct 6 ms 376 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 376 KB Output is correct
10 Correct 49 ms 376 KB Output is correct
11 Correct 50 ms 408 KB Output is correct
12 Correct 51 ms 376 KB Output is correct
13 Correct 6 ms 376 KB Output is correct
14 Correct 7 ms 376 KB Output is correct
15 Correct 6 ms 376 KB Output is correct
16 Correct 7 ms 504 KB Output is correct
17 Correct 28 ms 2808 KB Output is correct
18 Correct 28 ms 2808 KB Output is correct
19 Correct 32 ms 2808 KB Output is correct
20 Correct 7 ms 504 KB Output is correct
21 Correct 7 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 29 ms 2808 KB Output is correct
26 Correct 28 ms 2808 KB Output is correct
27 Correct 32 ms 2808 KB Output is correct
28 Correct 30 ms 2812 KB Output is correct
29 Correct 35 ms 2808 KB Output is correct
30 Correct 31 ms 2936 KB Output is correct
31 Correct 8 ms 376 KB Output is correct
32 Correct 5 ms 376 KB Output is correct
33 Correct 24 ms 2172 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 26 ms 2808 KB Output is correct
36 Correct 5 ms 376 KB Output is correct
37 Correct 5 ms 376 KB Output is correct
38 Correct 26 ms 2808 KB Output is correct
39 Correct 26 ms 2808 KB Output is correct
40 Correct 25 ms 2808 KB Output is correct
41 Correct 26 ms 2808 KB Output is correct
42 Correct 26 ms 2936 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 376 KB Output is correct
48 Correct 5 ms 376 KB Output is correct
49 Correct 27 ms 2936 KB Output is correct
50 Correct 26 ms 2808 KB Output is correct
51 Correct 26 ms 2808 KB Output is correct
52 Correct 29 ms 2808 KB Output is correct
53 Correct 30 ms 2808 KB Output is correct
54 Correct 35 ms 2808 KB Output is correct
55 Correct 30 ms 2808 KB Output is correct
56 Correct 7 ms 376 KB Output is correct
57 Correct 7 ms 376 KB Output is correct
58 Correct 144 ms 2296 KB Output is correct
59 Correct 128 ms 2300 KB Output is correct
60 Correct 129 ms 2296 KB Output is correct
61 Correct 107 ms 2296 KB Output is correct
62 Correct 129 ms 2296 KB Output is correct
63 Correct 132 ms 2424 KB Output is correct
64 Correct 127 ms 2424 KB Output is correct
65 Correct 120 ms 2424 KB Output is correct
66 Correct 105 ms 2424 KB Output is correct
67 Correct 22 ms 2164 KB Output is correct
68 Correct 29 ms 2808 KB Output is correct
69 Correct 27 ms 2808 KB Output is correct
70 Correct 35 ms 2808 KB Output is correct
71 Correct 33 ms 2936 KB Output is correct
72 Correct 31 ms 2808 KB Output is correct
73 Correct 33 ms 2912 KB Output is correct
74 Correct 33 ms 2808 KB Output is correct