Submission #361252

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
361252	2021-01-28T23:57:51 Z	HoneyBadger	Olympic Bus (JOI20_ho_t4)	C++17	100 / 100	332 ms	8048 KB

ho_t4

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <bitset>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#include <algorithm>
#include <random>
#include <cmath>
#include <cassert>
#include <climits>
#include <ctime>
#include <chrono>


/*
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,tune=native")
*/


#ifdef LOCAL
    #define dbg(x) cout << #x << " : " << x << endl;
#else
    #define dbg(x)
#endif

#define int long long
#define pb push_back
#define ppb pop_back()
#define mp make_pair
#define fi(a, b) for (int i = a; i < b; i++)
#define fj(a, b) for (int j = a; j < b; j++)
#define fk(a, b) for (int k = a; k < b; k++)
#define fi1(a, b) for (int i = a - 1; i >= b; i--)
#define fj1(a, b) for (int j = a - 1; j >= b; j--)
#define fk1(a, b) for (int k = a - 1; k >= b; k--)
#define fx(x, a) for (auto& x : a)
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define rep1(i, a, b) for (int i = a - 1; i >= b; --i)
#define siz(x) (int)x.size()
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

using namespace std;

template<typename T1, typename T2>inline void mine(T1 &x, const T2 &y) { if (y < x) x = y; }
template<typename T1, typename T2>inline void maxe(T1 &x, const T2 &y) { if (x < y) x = y; }

ostream& operator << (ostream &out, const vector<int> &b) {
    for (auto k : b) out << k << ' ';
    return out;
}

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef char ch;
typedef string str;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
typedef vector<ch> vch;
typedef vector<vch> vvch;
typedef vector<str> vs;



const int MOD = 1000000007;
const int INF = 1000000050;
const long long BIG = (long long)2e18 + 50;
const int MX = 200010;
const double EPS = 1e-9;


mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, m;
int c[MX];
int from[MX];
int to[MX];

vi bandij(int s, int ban, const vvi &g) {
	vi dist(n, BIG);
	vch used(n, 0);
	dist[s] = 0;
	for (int i = 0; i < n - 1; ++i) {
		int v = -1;
		for (int j = 0; j < n; ++j) {
			if (!used[j] && (v == -1 || dist[j] < dist[v])) {
				v = j;
			}
		}
		if (dist[v] == BIG) break;
		fx(id, g[v]) {
			if (id == ban) continue;
			mine(dist[to[id]], dist[v] + c[id]);	
		}
		used[v] = 1;
	}
	return dist;
}

pair<vvi, vi> dij(int s, const vvi & g) {
	vi dist(n, BIG);
	vch used(n, 0);
	vvpii gb(n);
	dist[s] = 0;
	for (int i = 0; i < n - 1; ++i) {
		int v = -1;
		for (int j = 0; j < n; ++j) {
			if (!used[j] && (v == -1 || dist[j] < dist[v])) {
				v = j;
			}
		}
		if (dist[v] == BIG) break;
		fx(id, g[v]) {
			if (dist[to[id]] > dist[v] + c[id]) {
				gb[to[id]].clear();
				dist[to[id]] = dist[v] + c[id];
			}
			if (dist[to[id]] == dist[v] + c[id])
				gb[to[id]].pb({from[id], id});
		}
		used[v] = 1;
	}
	vvpii gb2(n);
	for (int i = 0; i < n; ++i) {
		used[i] = 0;
		for (auto[x, id] : gb[i]) {
			gb2[x].pb({i, id});
		}
	}
	swap(gb2, gb);
	vi ord;
	function<void(int)> dfs = [&](int v) {
		used[v] = 1;
		for (auto[x, id] : gb[v]) {
			if (!used[x]) {
				dfs(x);
			}
		}
		ord.pb(v);
	};	
	dfs(s);
	reverse(all(ord));
	vector<pair<ull, int>> ways(n, {0, 0});
	ways[s] = {1, 1};
	vch was(n, 0);
	fx(v, ord) {
		was[v] = 1;
		ways[v].second %= MOD;
		for (auto[x, id] : gb[v]) {
			if (was[x]) continue;
			ways[x].first += ways[v].first;
			ways[x].second += ways[v].second; 
		}
	}
	vi bridges;
	fx(v, ord) {
		for (auto[to, id] : gb[v]) {
			if (ways[to] == ways[v]) {
				bridges.pb(id);
			}
		}
	}
	sort(all(bridges));
	vvi dists;
	fx(id, bridges) 
		dists.pb(bandij(s, id, g));
	dists.pb(dist);
	fx(x, bridges)
		x %= m;
	return mp(dists, bridges);
}


