oj.uz

Submission #51970

# Submission time Handle Problem Language Result Execution time Memory
51970 2018-06-22T19:13:26 Z TadijaSebez Commuter Pass (JOI18_commuter_pass) C++11
100 / 100
 1352 ms 149040 KB 
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
#define mp make_pair
#define pb push_back
#define ll long long
const int N=100050;
vector<pair<int,int> > E[N];
vector<int> go[N];
ll dist[N],sol[N][3];
const ll inf=1e18;
bool ok[N];
bool mark[N];
void DFS(int u)
{
	mark[u]=1;
	for(int i=0;i<go[u].size();i++)
	{
		int v=go[u][i];
		if(!mark[v]) DFS(v);
	}
}
void Dijkstra1(int n, int s, int t)
{
	int i;
	for(i=1;i<=n;i++) dist[i]=inf,go[i].clear(),mark[i]=0;
	priority_queue<pair<ll,int> > pq;
	dist[s]=0;
	pq.push(mp(0,s));
	while(pq.size())
	{
		int u=pq.top().second;
		ll w=-pq.top().first;
		pq.pop();
		if(w!=dist[u]) continue;
		for(i=0;i<E[u].size();i++)
		{
			int v=E[u][i].first;
			w=E[u][i].second;
			if(dist[v]>dist[u]+w)
			{
				dist[v]=dist[u]+w;
				go[v].clear();
				pq.push(mp(-dist[v],v));
			}
			if(dist[v]==dist[u]+w) go[v].push_back(u);
		}
	}
	DFS(t);
	for(i=1;i<=n;i++) if(!mark[i]) go[i].clear();
}
ll Dijkstra2(int n, int s, int t)
{
	int i;
	for(i=1;i<=n;i++) sol[i][0]=sol[i][1]=sol[i][2]=inf;
	priority_queue<pair<ll,pair<int,int> > > pq;
	sol[s][0]=0;
	pq.push(mp(0,mp(s,0)));
	while(pq.size())
	{
		int u=pq.top().second.first;
		int t=pq.top().second.second;
		ll w=-pq.top().first;
		pq.pop();
		if(w!=sol[u][t]) continue;
		if(t==0 || t==2)
		{
			if(t==0 && sol[u][0]<sol[u][1])
			{
				sol[u][1]=sol[u][0];
				pq.push(mp(-sol[u][1],mp(u,1)));
			}
			for(i=0;i<E[u].size();i++)
			{
				int v=E[u][i].first;
				w=E[u][i].second;
				if(sol[v][t]>sol[u][t]+w)
				{
					sol[v][t]=sol[u][t]+w;
					pq.push(mp(-sol[v][t],mp(v,t)));
				}
			}
		}
		else if(t==1)
		{
			if(sol[u][1]<sol[u][2])
			{
				sol[u][2]=sol[u][1];
				pq.push(mp(-sol[u][2],mp(u,2)));
			}
			for(i=0;i<go[u].size();i++)
			{
				int v=go[u][i];
				if(sol[v][t]>sol[u][t])
				{
					sol[v][t]=sol[u][t];
					pq.push(mp(-sol[v][t],mp(v,t)));
				}
			}
		}
	}
	return sol[t][2];
}
ll min(ll a, ll b){ return a>b?b:a;}
int main()
{
	int n,m,u,v,w,i,a,b,s,t;
	scanf("%i %i",&n,&m);
	scanf("%i %i",&s,&t);
	scanf("%i %i",&a,&b);
	while(m--) scanf("%i %i %i",&u,&v,&w),E[u].pb(mp(v,w)),E[v].pb(mp(u,w));
	Dijkstra1(n,t,s);
	ll ans=Dijkstra2(n,a,b);
	ans=min(ans,Dijkstra2(n,b,a));
	Dijkstra1(n,t,s);
	ans=min(ans,Dijkstra2(n,a,b));
	ans=min(ans,Dijkstra2(n,b,a));
	printf("%lld\n",ans);
	return 0;
}

Compilation message

commuter_pass.cpp: In function 'void DFS(int)':
commuter_pass.cpp:19:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<go[u].size();i++)
              ~^~~~~~~~~~~~~
commuter_pass.cpp: In function 'void Dijkstra1(int, int, int)':
commuter_pass.cpp:38:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(i=0;i<E[u].size();i++)
           ~^~~~~~~~~~~~
commuter_pass.cpp: In function 'long long int Dijkstra2(int, int, int)':
commuter_pass.cpp:75:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(i=0;i<E[u].size();i++)
            ~^~~~~~~~~~~~
commuter_pass.cpp:93:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(i=0;i<go[u].size();i++)
            ~^~~~~~~~~~~~~
commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:109:16: warning: unused variable 'i' [-Wunused-variable]
  int n,m,u,v,w,i,a,b,s,t;
                ^
commuter_pass.cpp:110:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i %i",&n,&m);
  ~~~~~^~~~~~~~~~~~~~~
commuter_pass.cpp:111:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i %i",&s,&t);
  ~~~~~^~~~~~~~~~~~~~~
commuter_pass.cpp:112:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i %i",&a,&b);
  ~~~~~^~~~~~~~~~~~~~~
