oj.uz

Submission #276659

# Submission time Handle Problem Language Result Execution time Memory
276659 2020-08-20T14:47:20 Z islingr Olympic Bus (JOI20_ho_t4) C++17
100 / 100
 278 ms 3516 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/priority_queue.hpp>
using namespace std;
 
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define all(x...) begin(x), end(x)

using ll = long long;

template<class T> bool ckmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }

const int N = 1 << 9, M = 1 << 16;
const ll inf = 1e18;

int n;
ll d[N][N];
int a[M], b[M], w[M], c[M];
vector<int> g[N];
bool onPath[M], vis[N];

bool dfs(int u, int t) {
	if (u == t) return true;
	vis[u] = true;
	for (int e : g[u]) {
		int v = b[e];
		if (!vis[v] && w[e] + d[v][t] == d[u][t] && dfs(v, t))
			return onPath[e] = true;
	}
	return false;
}

ll dist[N];
ll dij(int s, int t) {
	fill(dist, dist + n + 1, inf);
	fill(vis, vis + n, false);
	dist[s] = 0;
	rep(i, 0, n) {
		int u = n;
		rep(v, 0, n) if (!vis[v] && dist[v] < dist[u]) u = v;
		if (dist[u] == inf) break;
		vis[u] = true;
		for (int e : g[u]) ckmin(dist[b[e]], dist[u] + w[e]);
	}
	return dist[t];
}

