oj.uz

답안 #331584

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
331584 2020-11-29T03:21:18 Z syy Olympic Bus (JOI20_ho_t4) C++17
100 / 100
 635 ms 7276 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define FOR(i, a, b) for(ll i = (ll)a; i <= (ll)b; i++)
#define DEC(i, a, b) for(ll i = (ll)a; i >= (ll)b; i--)
typedef pair<ll, ll> pi;
typedef pair<pi, ll> pii;
typedef pair<ll, pi> ipi;
typedef pair<pi, pi> pipi;
#define f first
#define s second
typedef vector<ll> vi;
typedef vector<pi> vpi;
typedef vector<pii> vpii;
#define pb push_back
#define pf push_front
#define all(v) v.begin(), v.end()
#define size(v) (ll) v.size()
#define disc(v) sort(all(v)); v.resize(unique(all(v)) - v.begin());
#define INF (ll) 1e9 + 100
#define LLINF (ll) 1e15
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define sandybridge __attribute__((optimize("Ofast"), target("arch=sandybridge")))
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());    //can be used by calling rng() or shuffle(A, A+n, rng)
inline ll rand(ll x, ll y) { ++y; return (rng() % (y-x)) + x; } //inclusivesss

ll n, m, a, b, c, d, dist[2][205], ndist[2][205], rdist[2][205], ans, path[2][205];
pipi edge[50005];
vpii adj[205], radj[205];
priority_queue<pi, vpi, greater<pi>> pq;

void setpath() {
	FOR(i, 1, n) dist[0][i] = LLINF;
	dist[0][1] = 0;
	pq.push(pi(0, 1));
	while (!pq.empty()) {
		auto [d, x] = pq.top(); pq.pop();
		if (d > dist[0][x]) continue;
		for (auto [t, idx]:adj[x]) {
			auto [it, nd] = t;
			if (dist[0][it] > d + nd) {
				dist[0][it] = d + nd;
				path[0][it] = idx;
				pq.push(pi(d + nd, it));
			}
		}
	}
	
	FOR(i, 1, n) dist[1][i] = LLINF;
	dist[1][n] = 0;
	pq.push(pi(0, n));
	while (!pq.empty()) {
		auto [d, x] = pq.top(); pq.pop();
		if (d > dist[1][x]) continue;
		for (auto [t, idx]:adj[x]) {
			auto [it, nd] = t;
			if (dist[1][it] > d + nd) {
				dist[1][it] = d + nd;
				path[1][it] = idx;
				pq.push(pi(d + nd, it));
			}
		}
	}
}

void rev() {
	FOR(i, 1, n) rdist[0][i] = LLINF;
	rdist[0][1] = 0;
	pq.push(pi(0, 1));
	while (!pq.empty()) {
		auto [d, x] = pq.top(); pq.pop();
		if (d > rdist[0][x]) continue;
		for (auto [t, idx]:radj[x]) {
			auto [it, nd] = t;
			if (rdist[0][it] > d + nd) {
				rdist[0][it] = d + nd;
				pq.push(pi(d + nd, it));
			}
		}
	}
	
	FOR(i, 1, n) rdist[1][i] = LLINF;
	rdist[1][n] = 0;
	pq.push(pi(0, n));
	while (!pq.empty()) {
		auto [d, x] = pq.top(); pq.pop();
		if (d > rdist[1][x]) continue;
		for (auto [t, idx]:radj[x]) {
			auto [it, nd] = t;
			if (rdist[1][it] > d + nd) {
				rdist[1][it] = d + nd;
				pq.push(pi(d + nd, it));
			}
		}
	}
}

void dijkstra(bool b, ll flip) {
	FOR(i, 1, n) ndist[b][i] = LLINF;
	dist[b][(b ? n : 1)] = 0;
	pq.push(pi(0, (b ? n : 1)));
	while (!pq.empty()) {
		auto [d, x] = pq.top(); pq.pop();
		if (d > ndist[b][x]) continue;
		for (auto [t, idx]:adj[x]) {
			auto [it, nd] = t;
			if (idx == flip) continue;
			if (ndist[b][it] > d + nd) {
				ndist[b][it] = d + nd;
				pq.push(pi(d + nd, it));
			}
		}
		if (x == edge[flip].f.s) {
			ll it = edge[flip].f.f, nd = edge[flip].s.f;
			if (ndist[b][it] > d + nd) {
				ndist[b][it] = d + nd;
				pq.push(pi(d + nd, it));
			}
		}
	}
}