int d[MX];

int get(vi &bridges, int id) {
	auto it = lb(all(bridges), id);
	if (it == bridges.end() || *it != id)
		return bridges.size();
	return it - bridges.begin();
}

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

   
    cin >> n >> m;
    vvi g(n);
    vvi gc(n);
    for (int i = 0; i < m; ++i) {
    	cin >> from[i] >> to[i] >> c[i] >> d[i];
    	--from[i], --to[i];
    	from[i + m] = to[i];
    	to[i + m] = from[i];
    	c[i + m] = c[i];
    	g[from[i]].pb(i);
    	gc[from[i + m]].pb(i + m);
	}
	const int s = 0;
	const int t = n - 1;
	auto[dsv, bsv] = dij(s, g);
	auto[dvs, bvs] = dij(s, gc);
	auto[dtv, btv] = dij(t, g);
	auto[dvt, bvt] = dij(t, gc);
	/*dbg(bsv);
	dbg(bvs);
	dbg(btv);
	dbg(bvt);*/
	int ans = dsv.back()[t] + dtv.back()[s];
	for (int id = 0; id < m; ++id) {
	
		int u = from[id];
		int v = to[id];
		
		int bid = get(bsv, id);
		int st = dsv[bid][t];
		int sv = dsv[bid][v];
		bid = get(bvs, id);
		int us = dvs[bid][u];
		bid = get(btv, id);
		int ts = dtv[bid][s];
		int tv = dtv[bid][v];
		bid = get(bvt, id);
		int ut = dvt[bid][u];

		int cur = d[id];
		cur += min(st, sv + c[id] + ut);
		cur += min(ts, tv + c[id] + us);
		/*dbg(id);
		dbg(cur);*/
		mine(ans, cur);
	}
	cout << (ans >= BIG ? -1 : ans) << '\n';
}	

Subtask #1

5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	26 ms	1132 KB	Output is correct
2	Correct	4 ms	620 KB	Output is correct
3	Correct	68 ms	2156 KB	Output is correct
4	Correct	70 ms	2156 KB	Output is correct
5	Correct	2 ms	492 KB	Output is correct
6	Correct	8 ms	876 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	73 ms	2156 KB	Output is correct
11	Correct	73 ms	2156 KB	Output is correct
12	Correct	71 ms	2156 KB	Output is correct
13	Correct	21 ms	1388 KB	Output is correct
14	Correct	45 ms	1772 KB	Output is correct
15	Correct	45 ms	1644 KB	Output is correct
16	Correct	46 ms	2028 KB	Output is correct

Subtask #2

11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	24 ms	4716 KB	Output is correct
2	Correct	25 ms	4544 KB	Output is correct
3	Correct	26 ms	4716 KB	Output is correct
4	Correct	2 ms	620 KB	Output is correct
5	Correct	2 ms	492 KB	Output is correct
6	Correct	1 ms	492 KB	Output is correct
7	Correct	1 ms	492 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	27 ms	4588 KB	Output is correct
10	Correct	25 ms	4460 KB	Output is correct
11	Correct	26 ms	4588 KB	Output is correct
12	Correct	25 ms	4588 KB	Output is correct
13	Correct	26 ms	4588 KB	Output is correct
14	Correct	25 ms	4716 KB	Output is correct

Subtask #3

