oj.uz

Submission #41277

# Submission time Handle Problem Language Result Execution time Memory
41277 2018-02-15T10:38:20 Z Kerim Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 1216 ms 17444 KB 
#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
int n,m,u,v,s,t;
vector<PII>adj[MAXN];
const ll B=1e15;
ll dis[MAXN],d1[MAXN],d2[MAXN],dp[MAXN];
ll dp1[MAXN],dp2[MAXN],d3[MAXN],d4[MAXN];
void bfs(int st){
	for(int i=1;i<=n;i++)
		dis[i]=B;
	priority_queue<PII,vector<PII>,greater<PII> >q;	
	q.push(mp(0,st));dis[st]=0;
	while(!q.empty()){
		int nd=q.top().ss;q.pop();
		tr(it,adj[nd])
			if(umin(dis[it->ff],dis[nd]+it->ss))
				q.push(mp(dis[it->ff],it->ff));
	}
}
void kfs(int st){
	for(int i=1;i<=n;i++)
		dis[i]=B,dp[i]=B;
	priority_queue<PII,vector<PII>,greater<PII> >q;	
	q.push(mp(0,st));dis[st]=0;dp[st]=d2[st];
	while(!q.empty()){
		int nd=q.top().ss;q.pop();
		tr(it,adj[nd])
			if(dis[it->ff]>dis[nd]+it->ss){
				dis[it->ff]=dis[nd]+it->ss;
				q.push(mp(dis[it->ff],it->ff));
				dp[it->ff]=min(dp[nd],d2[it->ff]);
			}
			else if(dis[it->ff]==dis[nd]+it->ss)
				umin(dp[it->ff],min(dp[nd],d2[it->ff]));
	}
}
int main(){
    //~ freopen("file.in", "r", stdin);
    scanf("%d%d%d%d%d%d",&n,&m,&s,&t,&u,&v);
    while(m--){
		int uu,vv,w;
		scanf("%d%d%d",&uu,&vv,&w);
		adj[uu].pb(mp(vv,w));
		adj[vv].pb(mp(uu,w));
	}
	bfs(u);for(int i=1;i<=n;i++)d1[i]=dis[i];
	bfs(v);for(int i=1;i<=n;i++)d2[i]=dis[i];
	kfs(s);for(int i=1;i<=n;i++)d3[i]=dis[i],dp1[i]=dp[i];
	kfs(t);for(int i=1;i<=n;i++)d4[i]=dis[i],dp2[i]=dp[i];
	ll ans=d1[v];
	for(int i=1;i<=n;i++)
		if(d3[i]+d4[i]==d3[t])
			umin(ans,d1[i]+min(dp1[i],dp2[i]));
	printf("%lld\n",ans);		
	return 0;
}

Compilation message

commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:56:44: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d%d%d%d",&n,&m,&s,&t,&u,&v);
                                            ^
commuter_pass.cpp:59:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d",&uu,&vv,&w);
                             ^

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 348 ms 15248 KB Output is correct
2 Correct 392 ms 15536 KB Output is correct
3 Correct 332 ms 15540 KB Output is correct
4 Correct 343 ms 16300 KB Output is correct
5 Correct 356 ms 16300 KB Output is correct
6 Correct 414 ms 16300 KB Output is correct
7 Correct 376 ms 16300 KB Output is correct
8 Correct 401 ms 16300 KB Output is correct
9 Correct 1216 ms 17444 KB Output is correct
10 Correct 829 ms 17444 KB Output is correct
11 Correct 141 ms 17444 KB Output is correct
12 Correct 993 ms 17444 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 430 ms 17444 KB Output is correct
2 Correct 404 ms 17444 KB Output is correct
3 Correct 442 ms 17444 KB Output is correct
4 Correct 418 ms 17444 KB Output is correct
5 Correct 429 ms 17444 KB Output is correct
6 Correct 361 ms 17444 KB Output is correct
7 Correct 425 ms 17444 KB Output is correct
8 Correct 399 ms 17444 KB Output is correct
9 Correct 375 ms 17444 KB Output is correct
10 Correct 385 ms 17444 KB Output is correct
11 Correct 116 ms 17444 KB Output is correct
12 Correct 366 ms 17444 KB Output is correct

Subtask #3
24.0 / 24.0

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

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 348 ms 15248 KB Output is correct
2 Correct 392 ms 15536 KB Output is correct
3 Correct 332 ms 15540 KB Output is correct
4 Correct 343 ms 16300 KB Output is correct
5 Correct 356 ms 16300 KB Output is correct
6 Correct 414 ms 16300 KB Output is correct
7 Correct 376 ms 16300 KB Output is correct
8 Correct 401 ms 16300 KB Output is correct
9 Correct 1216 ms 17444 KB Output is correct
10 Correct 829 ms 17444 KB Output is correct
11 Correct 141 ms 17444 KB Output is correct
12 Correct 993 ms 17444 KB Output is correct
13 Correct 430 ms 17444 KB Output is correct
14 Correct 404 ms 17444 KB Output is correct
15 Correct 442 ms 17444 KB Output is correct
16 Correct 418 ms 17444 KB Output is correct
17 Correct 429 ms 17444 KB Output is correct
18 Correct 361 ms 17444 KB Output is correct
19 Correct 425 ms 17444 KB Output is correct
20 Correct 399 ms 17444 KB Output is correct
21 Correct 375 ms 17444 KB Output is correct
22 Correct 385 ms 17444 KB Output is correct
23 Correct 116 ms 17444 KB Output is correct
24 Correct 366 ms 17444 KB Output is correct
25 Correct 13 ms 17444 KB Output is correct
26 Correct 4 ms 17444 KB Output is correct
27 Correct 3 ms 17444 KB Output is correct
28 Correct 28 ms 17444 KB Output is correct
29 Correct 12 ms 17444 KB Output is correct
30 Correct 5 ms 17444 KB Output is correct
31 Correct 6 ms 17444 KB Output is correct
32 Correct 7 ms 17444 KB Output is correct
33 Correct 4 ms 17444 KB Output is correct
34 Correct 12 ms 17444 KB Output is correct
35 Correct 3 ms 17444 KB Output is correct
36 Correct 3 ms 17444 KB Output is correct
37 Correct 4 ms 17444 KB Output is correct
38 Correct 5 ms 17444 KB Output is correct
39 Correct 4 ms 17444 KB Output is correct
40 Correct 327 ms 17444 KB Output is correct
41 Correct 1211 ms 17444 KB Output is correct
42 Correct 1136 ms 17444 KB Output is correct
43 Correct 137 ms 17444 KB Output is correct
44 Correct 130 ms 17444 KB Output is correct
45 Correct 279 ms 17444 KB Output is correct
46 Correct 350 ms 17444 KB Output is correct
47 Correct 349 ms 17444 KB Output is correct
48 Correct 134 ms 17444 KB Output is correct
49 Correct 307 ms 17444 KB Output is correct
50 Correct 340 ms 17444 KB Output is correct
51 Correct 342 ms 17444 KB Output is correct