oj.uz

답안 #772763

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
772763 2023-07-04T10:59:29 Z ZeroCool Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 243 ms 25772 KB 
#include <bits/stdc++.h>

#define int long long
#define debug(u) cerr<<(u == inf ? "inf" : to_string(u))<<endl
#define int long long


using namespace std;
using namespace chrono;


const int mxn = 100005;
const int inf = 1e18;

const int LOG = 17;

int n,m,s,t,u,v;
vector<pair<int,int> > g[mxn];



void dijk(int x, vector<int>&dis){
	priority_queue<pair<int,int> > pq;
	dis[x] = 0;
	pq.push({0,x});
	while(pq.size()){
		int x = (pq.top()).second;
		pq.pop();
		for(auto p : g[x]){
			if(dis[p.first] > dis[x] +p.second){
				dis[p.first] = dis[x] + p.second;
				pq.push({-dis[p.first],p.first});
			}
		}
	}
}

void solve(int T){
	cin >> n >> m >> s >> t >> u >> v;
	while(m--){
		int x, y, w;
		cin >> x >> y >> w;

		g[x].push_back({y, w});
		g[y].push_back({x, w});
	}
	vector<int> disu(n+1, 1e17), disv(n+1, 1e17), dis(n+1, 1e17), canu(n+1, 1e17), canv(n+1, 1e17);
	dijk(v, disv); dijk(u, disu);
	vector<bool> vis(n+1, 0);
	priority_queue<pair<pair<int,int>,int>, vector<pair<pair<int,int>,int>>, greater<pair<pair<int,int>,int>>> q;
	q.push({{0, s}, 0});
	dis[s] = 0;
	while(!q.empty()){
		int w = q.top().first.first;
		int x = q.top().first.second, pr = q.top().second;
		q.pop();
		if (w != dis[x]) continue;
		if (min(disv[x], canv[pr])+min(disu[x], canu[pr]) < canu[x]+canv[x]){
			canv[x] = min(disv[x], canv[pr]);
			canu[x] = min(disu[x], canu[pr]);
		}
		if (vis[x]) continue;
		vis[x] = 1;
		for (auto i : g[x]){
			if (dis[i.first] >= dis[x]+i.second){
				dis[i.first] = dis[x]+i.second;
				q.push({{dis[i.first], i.first}, x});
			}
		}
	}
	cout << min(canu[t]+canv[t], disv[u]);
}



int32_t main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	int t = 1;
	//cin>>t;
	for(int i = 1;i<=t;i++){
		solve(i);
		
	}
	
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 242 ms 21692 KB Output is correct
2 Correct 238 ms 23496 KB Output is correct
3 Correct 171 ms 23064 KB Output is correct
4 Correct 214 ms 25764 KB Output is correct
5 Correct 181 ms 23184 KB Output is correct
6 Correct 190 ms 25632 KB Output is correct
7 Correct 196 ms 23416 KB Output is correct
8 Correct 191 ms 23444 KB Output is correct
9 Correct 175 ms 24068 KB Output is correct
10 Correct 160 ms 24068 KB Output is correct
11 Correct 56 ms 13848 KB Output is correct
12 Correct 196 ms 23956 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 178 ms 20096 KB Output is correct
2 Correct 207 ms 23232 KB Output is correct
3 Correct 204 ms 23240 KB Output is correct
4 Correct 195 ms 23244 KB Output is correct
5 Correct 243 ms 23348 KB Output is correct
6 Correct 172 ms 23112 KB Output is correct
7 Correct 193 ms 23196 KB Output is correct
8 Correct 216 ms 23232 KB Output is correct
9 Correct 194 ms 23184 KB Output is correct
10 Correct 197 ms 23176 KB Output is correct
11 Correct 77 ms 13940 KB Output is correct
12 Correct 170 ms 23096 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 4308 KB Output is correct
2 Correct 2 ms 2680 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 15 ms 6688 KB Output is correct
5 Correct 6 ms 4436 KB Output is correct
6 Correct 2 ms 2812 KB Output is correct
7 Correct 2 ms 2900 KB Output is correct
8 Correct 3 ms 2888 KB Output is correct
9 Correct 2 ms 2772 KB Output is correct
10 Correct 6 ms 4308 KB Output is correct
11 Correct 1 ms 2672 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2684 KB Output is correct
15 Correct 2 ms 2772 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 242 ms 21692 KB Output is correct
2 Correct 238 ms 23496 KB Output is correct
3 Correct 171 ms 23064 KB Output is correct
4 Correct 214 ms 25764 KB Output is correct
5 Correct 181 ms 23184 KB Output is correct
6 Correct 190 ms 25632 KB Output is correct
7 Correct 196 ms 23416 KB Output is correct
8 Correct 191 ms 23444 KB Output is correct
9 Correct 175 ms 24068 KB Output is correct
10 Correct 160 ms 24068 KB Output is correct
11 Correct 56 ms 13848 KB Output is correct
12 Correct 196 ms 23956 KB Output is correct
13 Correct 178 ms 20096 KB Output is correct
14 Correct 207 ms 23232 KB Output is correct
15 Correct 204 ms 23240 KB Output is correct
16 Correct 195 ms 23244 KB Output is correct
17 Correct 243 ms 23348 KB Output is correct
18 Correct 172 ms 23112 KB Output is correct
19 Correct 193 ms 23196 KB Output is correct
20 Correct 216 ms 23232 KB Output is correct
21 Correct 194 ms 23184 KB Output is correct
22 Correct 197 ms 23176 KB Output is correct
23 Correct 77 ms 13940 KB Output is correct
24 Correct 170 ms 23096 KB Output is correct
25 Correct 9 ms 4308 KB Output is correct
26 Correct 2 ms 2680 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 15 ms 6688 KB Output is correct
29 Correct 6 ms 4436 KB Output is correct
30 Correct 2 ms 2812 KB Output is correct
31 Correct 2 ms 2900 KB Output is correct
32 Correct 3 ms 2888 KB Output is correct
33 Correct 2 ms 2772 KB Output is correct
34 Correct 6 ms 4308 KB Output is correct
35 Correct 1 ms 2672 KB Output is correct
36 Correct 2 ms 2644 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 2 ms 2684 KB Output is correct
39 Correct 2 ms 2772 KB Output is correct
40 Correct 185 ms 25716 KB Output is correct
41 Correct 163 ms 23972 KB Output is correct
42 Correct 172 ms 24088 KB Output is correct
43 Correct 75 ms 13964 KB Output is correct
44 Correct 60 ms 13928 KB Output is correct
45 Correct 192 ms 23012 KB Output is correct
46 Correct 193 ms 22824 KB Output is correct
47 Correct 183 ms 25772 KB Output is correct
48 Correct 57 ms 13392 KB Output is correct
49 Correct 166 ms 25632 KB Output is correct
50 Correct 184 ms 23168 KB Output is correct
51 Correct 154 ms 23048 KB Output is correct