commuter_pass.cpp:113:56: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  while(m--) scanf("%i %i %i",&u,&v,&w),E[u].pb(mp(v,w)),E[v].pb(mp(u,w));
             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1022 ms 27420 KB Output is correct
2 Correct 1057 ms 28528 KB Output is correct
3 Correct 1143 ms 36764 KB Output is correct
4 Correct 1067 ms 38644 KB Output is correct
5 Correct 1046 ms 39576 KB Output is correct
6 Correct 965 ms 46344 KB Output is correct
7 Correct 1061 ms 47012 KB Output is correct
8 Correct 1344 ms 50320 KB Output is correct
9 Correct 1166 ms 54644 KB Output is correct
10 Correct 804 ms 58804 KB Output is correct
11 Correct 530 ms 58804 KB Output is correct
12 Correct 1240 ms 65568 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1311 ms 70484 KB Output is correct
2 Correct 1103 ms 73908 KB Output is correct
3 Correct 1072 ms 77064 KB Output is correct
4 Correct 1275 ms 80572 KB Output is correct
5 Correct 1178 ms 84344 KB Output is correct
6 Correct 1286 ms 91220 KB Output is correct
7 Correct 1352 ms 92504 KB Output is correct
8 Correct 1094 ms 94696 KB Output is correct
9 Correct 1260 ms 98520 KB Output is correct
10 Correct 1213 ms 101728 KB Output is correct
11 Correct 570 ms 101728 KB Output is correct
12 Correct 1232 ms 111136 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 111136 KB Output is correct
2 Correct 8 ms 111136 KB Output is correct
3 Correct 7 ms 111136 KB Output is correct
4 Correct 38 ms 111136 KB Output is correct
5 Correct 19 ms 111136 KB Output is correct
6 Correct 7 ms 111136 KB Output is correct
7 Correct 8 ms 111136 KB Output is correct
8 Correct 9 ms 111136 KB Output is correct
9 Correct 10 ms 111136 KB Output is correct
10 Correct 17 ms 111136 KB Output is correct
11 Correct 7 ms 111136 KB Output is correct
12 Correct 8 ms 111136 KB Output is correct
13 Correct 10 ms 111136 KB Output is correct
14 Correct 9 ms 111136 KB Output is correct
15 Correct 7 ms 111136 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1022 ms 27420 KB Output is correct
2 Correct 1057 ms 28528 KB Output is correct
3 Correct 1143 ms 36764 KB Output is correct
4 Correct 1067 ms 38644 KB Output is correct
5 Correct 1046 ms 39576 KB Output is correct
6 Correct 965 ms 46344 KB Output is correct
7 Correct 1061 ms 47012 KB Output is correct
8 Correct 1344 ms 50320 KB Output is correct
9 Correct 1166 ms 54644 KB Output is correct
10 Correct 804 ms 58804 KB Output is correct
11 Correct 530 ms 58804 KB Output is correct
12 Correct 1240 ms 65568 KB Output is correct
13 Correct 1311 ms 70484 KB Output is correct
14 Correct 1103 ms 73908 KB Output is correct
15 Correct 1072 ms 77064 KB Output is correct
16 Correct 1275 ms 80572 KB Output is correct
17 Correct 1178 ms 84344 KB Output is correct
18 Correct 1286 ms 91220 KB Output is correct
19 Correct 1352 ms 92504 KB Output is correct
20 Correct 1094 ms 94696 KB Output is correct
21 Correct 1260 ms 98520 KB Output is correct
22 Correct 1213 ms 101728 KB Output is correct
23 Correct 570 ms 101728 KB Output is correct
24 Correct 1232 ms 111136 KB Output is correct
25 Correct 20 ms 111136 KB Output is correct
26 Correct 8 ms 111136 KB Output is correct
27 Correct 7 ms 111136 KB Output is correct
28 Correct 38 ms 111136 KB Output is correct
29 Correct 19 ms 111136 KB Output is correct
30 Correct 7 ms 111136 KB Output is correct
31 Correct 8 ms 111136 KB Output is correct
32 Correct 9 ms 111136 KB Output is correct
33 Correct 10 ms 111136 KB Output is correct
34 Correct 17 ms 111136 KB Output is correct
35 Correct 7 ms 111136 KB Output is correct
36 Correct 8 ms 111136 KB Output is correct
37 Correct 10 ms 111136 KB Output is correct
38 Correct 9 ms 111136 KB Output is correct
39 Correct 7 ms 111136 KB Output is correct
40 Correct 1046 ms 116032 KB Output is correct
41 Correct 1091 ms 117328 KB Output is correct
42 Correct 1050 ms 121544 KB Output is correct
43 Correct 833 ms 121544 KB Output is correct
44 Correct 592 ms 121632 KB Output is correct
45 Correct 1277 ms 129204 KB Output is correct
46 Correct 1105 ms 132312 KB Output is correct
47 Correct 1035 ms 138644 KB Output is correct
48 Correct 600 ms 138644 KB Output is correct
49 Correct 762 ms 144856 KB Output is correct
50 Correct 1057 ms 145060 KB Output is correct
51 Correct 1162 ms 149040 KB Output is correct