signed main() {
	cin.tie(nullptr)->sync_with_stdio(false);
 
	int m; cin >> n >> m;
	rep(u, 0, n) rep(v, 0, n) d[u][v] = inf;
	rep(u, 0, n) d[u][u] = 0;
	rep(e, 0, m) {
		cin >> a[e] >> b[e] >> w[e] >> c[e], --a[e], --b[e];
		ckmin(d[a[e]][b[e]], ll(w[e]));
		g[a[e]].push_back(e);
	}
 
	rep(w, 0, n) rep(u, 0, n) rep(v, 0, n) ckmin(d[u][v], d[u][w] + d[w][v]);
 
	int s = 0, t = n - 1;
	fill(vis, vis + n, 0); dfs(s, t);
	fill(vis, vis + n, 0); dfs(t, s);
 
	ll ans = d[s][t] + d[t][s];
	rep(e, 0, m) {
		if (!onPath[e]) {
			ll to = min(d[s][t], d[s][b[e]] + w[e] + d[a[e]][t]);
			ll fr = min(d[t][s], d[t][b[e]] + w[e] + d[a[e]][s]);
			ckmin(ans, c[e] + to + fr);
		} else {
			g[a[e]].erase(find(all(g[a[e]]), e));
			swap(a[e], b[e]);
			g[a[e]].push_back(e);
			ckmin(ans, c[e] + dij(s, t) + dij(t, s));
			g[a[e]].pop_back();
			swap(a[e], b[e]);
			g[a[e]].push_back(e);
		}
	}
 
	cout << (ans < inf ? ans : -1);
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 1280 KB Output is correct
2 Correct 12 ms 1184 KB Output is correct
3 Correct 14 ms 1280 KB Output is correct
4 Correct 15 ms 1280 KB Output is correct
5 Correct 1 ms 504 KB Output is correct
6 Correct 10 ms 1188 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 64 ms 1296 KB Output is correct
11 Correct 82 ms 1280 KB Output is correct
12 Correct 76 ms 1408 KB Output is correct
13 Correct 11 ms 1280 KB Output is correct
14 Correct 13 ms 1280 KB Output is correct
15 Correct 12 ms 1280 KB Output is correct
16 Correct 13 ms 1280 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 3328 KB Output is correct
2 Correct 38 ms 3320 KB Output is correct
3 Correct 39 ms 3448 KB Output is correct
4 Correct 13 ms 1280 KB Output is correct
5 Correct 14 ms 1280 KB Output is correct
6 Correct 13 ms 1152 KB Output is correct
7 Correct 10 ms 1152 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 35 ms 3456 KB Output is correct
10 Correct 35 ms 3448 KB Output is correct
11 Correct 37 ms 3456 KB Output is correct
12 Correct 36 ms 3448 KB Output is correct
13 Correct 36 ms 3516 KB Output is correct
14 Correct 35 ms 3448 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 1280 KB Output is correct
2 Correct 11 ms 1152 KB Output is correct
3 Correct 75 ms 2808 KB Output is correct
4 Correct 10 ms 1152 KB Output is correct
5 Correct 110 ms 3200 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 32 ms 3200 KB Output is correct
9 Correct 30 ms 3200 KB Output is correct
10 Correct 67 ms 3192 KB Output is correct
11 Correct 69 ms 3320 KB Output is correct
12 Correct 67 ms 3192 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 396 KB Output is correct
19 Correct 99 ms 3304 KB Output is correct
20 Correct 78 ms 3200 KB Output is correct
21 Correct 84 ms 3200 KB Output is correct
22 Correct 71 ms 3196 KB Output is correct

Subtask #4
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 1280 KB Output is correct
2 Correct 12 ms 1184 KB Output is correct
3 Correct 14 ms 1280 KB Output is correct
4 Correct 15 ms 1280 KB Output is correct
5 Correct 1 ms 504 KB Output is correct
6 Correct 10 ms 1188 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 64 ms 1296 KB Output is correct
11 Correct 82 ms 1280 KB Output is correct
12 Correct 76 ms 1408 KB Output is correct
13 Correct 11 ms 1280 KB Output is correct
14 Correct 13 ms 1280 KB Output is correct
15 Correct 12 ms 1280 KB Output is correct
16 Correct 13 ms 1280 KB Output is correct
17 Correct 38 ms 3328 KB Output is correct
18 Correct 38 ms 3320 KB Output is correct
19 Correct 39 ms 3448 KB Output is correct
20 Correct 13 ms 1280 KB Output is correct
21 Correct 14 ms 1280 KB Output is correct
22 Correct 13 ms 1152 KB Output is correct
23 Correct 10 ms 1152 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 35 ms 3456 KB Output is correct
26 Correct 35 ms 3448 KB Output is correct
27 Correct 37 ms 3456 KB Output is correct
28 Correct 36 ms 3448 KB Output is correct
29 Correct 36 ms 3516 KB Output is correct
30 Correct 35 ms 3448 KB Output is correct
31 Correct 27 ms 1280 KB Output is correct
32 Correct 11 ms 1152 KB Output is correct
33 Correct 75 ms 2808 KB Output is correct
34 Correct 10 ms 1152 KB Output is correct
35 Correct 110 ms 3200 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 0 ms 384 KB Output is correct
38 Correct 32 ms 3200 KB Output is correct
39 Correct 30 ms 3200 KB Output is correct
40 Correct 67 ms 3192 KB Output is correct
41 Correct 69 ms 3320 KB Output is correct
42 Correct 67 ms 3192 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 1 ms 384 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 1 ms 396 KB Output is correct
49 Correct 99 ms 3304 KB Output is correct
50 Correct 78 ms 3200 KB Output is correct
51 Correct 84 ms 3200 KB Output is correct
52 Correct 71 ms 3196 KB Output is correct
53 Correct 37 ms 3320 KB Output is correct
54 Correct 40 ms 3320 KB Output is correct
55 Correct 39 ms 3320 KB Output is correct
56 Correct 14 ms 1280 KB Output is correct
57 Correct 13 ms 1280 KB Output is correct
58 Correct 125 ms 2980 KB Output is correct
59 Correct 137 ms 2944 KB Output is correct
60 Correct 174 ms 2936 KB Output is correct
61 Correct 130 ms 2968 KB Output is correct
62 Correct 149 ms 3064 KB Output is correct
63 Correct 185 ms 3064 KB Output is correct
64 Correct 207 ms 2976 KB Output is correct
65 Correct 242 ms 3100 KB Output is correct
66 Correct 278 ms 3064 KB Output is correct
67 Correct 16 ms 2168 KB Output is correct
68 Correct 33 ms 3448 KB Output is correct
69 Correct 37 ms 3456 KB Output is correct
70 Correct 41 ms 3448 KB Output is correct
71 Correct 36 ms 3456 KB Output is correct
72 Correct 40 ms 3456 KB Output is correct
73 Correct 40 ms 3516 KB Output is correct
74 Correct 45 ms 3448 KB Output is correct