int main() {
	fastio; cin >> n >> m;
	FOR(i, 1, m) {
		cin >> a >> b >> c >> d;
		adj[a].pb(pii(pi(b, c), i));
		radj[b].pb(pii(pi(a, c), i));
		edge[i] = pipi(pi(a, b), pi(c, d));
	}
	setpath(); rev();
	ans = dist[0][n] + dist[1][1];
	FOR(i, 1, m) {
		auto [t, tt] = edge[i];
		auto [a, b] = t;
		auto [c, d] = tt;
		ll res = d;
		if (path[0][b] == i) {
			dijkstra(0, i);
			res += ndist[0][n];
		} else res += min(dist[0][n], dist[0][b] + c + rdist[1][a]);
		if (path[1][b] == i) {
			dijkstra(1, i);
			res += ndist[1][1];
		} else res += min(dist[1][1], dist[1][b] + c + rdist[0][a]);
		ans = min(ans, res);
	}
	cout << (ans >= LLINF ? -1 : ans);
}

Subtask #1
5.0 / 5.0

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

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 81 ms 5740 KB Output is correct
2 Correct 83 ms 7020 KB Output is correct
3 Correct 86 ms 7020 KB Output is correct
4 Correct 11 ms 620 KB Output is correct
5 Correct 5 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 36 ms 6892 KB Output is correct
10 Correct 38 ms 6892 KB Output is correct
11 Correct 64 ms 6764 KB Output is correct
12 Correct 60 ms 6636 KB Output is correct
13 Correct 59 ms 7020 KB Output is correct
14 Correct 59 ms 7276 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 492 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 46 ms 4972 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 57 ms 6252 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 29 ms 6252 KB Output is correct
9 Correct 31 ms 6656 KB Output is correct
10 Correct 43 ms 6508 KB Output is correct
11 Correct 42 ms 6764 KB Output is correct
12 Correct 53 ms 6892 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 45 ms 6892 KB Output is correct
20 Correct 44 ms 6892 KB Output is correct
21 Correct 56 ms 6764 KB Output is correct
22 Correct 44 ms 6380 KB Output is correct

Subtask #4
63.0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 492 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 11 ms 492 KB Output is correct
4 Correct 12 ms 492 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 16 ms 492 KB Output is correct
11 Correct 15 ms 492 KB Output is correct
12 Correct 16 ms 492 KB Output is correct
13 Correct 3 ms 492 KB Output is correct
14 Correct 7 ms 492 KB Output is correct
15 Correct 6 ms 492 KB Output is correct
16 Correct 7 ms 492 KB Output is correct
17 Correct 81 ms 5740 KB Output is correct
18 Correct 83 ms 7020 KB Output is correct
19 Correct 86 ms 7020 KB Output is correct
20 Correct 11 ms 620 KB Output is correct
21 Correct 5 ms 492 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 36 ms 6892 KB Output is correct
26 Correct 38 ms 6892 KB Output is correct
27 Correct 64 ms 6764 KB Output is correct
28 Correct 60 ms 6636 KB Output is correct
29 Correct 59 ms 7020 KB Output is correct
30 Correct 59 ms 7276 KB Output is correct
31 Correct 8 ms 492 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 46 ms 4972 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 57 ms 6252 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 29 ms 6252 KB Output is correct
39 Correct 31 ms 6656 KB Output is correct
40 Correct 43 ms 6508 KB Output is correct
41 Correct 42 ms 6764 KB Output is correct
42 Correct 53 ms 6892 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 45 ms 6892 KB Output is correct
50 Correct 44 ms 6892 KB Output is correct
51 Correct 56 ms 6764 KB Output is correct
52 Correct 44 ms 6380 KB Output is correct
53 Correct 96 ms 6636 KB Output is correct
54 Correct 95 ms 6380 KB Output is correct
55 Correct 91 ms 6764 KB Output is correct
56 Correct 12 ms 492 KB Output is correct
57 Correct 12 ms 492 KB Output is correct
58 Correct 81 ms 5228 KB Output is correct
59 Correct 83 ms 5228 KB Output is correct
60 Correct 88 ms 5356 KB Output is correct
61 Correct 77 ms 5356 KB Output is correct
62 Correct 83 ms 5228 KB Output is correct
63 Correct 86 ms 5356 KB Output is correct
64 Correct 635 ms 5868 KB Output is correct
65 Correct 590 ms 5868 KB Output is correct
66 Correct 558 ms 5868 KB Output is correct
67 Correct 20 ms 4700 KB Output is correct
68 Correct 38 ms 6892 KB Output is correct
69 Correct 36 ms 6892 KB Output is correct
70 Correct 65 ms 6636 KB Output is correct
71 Correct 64 ms 7148 KB Output is correct
72 Correct 68 ms 6968 KB Output is correct
73 Correct 72 ms 6764 KB Output is correct
74 Correct 65 ms 7020 KB Output is correct