oj.uz

답안 #346846

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
346846 2021-01-11T08:55:47 Z CSQ31 Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 438 ms 25708 KB 
#pragma GCC optimize("Ofast") 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(1e9+7)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
const int MAXN = 1e5+2;
vector<vector<pii>> adj(MAXN);
vector<ll>udist(MAXN,INF),vdist(MAXN,INF),sdist(MAXN,INF),tdist(MAXN,INF);
vector<bool>vis(MAXN,0);
vii tadj(MAXN);
void djikstra(int s,vector<ll>&dist){
	priority_queue<PII,vector<PII>,greater<PII>>pq;
	pq.push({0,s});
	dist[s] = 0;
	while(!pq.empty()){
		ll d = pq.top().fi;
		int v = pq.top().se;
		pq.pop();
		if(d != dist[v])continue;
		for(auto x:adj[v]){
			int to = x.fi;
			ll w = x.se;
			if(dist[to] > d+w){
				dist[to] = d+w;
				pq.push({d+w,to});
			}
		}
	}
}
vector<ll>topo;
void dfs(int v){
	vis[v] = 1;
	for(int x:tadj[v]){
		if(!vis[x]){
			dfs(x);
		}
	}
	topo.pb(v);
}
int main()
{
  owo
	int n,m;
	cin>>n>>m;
	int s,t,u,v;
	cin>>s>>t>>u>>v;
	for(int i=0;i<m;i++){
		ll a,b,c;
		cin>>a>>b>>c;
		adj[a].pb({b,c});
		adj[b].pb({a,c});
	}
	djikstra(u,udist);
	djikstra(v,vdist);
	djikstra(s,sdist);
	djikstra(t,tdist);
	queue<int>q;
	q.push(s);
	vis[s] = 1;
	while(!q.empty()){
		int v = q.front();
		q.pop();
		for(auto x:adj[v]){
			int to = x.fi;
			ll w = x.se;
			if(sdist[v]+w + tdist[to] == sdist[t]){
				tadj[v].pb(to);
				if(!vis[to])q.push(to);
				vis[to] = 1;
			}
		}
		
	}
	for(int i=1;i<=n;i++)vis[i] = 0;
	dfs(s);
	ll ans = vdist[u];
	vector<ll>dp(n+1,INF);
	/*
	for(int i=1;i<=n;i++){
		cout<<i<<":";
		for(int x:tadj[i])cout<<x<<" ";
		cout<<'\n';
	}*/
	for(ll z:topo){
		dp[z] = vdist[z];
		for(int x:tadj[z]){
			dp[z] = min(dp[x],dp[z]);
		}
		ans = min(ans,dp[z]+udist[z]);
	}
	for(int i=1;i<=n;i++)dp[i] = INF;
	for(ll z:topo){
		dp[z] = udist[z];
		for(int x:tadj[z]){
			dp[z] = min(dp[x],dp[z]);
		}
		ans = min(ans,dp[z]+vdist[z]);
	}
	cout<<ans<<'\n';
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 324 ms 21488 KB Output is correct
2 Correct 349 ms 20004 KB Output is correct
3 Correct 403 ms 25444 KB Output is correct
4 Correct 320 ms 21296 KB Output is correct
5 Correct 335 ms 20884 KB Output is correct
6 Correct 355 ms 22044 KB Output is correct
7 Correct 373 ms 21384 KB Output is correct
8 Correct 351 ms 20888 KB Output is correct
9 Correct 324 ms 20588 KB Output is correct
10 Correct 290 ms 20660 KB Output is correct
11 Correct 176 ms 18540 KB Output is correct
12 Correct 336 ms 20544 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 379 ms 21788 KB Output is correct
2 Correct 371 ms 21916 KB Output is correct
3 Correct 351 ms 21112 KB Output is correct
4 Correct 366 ms 21608 KB Output is correct
5 Correct 400 ms 22520 KB Output is correct
6 Correct 395 ms 25008 KB Output is correct
7 Correct 438 ms 25324 KB Output is correct
8 Correct 371 ms 21620 KB Output is correct
9 Correct 377 ms 22536 KB Output is correct
10 Correct 387 ms 21236 KB Output is correct
11 Correct 157 ms 20708 KB Output is correct
12 Correct 372 ms 25708 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 9324 KB Output is correct
2 Correct 5 ms 8300 KB Output is correct
3 Correct 5 ms 8172 KB Output is correct
4 Correct 19 ms 10348 KB Output is correct
5 Correct 12 ms 9324 KB Output is correct
6 Correct 6 ms 8300 KB Output is correct
7 Correct 6 ms 8300 KB Output is correct
8 Correct 7 ms 8300 KB Output is correct
9 Correct 6 ms 8300 KB Output is correct
10 Correct 12 ms 9324 KB Output is correct
11 Correct 5 ms 8172 KB Output is correct
12 Correct 5 ms 8172 KB Output is correct
13 Correct 6 ms 8172 KB Output is correct
14 Correct 6 ms 8300 KB Output is correct
15 Correct 6 ms 8300 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 324 ms 21488 KB Output is correct
2 Correct 349 ms 20004 KB Output is correct
3 Correct 403 ms 25444 KB Output is correct
4 Correct 320 ms 21296 KB Output is correct
5 Correct 335 ms 20884 KB Output is correct
6 Correct 355 ms 22044 KB Output is correct
7 Correct 373 ms 21384 KB Output is correct
8 Correct 351 ms 20888 KB Output is correct
9 Correct 324 ms 20588 KB Output is correct
10 Correct 290 ms 20660 KB Output is correct
11 Correct 176 ms 18540 KB Output is correct
12 Correct 336 ms 20544 KB Output is correct
13 Correct 379 ms 21788 KB Output is correct
14 Correct 371 ms 21916 KB Output is correct
15 Correct 351 ms 21112 KB Output is correct
16 Correct 366 ms 21608 KB Output is correct
17 Correct 400 ms 22520 KB Output is correct
18 Correct 395 ms 25008 KB Output is correct
19 Correct 438 ms 25324 KB Output is correct
20 Correct 371 ms 21620 KB Output is correct
21 Correct 377 ms 22536 KB Output is correct
22 Correct 387 ms 21236 KB Output is correct
23 Correct 157 ms 20708 KB Output is correct
24 Correct 372 ms 25708 KB Output is correct
25 Correct 13 ms 9324 KB Output is correct
26 Correct 5 ms 8300 KB Output is correct
27 Correct 5 ms 8172 KB Output is correct
28 Correct 19 ms 10348 KB Output is correct
29 Correct 12 ms 9324 KB Output is correct
30 Correct 6 ms 8300 KB Output is correct
31 Correct 6 ms 8300 KB Output is correct
32 Correct 7 ms 8300 KB Output is correct
33 Correct 6 ms 8300 KB Output is correct
34 Correct 12 ms 9324 KB Output is correct
35 Correct 5 ms 8172 KB Output is correct
36 Correct 5 ms 8172 KB Output is correct
37 Correct 6 ms 8172 KB Output is correct
38 Correct 6 ms 8300 KB Output is correct
39 Correct 6 ms 8300 KB Output is correct
40 Correct 330 ms 22052 KB Output is correct
41 Correct 329 ms 20848 KB Output is correct
42 Correct 315 ms 20624 KB Output is correct
43 Correct 173 ms 21344 KB Output is correct
44 Correct 175 ms 21572 KB Output is correct
45 Correct 345 ms 22568 KB Output is correct
46 Correct 342 ms 22188 KB Output is correct
47 Correct 338 ms 21356 KB Output is correct
48 Correct 183 ms 18784 KB Output is correct
49 Correct 264 ms 21620 KB Output is correct
50 Correct 342 ms 21620 KB Output is correct
51 Correct 329 ms 22536 KB Output is correct