21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	23 ms	1004 KB	Output is correct
2	Correct	13 ms	1024 KB	Output is correct
3	Correct	33 ms	5440 KB	Output is correct
4	Correct	8 ms	876 KB	Output is correct
5	Correct	42 ms	6892 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	5472 KB	Output is correct
9	Correct	30 ms	5524 KB	Output is correct
10	Correct	35 ms	6824 KB	Output is correct
11	Correct	37 ms	7736 KB	Output is correct
12	Correct	42 ms	7856 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	38 ms	8048 KB	Output is correct
20	Correct	36 ms	7744 KB	Output is correct
21	Correct	39 ms	7744 KB	Output is correct
22	Correct	36 ms	7676 KB	Output is correct

Subtask #4

63.0 / 63.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	26 ms	1132 KB	Output is correct
2	Correct	4 ms	620 KB	Output is correct
3	Correct	68 ms	2156 KB	Output is correct
4	Correct	70 ms	2156 KB	Output is correct
5	Correct	2 ms	492 KB	Output is correct
6	Correct	8 ms	876 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	73 ms	2156 KB	Output is correct
11	Correct	73 ms	2156 KB	Output is correct
12	Correct	71 ms	2156 KB	Output is correct
13	Correct	21 ms	1388 KB	Output is correct
14	Correct	45 ms	1772 KB	Output is correct
15	Correct	45 ms	1644 KB	Output is correct
16	Correct	46 ms	2028 KB	Output is correct
17	Correct	24 ms	4716 KB	Output is correct
18	Correct	25 ms	4544 KB	Output is correct
19	Correct	26 ms	4716 KB	Output is correct
20	Correct	2 ms	620 KB	Output is correct
21	Correct	2 ms	492 KB	Output is correct
22	Correct	1 ms	492 KB	Output is correct
23	Correct	1 ms	492 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	27 ms	4588 KB	Output is correct
26	Correct	25 ms	4460 KB	Output is correct
27	Correct	26 ms	4588 KB	Output is correct
28	Correct	25 ms	4588 KB	Output is correct
29	Correct	26 ms	4588 KB	Output is correct
30	Correct	25 ms	4716 KB	Output is correct
31	Correct	23 ms	1004 KB	Output is correct
32	Correct	13 ms	1024 KB	Output is correct
33	Correct	33 ms	5440 KB	Output is correct
34	Correct	8 ms	876 KB	Output is correct
35	Correct	42 ms	6892 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	5472 KB	Output is correct
39	Correct	30 ms	5524 KB	Output is correct
40	Correct	35 ms	6824 KB	Output is correct
41	Correct	37 ms	7736 KB	Output is correct
42	Correct	42 ms	7856 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	38 ms	8048 KB	Output is correct
50	Correct	36 ms	7744 KB	Output is correct
51	Correct	39 ms	7744 KB	Output is correct
52	Correct	36 ms	7676 KB	Output is correct
53	Correct	235 ms	7032 KB	Output is correct
54	Correct	234 ms	7020 KB	Output is correct
55	Correct	237 ms	7020 KB	Output is correct
56	Correct	70 ms	2156 KB	Output is correct
57	Correct	70 ms	2176 KB	Output is correct
58	Correct	200 ms	5940 KB	Output is correct
59	Correct	200 ms	5996 KB	Output is correct
60	Correct	199 ms	6124 KB	Output is correct
61	Correct	197 ms	5996 KB	Output is correct
62	Correct	198 ms	5996 KB	Output is correct
63	Correct	199 ms	5996 KB	Output is correct
64	Correct	332 ms	6252 KB	Output is correct
65	Correct	325 ms	6124 KB	Output is correct
66	Correct	287 ms	6124 KB	Output is correct
67	Correct	18 ms	4192 KB	Output is correct
68	Correct	73 ms	6508 KB	Output is correct
69	Correct	72 ms	6380 KB	Output is correct
70	Correct	160 ms	6892 KB	Output is correct
71	Correct	159 ms	6892 KB	Output is correct
72	Correct	162 ms	6636 KB	Output is correct
73	Correct	160 ms	6764 KB	Output is correct
74	Correct	162 ms	7020 KB	Output is correct