oj.uz

Submission #386529

# Submission time Handle Problem Language Result Execution time Memory
386529 2021-04-06T18:29:14 Z Return_0 Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 621 ms 37868 KB 
#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef pair <ll, ll> pll;

#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
	const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush();
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< (x) << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()

cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;

template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';}
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
	out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;

cl N = 2e5 + 7;

ll diss [N], disv [N], disu [N], dpv [N], dpu [N], n, m, S, T, V, U, ans;
vector <ll> out [N];
vector <pll> adj [N];
set <pll> st;
bool mark [N];

void dijkstra (ll v, ll dis []) {
	memset(dis, 63, sizeof diss);
	dis[v] = 0; st.insert({0, v});
	while (!st.empty()) {
		v = st.begin()->sc;
		st.erase(st.begin());
		for (auto [u, w] : adj[v]) if (dis[u] > dis[v] + w) st.erase({dis[u], u}), dis[u] = dis[v] + w, st.insert({dis[u], u});
	}
}

void dfs (cl &v = T) {
	mark[v] = 1;
	dpv[v] = disv[v];
	dpu[v] = disu[v];
	for (auto &u : out[v]) {
		if (!mark[u]) dfs(u);
		dpv[v] = min(dpv[v], dpv[u]);
		dpu[v] = min(dpu[v], dpu[u]);
	}
	ans = min(ans, disu[v] + dpv[v]);
	ans = min(ans, disv[v] + dpu[v]);
}

