oj.uz

답안 #41270

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
41270 2018-02-15T10:03:40 Z Kerim Commuter Pass (JOI18_commuter_pass) C++14
0 / 100
 2000 ms 262144 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;
	queue<int>q;	
	q.push(st);dis[st]=0;
	while(!q.empty()){
		int nd=q.front();q.pop();
		tr(it,adj[nd])
			if(umin(dis[it->ff],dis[nd]+it->ss))
				q.push(it->ff);
	}
}
void kfs(int st){
	for(int i=1;i<=n;i++)
		dis[i]=B,dp[i]=d2[i];
	queue<int>q;	
	q.push(st);dis[st]=0;
	while(!q.empty()){
		int nd=q.front();q.pop();
		tr(it,adj[nd])
			if(dis[it->ff]>dis[nd]+it->ss){
				dis[it->ff]=dis[nd]+it->ss;
				q.push(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],dp[nd]);
			}
	}
}
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
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 693 ms 15872 KB Output is correct
2 Execution timed out 2033 ms 21268 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2045 ms 21268 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2064 ms 262144 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 693 ms 15872 KB Output is correct
2 Execution timed out 2033 ms 21268 KB Time limit exceeded
3 Halted 0 ms 0 KB -