oj.uz

Submission #336546

# Submission time Handle Problem Language Result Execution time Memory
336546 2020-12-15T15:28:48 Z Galebickosikasa Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 848 ms 30680 KB 
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx")
// #pragma comment(linker, "/stack:200000000"]
 
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <bitset>
#include <stack>
#include <random>
#include <fstream>
#include <sstream>
#include <chrono>

#define fi first
#define se second
#define pb push_back
#define ll long long
#define ld long double
#define hm unordered_map 
#define pii pair<int, int>
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define cinv(v) for (auto& x: v) cin >> x
#define fr(i, n) for (int i = 0; i < n; ++i)
#define fl(i, l, n) for (int i = l; i < n; ++i)

#define int ll

template <typename T1, typename T2> inline bool chkmin(T1 &x, const T2 &y) {if (x > y) {x = y; return 1;} return 0;}
template <typename T1, typename T2> inline bool chkmax(T1 &x, const T2 &y) {if (x < y) {x = y; return 1;} return 0;}

using namespace std;

#ifdef LOCAL
	#define dbg(x) cerr << #x << " : " << x << '\n'
	const int maxn = 20;
#else 
	#define dbg(x)
	const int maxn = 1e5 + 20;
#endif

//tg: @galebickosikasa
 
ostream& operator << (ostream& out, const pii& v) {
	out << v.fi << ", " << v.se;
	return out;
}

template<typename T> ostream& operator << (ostream& out, const vector<T>& v) {
    for (auto& x: v) out << x << " ";
    return out;
}

istream& operator >> (istream& in, pii& a) {
	in >> a.fi >> a.se;
	return in;
}

const ll inf = (ll) 1e18;
const ld pi = asin (1) * 2;
const ld eps = 1e-8;
const ll mod = (ll)1e9 + 7;
const ll ns = 97;

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

vector<pii> g[maxn];
vector<int> G[maxn];
int dp[maxn], used[maxn];

vector<int> Dijkstra (int s, int n) {
	vector<int> d (n, inf);
	d[s] = 0;
	set <pii> a;
	a.insert ({0, s});
	while (!a.empty ()) {
		int v = a.begin ()->se;
		a.erase (a.begin ());
		for (auto& u: g[v]) {
			if (d[u.fi] > d[v] + u.se) {
				a.erase ({d[u.fi], u.fi});
				d[u.fi] = d[v] + u.se;
				a.insert ({d[u.fi], u.fi});
			}
		}
	}
	return d;
}

void calc (int v, vector<int>& d) {
	used[v] = 1;
	dp[v] = d[v];
	for (auto& u: G[v]) {
		if (!used[u]) calc (u, d);
		chkmin (dp[v], dp[u]);
	}
}

signed main () {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int n, m;
	cin >> n >> m;
	int s, t;
	cin >> s >> t;
	--s, --t;
	int u, v;
	cin >> u >> v;
	--u, --v;
	for (int i = 0; i < m; ++i) {
		int a, b, c;
		cin >> a >> b >> c;
		--a, --b;
		g[a].pb ({b, c});
		g[b].pb ({a, c});
	}
	auto d = Dijkstra (s, n);
	vector<int> kek;
	queue<int> a;
	a.push (t);
	while (!a.empty ()) {
		int v = a.front ();
		kek.pb (v);
		a.pop ();
		for (auto& u: g[v]) {
			if (d[u.fi] + u.se == d[v]) {
				G[v].pb (u.fi);
				if (!used[u.fi]) {
					a.push (u.fi);
					used[u.fi] = 1;
				}
			}
		}
	}
	for (auto& x: kek) {
		dbg (x + 1);
		for (auto& ch: G[x]) {
			dbg (ch + 1);
		}
	}
	int ans = 1e18;
	{
		for (auto& x: used) x = 0;
		d = Dijkstra (u, n);
		chkmin (ans, d[v]);
		dbg (ans);
		for (auto& x: kek) {
			if (!used[x]) calc (x, d);
			dbg (x + 1);
			dbg (dp[x]);
		}
		d = Dijkstra (v, n);
		for (auto& x: kek) {
			chkmin (ans, d[x] + dp[x]);
			dbg (x + 1);
			dbg (ans);
		}
	}
	{
		swap (v, u);
		for (auto& x: used) x = 0;
		d = Dijkstra (u, n);
		chkmin (ans, d[v]);
		// dbg (ans);
		for (auto& x: kek) {
			if (!used[x]) calc (x, d);
			// dbg (x + 1);
			// dbg (dp[x]);
		}
		d = Dijkstra (v, n);
		for (auto& x: kek) {
			chkmin (ans, d[x] + dp[x]);
			// dbg (x + 1);
			// dbg (ans);
		}
	}
	cout << ans << '\n';






}

Compilation message

commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:146:14: warning: unused variable 'ch' [-Wunused-variable]
  146 |   for (auto& ch: G[x]) {
      |              ^~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 783 ms 24900 KB Output is correct
2 Correct 670 ms 25120 KB Output is correct
3 Correct 639 ms 30680 KB Output is correct
4 Correct 756 ms 24924 KB Output is correct
5 Correct 605 ms 26056 KB Output is correct
6 Correct 840 ms 24684 KB Output is correct
7 Correct 637 ms 26184 KB Output is correct
8 Correct 648 ms 26204 KB Output is correct
9 Correct 664 ms 24520 KB Output is correct
10 Correct 474 ms 24520 KB Output is correct
11 Correct 214 ms 19420 KB Output is correct
12 Correct 674 ms 23900 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 691 ms 27080 KB Output is correct
2 Correct 694 ms 26864 KB Output is correct
3 Correct 673 ms 26204 KB Output is correct
4 Correct 687 ms 26716 KB Output is correct
5 Correct 697 ms 27484 KB Output is correct
6 Correct 621 ms 30024 KB Output is correct
7 Correct 663 ms 30172 KB Output is correct
8 Correct 700 ms 26716 KB Output is correct
9 Correct 670 ms 27484 KB Output is correct
10 Correct 681 ms 26340 KB Output is correct
11 Correct 217 ms 21588 KB Output is correct
12 Correct 606 ms 30556 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 7532 KB Output is correct
2 Correct 5 ms 5868 KB Output is correct
3 Correct 5 ms 5868 KB Output is correct
4 Correct 20 ms 9324 KB Output is correct
5 Correct 14 ms 7532 KB Output is correct
6 Correct 5 ms 5996 KB Output is correct
7 Correct 6 ms 5996 KB Output is correct
8 Correct 7 ms 6124 KB Output is correct
9 Correct 5 ms 5996 KB Output is correct
10 Correct 13 ms 7532 KB Output is correct
11 Correct 5 ms 5868 KB Output is correct
12 Correct 4 ms 5868 KB Output is correct
13 Correct 4 ms 5868 KB Output is correct
14 Correct 5 ms 5868 KB Output is correct
15 Correct 5 ms 5868 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 783 ms 24900 KB Output is correct
2 Correct 670 ms 25120 KB Output is correct
3 Correct 639 ms 30680 KB Output is correct
4 Correct 756 ms 24924 KB Output is correct
5 Correct 605 ms 26056 KB Output is correct
6 Correct 840 ms 24684 KB Output is correct
7 Correct 637 ms 26184 KB Output is correct
8 Correct 648 ms 26204 KB Output is correct
9 Correct 664 ms 24520 KB Output is correct
10 Correct 474 ms 24520 KB Output is correct
11 Correct 214 ms 19420 KB Output is correct
12 Correct 674 ms 23900 KB Output is correct
13 Correct 691 ms 27080 KB Output is correct
14 Correct 694 ms 26864 KB Output is correct
15 Correct 673 ms 26204 KB Output is correct
16 Correct 687 ms 26716 KB Output is correct
17 Correct 697 ms 27484 KB Output is correct
18 Correct 621 ms 30024 KB Output is correct
19 Correct 663 ms 30172 KB Output is correct
20 Correct 700 ms 26716 KB Output is correct
21 Correct 670 ms 27484 KB Output is correct
22 Correct 681 ms 26340 KB Output is correct
23 Correct 217 ms 21588 KB Output is correct
24 Correct 606 ms 30556 KB Output is correct
25 Correct 13 ms 7532 KB Output is correct
26 Correct 5 ms 5868 KB Output is correct
27 Correct 5 ms 5868 KB Output is correct
28 Correct 20 ms 9324 KB Output is correct
29 Correct 14 ms 7532 KB Output is correct
30 Correct 5 ms 5996 KB Output is correct
31 Correct 6 ms 5996 KB Output is correct
32 Correct 7 ms 6124 KB Output is correct
33 Correct 5 ms 5996 KB Output is correct
34 Correct 13 ms 7532 KB Output is correct
35 Correct 5 ms 5868 KB Output is correct
36 Correct 4 ms 5868 KB Output is correct
37 Correct 4 ms 5868 KB Output is correct
38 Correct 5 ms 5868 KB Output is correct
39 Correct 5 ms 5868 KB Output is correct
40 Correct 848 ms 27100 KB Output is correct
41 Correct 693 ms 24412 KB Output is correct
42 Correct 680 ms 24392 KB Output is correct
43 Correct 244 ms 22352 KB Output is correct
44 Correct 237 ms 22224 KB Output is correct
45 Correct 566 ms 27848 KB Output is correct
46 Correct 566 ms 27596 KB Output is correct
47 Correct 740 ms 24904 KB Output is correct
48 Correct 254 ms 19792 KB Output is correct
49 Correct 576 ms 26800 KB Output is correct
50 Correct 598 ms 26844 KB Output is correct
51 Correct 545 ms 27868 KB Output is correct