oj.uz

Submission #99576

# Submission time Handle Problem Language Result Execution time Memory
99576 2019-03-05T11:06:33 Z psmao Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 887 ms 19204 KB 
#include <bits/stdc++.h>
using namespace std;

#define fo(i,s,t) for(int i = s; i <= t; ++ i)
#define fd(i,s,t) for(int i = s; i >= t; -- i)
#define bf(i,s) for(int i = head[s]; i; i = e[i].next)
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
#define pb push_back
#define VI vector<int>
#define sf scanf
#define pf printf
#define fp freopen
#define SZ(x) ((int)(x).size())
#ifdef MPS
#define D(x...) printf(x)
#else
#define D(x...)
#endif
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
const int inf = 1<<30;
const ll INF = 1ll<<60;
const db Inf = 1e20;
const db eps = 1e-9;

void gmax(int &a,int b){a = (a > b ? a : b);}
void gmin(int &a,int b){a = (a < b ? a : b);}

const int maxn = 100050;

ll dist[4][maxn]; //0-> starts from u, 1->v, 2-> s, 3-> t, 
ll f[2][maxn];
bool inq[maxn];
int S, T, U, V, n, m;
vector<pii> adj[maxn];
priority_queue<pair<ll,int> ,vector<pair<ll,int> >,greater<pair<ll,int> > > pq;

void dijkstra(int s, int k)
{
	fo(i,1,n) dist[k][i] = INF;
	pq.push(mp(0ll, s));
	dist[k][s] = 0;
	while(!pq.empty())
	{
		int h = pq.top().se; ll w = pq.top().fi; pq.pop();
		if(w < dist[k][h]) continue;
		for(auto p : adj[h]) if(dist[k][p.fi] > dist[k][h] + p.se)
		{
			dist[k][p.fi] = dist[k][h] + p.se;
			pq.push(mp(dist[k][p.fi], p.fi));
		}
	}
}
void DP(int s, int k1, int k, int x)
{
	fo(i,1,n) f[x][i] = INF;
	f[x][s] = dist[k][s];
	pq.push(mp(f[x][s], s));
	while(!pq.empty())
	{
		int h = pq.top().se; pq.pop(); inq[h] = false;
		for(auto p : adj[h]) if(dist[k1][h] + p.se == dist[k1][p.fi])
		{
			if(f[x][p.fi] > f[x][h]) 
			{
				f[x][p.fi] = min(f[x][h], dist[k][p.fi]);
				if(!inq[p.fi])
				{
					inq[p.fi] = true;
					pq.push(mp(f[x][p.fi], p.fi));
				}
			}
		}
	}
}
int main()
{
	#ifdef MPS	
		fp("1.in","r",stdin);
		fp("1.out","w",stdout);
	#endif
	sf("%d%d",&n,&m);
	sf("%d%d%d%d",&S,&T,&U,&V);
	fo(i,1,m)
	{
		int u, v, w;
		sf("%d%d%d",&u,&v,&w);
		adj[u].pb(mp(v, w));
		adj[v].pb(mp(u, w));
	}
	dijkstra(U, 0);
	dijkstra(V, 1);
	dijkstra(S, 2);
	dijkstra(T, 3);
	DP(S, 2, 1, 0);
	DP(T, 3, 1, 1);
	ll ans = INF;
	// D("%lld %lld %lld %lld\n",dist[2][S], dist[3][S], dist[2][T],f[1][3]);
	fo(i,1,n) //iterate all y
		if(dist[2][i] + dist[3][i] == dist[2][T]) // its on the shortest path from s to T
			ans = min(ans, dist[0][i] + min(f[0][i], f[1][i]));
	pf("%lld\n",min(ans,dist[0][V]));
	return 0;
}

Compilation message

commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:86:4: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  sf("%d%d",&n,&m);
    ^
commuter_pass.cpp:87:4: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  sf("%d%d%d%d",&S,&T,&U,&V);
    ^
