Submission #340042

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
340042	2020-12-26T16:06:25 Z	sinamhdv	Commuter Pass (JOI18_commuter_pass)	C++11	100 / 100	470 ms	24024 KB

commuter_pass

// https://oj.uz/problem/view/JOI18_commuter_pass
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int mod = 1000 * 1000 * 1000 + 7;
const int INF = 1000 * 1000 * 1000;
const ll LINF = (ll)INF * INF;

#ifdef DEBUG
#define dbg(x) cout << #x << " = " << (x) << endl << flush;
#define dbgr(s, f) { cout << #s << ": "; for (auto _ = (s); _ != (f); _++) cout << *_ << ' '; cout << endl << flush; }
#else
#define dbg(x) ;
#define dbgr(s, f) ;
#endif
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define fast_io ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define msub(a, b) ((mod + ((a) - (b)) % mod) % mod)
#define mdiv(a, b) ((a) * poww((b), mod - 2) % mod)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define endl '\n'

#define MAXN 200100
#define MAXM 200100

int n, m, s, t, u, v;
vector<int> adj[MAXN];
int efrom[MAXM], eto[MAXM], ew[MAXM];
ll sdist[MAXN], vdist[MAXN], udist[MAXN];
int ver[MAXN];
ll dp[MAXN];
ll udp[MAXN], vdp[MAXN];

priority_queue<pll, vector<pll>, greater<pll>> pq;

inline void dij(int r, ll dist[MAXN])
{
	fill(dist, dist + n + 10, LINF);
	dist[r] = 0;
	FOR(i, 1, n + 1)
	{
		pq.push(mp(dist[i], i));
	}
	while (!pq.empty())
	{
		pll p = pq.top();
		pq.pop();
		int v = p.sc;
		if (p.fr != dist[v])
		{
			continue;
		}
		for (int e : adj[v])
		{
			int u = efrom[e] ^ eto[e] ^ v;
			ll nw = dist[v] + ew[e];
			if (nw < dist[u])
			{
				dist[u] = nw;
				pq.push(mp(dist[u], u));
			}
		}
	}
}

bool cmp(int a, int b)
{
	return sdist[a] < sdist[b];
}

int32_t main(void)
{
	scanf("%d%d%d%d%d%d", &n, &m, &s, &t, &u, &v);
	FOR(i, 0, m)
	{
		int x, y, w;
		scanf("%d%d%d", &x, &y, &w);
		adj[x].pb(i);
		adj[y].pb(i);
		efrom[i] = x;
		eto[i] = y;
		ew[i] = w;
	}
	
	dij(s, sdist);
	dij(u, udist);
	dij(v, vdist);

	iota(ver + 1, ver + n + 1, 1);
	sort(ver + 1, ver + n + 1, cmp);

	FOR(i, 1, n + 1)
	{
		int x = ver[i];
		udp[x] = udist[x];
		vdp[x] = vdist[x];
		dp[x] = vdist[x] + udist[x];
		for (int e : adj[x])
		{
			int y = efrom[e] ^ eto[e] ^ x;
			if (sdist[y] + ew[e] == sdist[x])
			{
				udp[x] = min(udp[x], udp[y]);
				vdp[x] = min(vdp[x], vdp[y]);
				dp[x] = min(dp[x], dp[y]);
				dp[x] = min(dp[x], min(udp[y] + vdist[x], vdp[y] + udist[x]));
			}
		}
	}

	ll ans = udist[v];
	ans = min(ans, dp[t]);

	printf("%lld\n", ans);
	return 0;
}

Compilation message

commuter_pass.cpp: In function 'int32_t main()':
commuter_pass.cpp:80:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   80 |  scanf("%d%d%d%d%d%d", &n, &m, &s, &t, &u, &v);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
commuter_pass.cpp:84:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   84 |   scanf("%d%d%d", &x, &y, &w);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1

16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	437 ms	23296 KB	Output is correct
2	Correct	431 ms	22996 KB	Output is correct
3	Correct	433 ms	22740 KB	Output is correct
4	Correct	461 ms	23332 KB	Output is correct
5	Correct	410 ms	22612 KB	Output is correct
6	Correct	470 ms	23384 KB	Output is correct
7	Correct	434 ms	22740 KB	Output is correct
8	Correct	427 ms	22868 KB	Output is correct
9	Correct	435 ms	23508 KB	Output is correct
10	Correct	387 ms	23532 KB	Output is correct
11	Correct	233 ms	18148 KB	Output is correct
12	Correct	423 ms	23380 KB	Output is correct

Subtask #2

