oj.uz

Submission #41274

# Submission time Handle Problem Language Result Execution time Memory
41274 2018-02-15T10:22:37 Z Kerim Commuter Pass (JOI18_commuter_pass) C++14
55 / 100
 2000 ms 17508 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){
				//~ q.push(it->ff);
				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];
	bfs(s);for(int i=1;i<=n;i++)d3[i]=dis[i];
	bfs(t);for(int i=1;i<=n;i++)d4[i]=dis[i];
	kfs(s);for(int i=1;i<=n;i++)dp1[i]=dp[i];
	kfs(t);for(int i=1;i<=n;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:58: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:61: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 476 ms 16100 KB Output is correct
2 Correct 489 ms 16100 KB Output is correct
3 Correct 509 ms 16100 KB Output is correct
4 Correct 449 ms 16424 KB Output is correct
5 Correct 499 ms 16424 KB Output is correct
6 Correct 538 ms 16424 KB Output is correct
7 Correct 553 ms 16424 KB Output is correct
8 Correct 602 ms 16424 KB Output is correct
9 Correct 1940 ms 17508 KB Output is correct
10 Correct 1259 ms 17508 KB Output is correct
11 Correct 190 ms 17508 KB Output is correct
12 Correct 1611 ms 17508 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 599 ms 17508 KB Output is correct
2 Correct 637 ms 17508 KB Output is correct
3 Correct 643 ms 17508 KB Output is correct
4 Correct 617 ms 17508 KB Output is correct
5 Correct 616 ms 17508 KB Output is correct
6 Correct 565 ms 17508 KB Output is correct
7 Correct 643 ms 17508 KB Output is correct
8 Correct 634 ms 17508 KB Output is correct
9 Correct 637 ms 17508 KB Output is correct
10 Correct 616 ms 17508 KB Output is correct
11 Correct 152 ms 17508 KB Output is correct
12 Correct 551 ms 17508 KB Output is correct

Subtask #3
24.0 / 24.0

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

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 476 ms 16100 KB Output is correct
2 Correct 489 ms 16100 KB Output is correct
3 Correct 509 ms 16100 KB Output is correct
4 Correct 449 ms 16424 KB Output is correct
5 Correct 499 ms 16424 KB Output is correct
6 Correct 538 ms 16424 KB Output is correct
7 Correct 553 ms 16424 KB Output is correct
8 Correct 602 ms 16424 KB Output is correct
9 Correct 1940 ms 17508 KB Output is correct
10 Correct 1259 ms 17508 KB Output is correct
11 Correct 190 ms 17508 KB Output is correct
12 Correct 1611 ms 17508 KB Output is correct
13 Correct 599 ms 17508 KB Output is correct
14 Correct 637 ms 17508 KB Output is correct
15 Correct 643 ms 17508 KB Output is correct
16 Correct 617 ms 17508 KB Output is correct
17 Correct 616 ms 17508 KB Output is correct
18 Correct 565 ms 17508 KB Output is correct
19 Correct 643 ms 17508 KB Output is correct
20 Correct 634 ms 17508 KB Output is correct
21 Correct 637 ms 17508 KB Output is correct
22 Correct 616 ms 17508 KB Output is correct
23 Correct 152 ms 17508 KB Output is correct
24 Correct 551 ms 17508 KB Output is correct
25 Correct 14 ms 17508 KB Output is correct
26 Correct 4 ms 17508 KB Output is correct
27 Correct 4 ms 17508 KB Output is correct
28 Correct 24 ms 17508 KB Output is correct
29 Correct 13 ms 17508 KB Output is correct
30 Correct 4 ms 17508 KB Output is correct
31 Correct 5 ms 17508 KB Output is correct
32 Correct 6 ms 17508 KB Output is correct
33 Correct 5 ms 17508 KB Output is correct
34 Correct 15 ms 17508 KB Output is correct
35 Correct 4 ms 17508 KB Output is correct
36 Correct 4 ms 17508 KB Output is correct
37 Correct 4 ms 17508 KB Output is correct
38 Correct 4 ms 17508 KB Output is correct
39 Correct 4 ms 17508 KB Output is correct
40 Correct 505 ms 17508 KB Output is correct
41 Execution timed out 2044 ms 17508 KB Time limit exceeded
42 Halted 0 ms 0 KB -