int main ()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	cin>> n >> m >> S >> T >> U >> V;
	for (ll i = 0, v, u, w; i < m; i++) {
		cin>> v >> u >> w;
		adj[v].push_back({u, w});
		adj[u].push_back({v, w});
	}

	dijkstra(S, diss);
	dijkstra(V, disv);
	dijkstra(U, disu);
	ans = disv[U];

	for (ll v = 1; v <= n; v++) for(auto [u, w] : adj[v]) if (diss[v] == diss[u] + w) out[v].push_back(u);
	dfs();

	cout<< ans << endl;

	cerr<< "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";

	return 0;
}
/*
6 6
1 6
1 4
1 2 1
2 3 1
3 5 1
2 4 3
4 5 2
5 6 1

6 5
1 2
3 6
1 2 1000000000
2 3 1000000000
3 4 1000000000
4 5 1000000000
5 6 1000000000

8 8
5 7
6 8
1 2 2
2 3 3
3 4 4
1 4 1
1 5 5
2 6 6
3 7 7
4 8 8

5 5
1 5
2 3
1 2 1
2 3 10
2 4 10
3 5 10
4 5 10

10 15
6 8
7 9
2 7 12
8 10 17
1 3 1
3 8 14
5 7 15
2 3 7
1 10 14
3 6 12
1 5 10
8 9 1
2 9 7
1 4 1
1 8 1
2 4 7
5 6 16

*/

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 484 ms 27884 KB Output is correct
2 Correct 432 ms 32516 KB Output is correct
3 Correct 483 ms 37868 KB Output is correct
4 Correct 471 ms 31980 KB Output is correct
5 Correct 413 ms 32724 KB Output is correct
6 Correct 503 ms 31980 KB Output is correct
7 Correct 491 ms 32620 KB Output is correct
8 Correct 436 ms 32748 KB Output is correct
9 Correct 438 ms 31724 KB Output is correct
10 Correct 346 ms 31852 KB Output is correct
11 Correct 188 ms 29548 KB Output is correct
12 Correct 470 ms 31724 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 483 ms 31212 KB Output is correct
2 Correct 482 ms 31468 KB Output is correct
3 Correct 502 ms 30956 KB Output is correct
4 Correct 484 ms 31356 KB Output is correct
5 Correct 485 ms 31852 KB Output is correct
6 Correct 449 ms 33648 KB Output is correct
7 Correct 483 ms 34156 KB Output is correct
8 Correct 498 ms 31468 KB Output is correct
9 Correct 538 ms 31852 KB Output is correct
10 Correct 479 ms 31084 KB Output is correct
11 Correct 163 ms 29036 KB Output is correct
12 Correct 447 ms 34028 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 15852 KB Output is correct
2 Correct 10 ms 14572 KB Output is correct
3 Correct 12 ms 14572 KB Output is correct
4 Correct 27 ms 18028 KB Output is correct
5 Correct 22 ms 16236 KB Output is correct
6 Correct 10 ms 14572 KB Output is correct
7 Correct 11 ms 14572 KB Output is correct
8 Correct 12 ms 14700 KB Output is correct
9 Correct 10 ms 14572 KB Output is correct
10 Correct 18 ms 16236 KB Output is correct
11 Correct 10 ms 14444 KB Output is correct
12 Correct 10 ms 14444 KB Output is correct
13 Correct 10 ms 14572 KB Output is correct
14 Correct 11 ms 14572 KB Output is correct
15 Correct 11 ms 14572 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 484 ms 27884 KB Output is correct
2 Correct 432 ms 32516 KB Output is correct
3 Correct 483 ms 37868 KB Output is correct
4 Correct 471 ms 31980 KB Output is correct
5 Correct 413 ms 32724 KB Output is correct
6 Correct 503 ms 31980 KB Output is correct
7 Correct 491 ms 32620 KB Output is correct
8 Correct 436 ms 32748 KB Output is correct
9 Correct 438 ms 31724 KB Output is correct
10 Correct 346 ms 31852 KB Output is correct
11 Correct 188 ms 29548 KB Output is correct
12 Correct 470 ms 31724 KB Output is correct
13 Correct 483 ms 31212 KB Output is correct
14 Correct 482 ms 31468 KB Output is correct
15 Correct 502 ms 30956 KB Output is correct
16 Correct 484 ms 31356 KB Output is correct
17 Correct 485 ms 31852 KB Output is correct
18 Correct 449 ms 33648 KB Output is correct
19 Correct 483 ms 34156 KB Output is correct
20 Correct 498 ms 31468 KB Output is correct
21 Correct 538 ms 31852 KB Output is correct
22 Correct 479 ms 31084 KB Output is correct
23 Correct 163 ms 29036 KB Output is correct
24 Correct 447 ms 34028 KB Output is correct
25 Correct 17 ms 15852 KB Output is correct
26 Correct 10 ms 14572 KB Output is correct
27 Correct 12 ms 14572 KB Output is correct
28 Correct 27 ms 18028 KB Output is correct
29 Correct 22 ms 16236 KB Output is correct
30 Correct 10 ms 14572 KB Output is correct
31 Correct 11 ms 14572 KB Output is correct
32 Correct 12 ms 14700 KB Output is correct
33 Correct 10 ms 14572 KB Output is correct
34 Correct 18 ms 16236 KB Output is correct
35 Correct 10 ms 14444 KB Output is correct
36 Correct 10 ms 14444 KB Output is correct
37 Correct 10 ms 14572 KB Output is correct
38 Correct 11 ms 14572 KB Output is correct
39 Correct 11 ms 14572 KB Output is correct
40 Correct 621 ms 34512 KB Output is correct
41 Correct 503 ms 31744 KB Output is correct
42 Correct 463 ms 31724 KB Output is correct
43 Correct 183 ms 30188 KB Output is correct
44 Correct 192 ms 30316 KB Output is correct
45 Correct 427 ms 33112 KB Output is correct
46 Correct 384 ms 32680 KB Output is correct
47 Correct 535 ms 32620 KB Output is correct
48 Correct 200 ms 27116 KB Output is correct
49 Correct 473 ms 34012 KB Output is correct
50 Correct 416 ms 32988 KB Output is correct
51 Correct 376 ms 33132 KB Output is correct