commuter_pass.cpp:91:5: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   sf("%d%d%d",&u,&v,&w);
     ^

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 632 ms 14948 KB Output is correct
2 Correct 768 ms 15080 KB Output is correct
3 Correct 573 ms 15124 KB Output is correct
4 Correct 612 ms 15212 KB Output is correct
5 Correct 622 ms 14696 KB Output is correct
6 Correct 595 ms 15200 KB Output is correct
7 Correct 709 ms 14952 KB Output is correct
8 Correct 641 ms 15088 KB Output is correct
9 Correct 549 ms 14784 KB Output is correct
10 Correct 536 ms 14664 KB Output is correct
11 Correct 296 ms 10768 KB Output is correct
12 Correct 570 ms 14712 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 592 ms 14896 KB Output is correct
2 Correct 674 ms 15020 KB Output is correct
3 Correct 691 ms 16412 KB Output is correct
4 Correct 652 ms 16492 KB Output is correct
5 Correct 606 ms 16600 KB Output is correct
6 Correct 573 ms 16620 KB Output is correct
7 Correct 740 ms 16620 KB Output is correct
8 Correct 639 ms 16744 KB Output is correct
9 Correct 690 ms 16656 KB Output is correct
10 Correct 668 ms 16772 KB Output is correct
11 Correct 300 ms 12592 KB Output is correct
12 Correct 540 ms 16808 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 3328 KB Output is correct
2 Correct 5 ms 2816 KB Output is correct
3 Correct 2 ms 2816 KB Output is correct
4 Correct 26 ms 4260 KB Output is correct
5 Correct 16 ms 3456 KB Output is correct
6 Correct 7 ms 2816 KB Output is correct
7 Correct 8 ms 2944 KB Output is correct
8 Correct 7 ms 2944 KB Output is correct
9 Correct 6 ms 2816 KB Output is correct
10 Correct 15 ms 3456 KB Output is correct
11 Correct 5 ms 2816 KB Output is correct
12 Correct 4 ms 2688 KB Output is correct
13 Correct 5 ms 2688 KB Output is correct
14 Correct 5 ms 2688 KB Output is correct
15 Correct 6 ms 2816 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 632 ms 14948 KB Output is correct
2 Correct 768 ms 15080 KB Output is correct
3 Correct 573 ms 15124 KB Output is correct
4 Correct 612 ms 15212 KB Output is correct
5 Correct 622 ms 14696 KB Output is correct
6 Correct 595 ms 15200 KB Output is correct
7 Correct 709 ms 14952 KB Output is correct
8 Correct 641 ms 15088 KB Output is correct
9 Correct 549 ms 14784 KB Output is correct
10 Correct 536 ms 14664 KB Output is correct
11 Correct 296 ms 10768 KB Output is correct
12 Correct 570 ms 14712 KB Output is correct
13 Correct 592 ms 14896 KB Output is correct
14 Correct 674 ms 15020 KB Output is correct
15 Correct 691 ms 16412 KB Output is correct
16 Correct 652 ms 16492 KB Output is correct
17 Correct 606 ms 16600 KB Output is correct
18 Correct 573 ms 16620 KB Output is correct
19 Correct 740 ms 16620 KB Output is correct
20 Correct 639 ms 16744 KB Output is correct
21 Correct 690 ms 16656 KB Output is correct
22 Correct 668 ms 16772 KB Output is correct
23 Correct 300 ms 12592 KB Output is correct
24 Correct 540 ms 16808 KB Output is correct
25 Correct 15 ms 3328 KB Output is correct
26 Correct 5 ms 2816 KB Output is correct
27 Correct 2 ms 2816 KB Output is correct
28 Correct 26 ms 4260 KB Output is correct
29 Correct 16 ms 3456 KB Output is correct
30 Correct 7 ms 2816 KB Output is correct
31 Correct 8 ms 2944 KB Output is correct
32 Correct 7 ms 2944 KB Output is correct
33 Correct 6 ms 2816 KB Output is correct
34 Correct 15 ms 3456 KB Output is correct
35 Correct 5 ms 2816 KB Output is correct
36 Correct 4 ms 2688 KB Output is correct
37 Correct 5 ms 2688 KB Output is correct
38 Correct 5 ms 2688 KB Output is correct
39 Correct 6 ms 2816 KB Output is correct
40 Correct 535 ms 19204 KB Output is correct
41 Correct 628 ms 19012 KB Output is correct
42 Correct 552 ms 19204 KB Output is correct
43 Correct 272 ms 12792 KB Output is correct
44 Correct 287 ms 12964 KB Output is correct
45 Correct 592 ms 17984 KB Output is correct
46 Correct 585 ms 17720 KB Output is correct
47 Correct 600 ms 18876 KB Output is correct
48 Correct 317 ms 12280 KB Output is correct
49 Correct 477 ms 18868 KB Output is correct
50 Correct 887 ms 18024 KB Output is correct
51 Correct 490 ms 17768 KB Output is correct