oj.uz

답안 #530657

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
530657 2022-02-26T09:12:16 Z ssense Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 340 ms 35004 KB 
#include <bits/stdc++.h>
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
typedef long long  ll;
using namespace std;
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define MXL 1000000000000000000
#define PI (ld)2*acos(0.0)
#define nax 200005
#define pb push_back
#define sc second
#define fr first
#define int long long
#define endl '\n'
#define ld long double
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vint pref;void build(vint a){pref.pb(0);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}int get(int l, int r){return pref[r]-pref[l-1];}};//ssense


template<typename T>
pair<vector<T>, vector<int>> Dijkstra(int start, vector<vector<pair<int,T>>> adj, T mx) {
	int n = adj.size();
	priority_queue<pair<T, int>> q;

	vector<T> dist(n, mx);
	vector<int> parent(n, -1);
	dist[start] = 0;

	q.push({0, start});

	while(!q.empty()) {
		int u = q.top().second;
		T dist_u = -q.top().first;
		q.pop();
		if(dist_u != dist[u]) continue;

		for(auto x: adj[u]) {
			int v = x.first;
			T w = x.second;

			if(dist[v] > dist[u] + w) {
				dist[v] = dist[u] + w;
				parent[v] = u;
				q.push({-dist[v], v});
			}
		}
	}

	return {dist, parent};
	//start, adjlist, fill_max
}

void solve()
{
	int n, m;
	cin >> n >> m;
	int s, t, u, v;
	cin >> s >> t >> u >> v;
	vector<vector<pair<int, int>>> adj;
	vector<pair<int, int>> x;
	adj.assign(n, x);
	s--, t--, u--, v--;
	for(int i = 0; i < m; i++)
	{
		int j, k, w;
		cin >> j >> k >> w;
		j--;
		k--;
		adj[j].pb({k, w});
		adj[k].pb({j, w});
	}
	vector<int> distu = Dijkstra(u, adj, (int)MXL).fr;
	vector<int> distv = Dijkstra(v, adj, (int)MXL).fr;
	priority_queue<array<int, 4>> q;
	vector<array<int, 3>> dist(n, {MXL, MXL, MXL});
	
	dist[s] = {0, distu[s], distv[s]};
	q.push({0, -distu[s], -distv[s], s});
	while(!q.empty())
	{
		int now = q.top()[3];
		int dist_now = -q.top()[0];
		int distu_now = -q.top()[1];
		int distv_now = -q.top()[2];
		q.pop();
		if(dist_now != dist[now][0] || distu_now != dist[now][1] || distv_now != dist[now][2]) continue;
		for(auto x: adj[now])
		{
			int ve = x.first;
			int w = x.second;
			if(dist[ve][0] > dist_now+w || (dist[ve][0] == dist_now+w && dist[ve][1]+dist[ve][2] > min(distu[ve],dist[now][1])+min(distv[ve], dist[now][2]))) {
				dist[ve][0] = dist_now + w;
				dist[ve][1] = min(distu[ve], distu_now);
				dist[ve][2] = min(distv[ve], distv_now);
				q.push({-dist[ve][0], -dist[ve][1], -dist[ve][2], ve});
			}
		}
	}
	cout << min(dist[t][1]+dist[t][2], distu[v]) << endl;
}

int32_t main(){
	startt
	int t = 1;
	//cin >> t;
	while (t--) {
		solve();
	}
}

/*
6 6
1 6
1 4
1 2 1
2 3 1
3 5 1
2 4 3
4 5 2
5 6 1
 */

Compilation message

commuter_pass.cpp: In member function 'void prefix_sum::build(std::vector<long long int>)':
commuter_pass.cpp:21:667: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 | int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vint pref;void build(vint a){pref.pb(0);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}int get(int l, int r){return pref[r]-pref[l-1];}};//ssense
      |                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                         ~~^~~~~~~~~~

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 275 ms 30072 KB Output is correct
2 Correct 287 ms 27396 KB Output is correct
3 Correct 315 ms 27288 KB Output is correct
4 Correct 275 ms 30020 KB Output is correct
5 Correct 284 ms 27476 KB Output is correct
6 Correct 305 ms 30296 KB Output is correct
7 Correct 285 ms 27588 KB Output is correct
8 Correct 286 ms 27804 KB Output is correct
9 Correct 269 ms 27244 KB Output is correct
10 Correct 250 ms 27476 KB Output is correct
11 Correct 137 ms 18788 KB Output is correct
12 Correct 285 ms 27472 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 291 ms 27500 KB Output is correct
2 Correct 297 ms 27604 KB Output is correct
3 Correct 300 ms 27412 KB Output is correct
4 Correct 296 ms 30824 KB Output is correct
5 Correct 289 ms 30956 KB Output is correct
6 Correct 281 ms 31116 KB Output is correct
7 Correct 306 ms 30988 KB Output is correct
8 Correct 340 ms 30836 KB Output is correct
9 Correct 290 ms 31012 KB Output is correct
10 Correct 303 ms 31004 KB Output is correct
11 Correct 121 ms 20876 KB Output is correct
12 Correct 287 ms 31104 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 2380 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 14 ms 5092 KB Output is correct
5 Correct 7 ms 2680 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 3 ms 588 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 7 ms 2628 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 275 ms 30072 KB Output is correct
2 Correct 287 ms 27396 KB Output is correct
3 Correct 315 ms 27288 KB Output is correct
4 Correct 275 ms 30020 KB Output is correct
5 Correct 284 ms 27476 KB Output is correct
6 Correct 305 ms 30296 KB Output is correct
7 Correct 285 ms 27588 KB Output is correct
8 Correct 286 ms 27804 KB Output is correct
9 Correct 269 ms 27244 KB Output is correct
10 Correct 250 ms 27476 KB Output is correct
11 Correct 137 ms 18788 KB Output is correct
12 Correct 285 ms 27472 KB Output is correct
13 Correct 291 ms 27500 KB Output is correct
14 Correct 297 ms 27604 KB Output is correct
15 Correct 300 ms 27412 KB Output is correct
16 Correct 296 ms 30824 KB Output is correct
17 Correct 289 ms 30956 KB Output is correct
18 Correct 281 ms 31116 KB Output is correct
19 Correct 306 ms 30988 KB Output is correct
20 Correct 340 ms 30836 KB Output is correct
21 Correct 290 ms 31012 KB Output is correct
22 Correct 303 ms 31004 KB Output is correct
23 Correct 121 ms 20876 KB Output is correct
24 Correct 287 ms 31104 KB Output is correct
25 Correct 8 ms 2380 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 316 KB Output is correct
28 Correct 14 ms 5092 KB Output is correct
29 Correct 7 ms 2680 KB Output is correct
30 Correct 1 ms 460 KB Output is correct
31 Correct 1 ms 460 KB Output is correct
32 Correct 3 ms 588 KB Output is correct
33 Correct 2 ms 504 KB Output is correct
34 Correct 7 ms 2628 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 251 ms 35004 KB Output is correct
41 Correct 309 ms 31868 KB Output is correct
42 Correct 277 ms 31776 KB Output is correct
43 Correct 114 ms 20844 KB Output is correct
44 Correct 128 ms 20952 KB Output is correct
45 Correct 256 ms 30744 KB Output is correct
46 Correct 324 ms 30804 KB Output is correct
47 Correct 285 ms 33708 KB Output is correct
48 Correct 124 ms 20332 KB Output is correct
49 Correct 242 ms 34800 KB Output is correct
50 Correct 280 ms 31000 KB Output is correct
51 Correct 246 ms 30624 KB Output is correct