15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	459 ms	23128 KB	Output is correct
2	Correct	437 ms	22744 KB	Output is correct
3	Correct	438 ms	22744 KB	Output is correct
4	Correct	450 ms	22620 KB	Output is correct
5	Correct	432 ms	22744 KB	Output is correct
6	Correct	419 ms	22868 KB	Output is correct
7	Correct	457 ms	22996 KB	Output is correct
8	Correct	448 ms	22872 KB	Output is correct
9	Correct	442 ms	22616 KB	Output is correct
10	Correct	439 ms	22744 KB	Output is correct
11	Correct	250 ms	18276 KB	Output is correct
12	Correct	424 ms	22740 KB	Output is correct

Subtask #3

24.0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	13 ms	6124 KB	Output is correct
2	Correct	4 ms	5100 KB	Output is correct
3	Correct	4 ms	5100 KB	Output is correct
4	Correct	21 ms	7148 KB	Output is correct
5	Correct	12 ms	6124 KB	Output is correct
6	Correct	4 ms	5228 KB	Output is correct
7	Correct	5 ms	5228 KB	Output is correct
8	Correct	6 ms	5228 KB	Output is correct
9	Correct	5 ms	5228 KB	Output is correct
10	Correct	12 ms	6124 KB	Output is correct
11	Correct	4 ms	5100 KB	Output is correct
12	Correct	4 ms	5100 KB	Output is correct
13	Correct	4 ms	5100 KB	Output is correct
14	Correct	4 ms	5100 KB	Output is correct
15	Correct	4 ms	5228 KB	Output is correct

Subtask #4

45.0 / 45.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	437 ms	23296 KB	Output is correct
2	Correct	431 ms	22996 KB	Output is correct
3	Correct	433 ms	22740 KB	Output is correct
4	Correct	461 ms	23332 KB	Output is correct
5	Correct	410 ms	22612 KB	Output is correct
6	Correct	470 ms	23384 KB	Output is correct
7	Correct	434 ms	22740 KB	Output is correct
8	Correct	427 ms	22868 KB	Output is correct
9	Correct	435 ms	23508 KB	Output is correct
10	Correct	387 ms	23532 KB	Output is correct
11	Correct	233 ms	18148 KB	Output is correct
12	Correct	423 ms	23380 KB	Output is correct
13	Correct	459 ms	23128 KB	Output is correct
14	Correct	437 ms	22744 KB	Output is correct
15	Correct	438 ms	22744 KB	Output is correct
16	Correct	450 ms	22620 KB	Output is correct
17	Correct	432 ms	22744 KB	Output is correct
18	Correct	419 ms	22868 KB	Output is correct
19	Correct	457 ms	22996 KB	Output is correct
20	Correct	448 ms	22872 KB	Output is correct
21	Correct	442 ms	22616 KB	Output is correct
22	Correct	439 ms	22744 KB	Output is correct
23	Correct	250 ms	18276 KB	Output is correct
24	Correct	424 ms	22740 KB	Output is correct
25	Correct	13 ms	6124 KB	Output is correct
26	Correct	4 ms	5100 KB	Output is correct
27	Correct	4 ms	5100 KB	Output is correct
28	Correct	21 ms	7148 KB	Output is correct
29	Correct	12 ms	6124 KB	Output is correct
30	Correct	4 ms	5228 KB	Output is correct
31	Correct	5 ms	5228 KB	Output is correct
32	Correct	6 ms	5228 KB	Output is correct
33	Correct	5 ms	5228 KB	Output is correct
34	Correct	12 ms	6124 KB	Output is correct
35	Correct	4 ms	5100 KB	Output is correct
36	Correct	4 ms	5100 KB	Output is correct
37	Correct	4 ms	5100 KB	Output is correct
38	Correct	4 ms	5100 KB	Output is correct
39	Correct	4 ms	5228 KB	Output is correct
40	Correct	435 ms	24024 KB	Output is correct
41	Correct	447 ms	23512 KB	Output is correct
42	Correct	439 ms	23384 KB	Output is correct
43	Correct	241 ms	18404 KB	Output is correct
44	Correct	240 ms	18276 KB	Output is correct
45	Correct	403 ms	22356 KB	Output is correct
46	Correct	394 ms	22228 KB	Output is correct
47	Correct	463 ms	23260 KB	Output is correct
48	Correct	227 ms	17636 KB	Output is correct
49	Correct	389 ms	23508 KB	Output is correct
50	Correct	400 ms	22484 KB	Output is correct
51	Correct	394 ms	22356 KB	Output is correct