oj.uz

Submission #484602

# Submission time Handle Problem Language Result Execution time Memory
484602 2021-11-04T15:47:13 Z BackNoob Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 415 ms 35296 KB 
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define endl '\n'
#define MASK(i) (1LL << (i))
#define ull unsigned long long
#define ld long double
#define pb push_back
#define all(x) (x).begin() , (x).end()
#define BIT(x , i) ((x >> (i)) & 1) 
#define TASK "task"
#define sz(s) (int) (s).size()

using namespace std;
const int mxN = 3e5 + 227;
const int inf = 1e9 + 277;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 7;
const int base = 307;
const int LOG = 20;
 
template <typename T1, typename T2> bool minimize(T1 &a, T2 b) {
	if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b) {
	if (a < b) {a = b; return true;} return false;
}

struct item{
	ll d;
	int spec , u;
};

struct cmp{
	bool operator()(const item &a , const item &b) {
		return a.d > b.d;
	}
};

int n , m , S , T , U , V;
vector<pair<int , int>> adj[mxN];
ll dp[mxN][3];
ll dist1[mxN] , dist2[mxN];

void pre()
{	
	memset(dist1 , 0x3f , sizeof(dist1));
	priority_queue <pair<ll , int>, vector <pair<ll , int>> , greater<pair<ll , int>>> pq;
	pq.push({dist1[S] = 0 , S});
	while(!pq.empty()) {
		int u = pq.top().se;
		ll d = pq.top().fi;
		pq.pop();
		if(d != dist1[u]) continue;
		for(auto it : adj[u]) {
			int v = it.fi;
			int c = it.se;
			if(minimize(dist1[v] , dist1[u] + c) == true) {
				pq.push({dist1[v] , v});
			}
		}
	}

	memset(dist2 , 0x3f , sizeof(dist2));
	pq.push({dist2[T] = 0 , T});
	while(!pq.empty()) {
		int u = pq.top().se;
		ll d = pq.top().fi;
		pq.pop();
		if(d != dist2[u]) continue;
		for(auto it : adj[u]) {
			int v = it.fi;
			int c = it.se;
			if(minimize(dist2[v] , dist2[u] + c) == true) {
				pq.push({dist2[v] , v});
			}
		}
	}
}

void solve()
{
	cin >> n >> m >> S >> T >> U >> V;

	for(int i = 1 ; i <= m ; i++) {
		int u , v , c;
		cin >> u >> v >> c;
		adj[u].pb({v , c});
		adj[v].pb({u , c});
	}

	pre();

	// for(int u = 1 ; u <= n ; u++) {
	// 	for(auto it : adj[u]) {
	// 		int v = it.fi;
	// 		int c = it.se;
	// 		if(dist2[u] + dist1[v] + c == dist1[T]) {
	// 			cout << u << ' ' << v << endl;
	// 		}
	// 	}
	// }

	memset(dp , 0x3f , sizeof(dp));
	priority_queue<item , vector<item> , cmp> pq;
	pq.push({0 , 0 , U});
	dp[U][0] = 0;
	while(!pq.empty()) {
		int u = pq.top().u;
		ll d = pq.top().d;
		int spec = pq.top().spec;
		pq.pop();

		if(d != dp[u][spec]) continue;

		for(auto it : adj[u]) {
			int v = it.fi;
			int c = it.se;

			if(spec == 0) {
				if(dist1[u] + dist2[v] + c == dist1[T]) {
					if(minimize(dp[v][1] , d) == true) {
						pq.push({d , 1 , v});
					}
				}

				if(minimize(dp[v][0] , d + c) == true) {
					pq.push({d + c , 0 , v});
				}
			}
			if(spec == 1) {
				if(dist1[u] + dist2[v] + c == dist1[T]) {
					if(minimize(dp[v][1] , d) == true) {
						pq.push({d , 1 , v});
					}
				}

				if(minimize(dp[v][2] , d + c) == true) {
					pq.push({d + c , 2 , v});
				}
			}
			if(spec == 2) {
				if(minimize(dp[v][2] , d + c) == true) {
					pq.push({d + c , 2 , v});
				}
			}
		}
	}	

	ll res = min({dp[V][0] , dp[V][1] , dp[V][2]});

	memset(dp , 0x3f , sizeof(dp));
	pq.push({0 , 0 , U});
	dp[U][0] = 0;
	while(!pq.empty()) {
		int u = pq.top().u;
		ll d = pq.top().d;
		int spec = pq.top().spec;
		pq.pop();

		if(d != dp[u][spec]) continue;

		for(auto it : adj[u]) {
			int v = it.fi;
			int c = it.se;

			if(spec == 0) {
				if(dist2[u] + dist1[v] + c == dist1[T]) {
					if(minimize(dp[v][1] , d) == true) {
						pq.push({d , 1 , v});
					}
				}

				if(minimize(dp[v][0] , d + c) == true) {
					pq.push({d + c , 0 , v});
				}
			}
			if(spec == 1) {
				if(dist2[u] + dist1[v] + c == dist1[T]) {
					if(minimize(dp[v][1] , d) == true) {
						pq.push({d , 1 , v});
					}
				}

				if(minimize(dp[v][2] , d + c) == true) {
					pq.push({d + c , 2 , v});
				}
			}
			if(spec == 2) {
				if(minimize(dp[v][2] , d + c) == true) {
					pq.push({d + c , 2 , v});
				}
			}
		}
	}	
	minimize(res , min({dp[V][0] , dp[V][1] , dp[V][2]}));
	cout << res;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    //freopen(TASK".inp" , "r" , stdin);
    //freopen(TASK".out" , "w" , stdout);
    
    int tc = 1;
    //cin >> tc;
    while(tc--) {
    	solve();
    }
    return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 347 ms 35252 KB Output is correct
2 Correct 373 ms 31860 KB Output is correct
3 Correct 379 ms 35220 KB Output is correct
4 Correct 330 ms 32188 KB Output is correct
5 Correct 354 ms 32936 KB Output is correct
6 Correct 350 ms 35248 KB Output is correct
7 Correct 380 ms 32896 KB Output is correct
8 Correct 372 ms 32992 KB Output is correct
9 Correct 353 ms 32776 KB Output is correct
10 Correct 293 ms 32884 KB Output is correct
11 Correct 160 ms 25352 KB Output is correct
12 Correct 374 ms 32588 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 388 ms 32296 KB Output is correct
2 Correct 379 ms 31912 KB Output is correct
3 Correct 407 ms 33244 KB Output is correct
4 Correct 377 ms 31872 KB Output is correct
5 Correct 398 ms 32024 KB Output is correct
6 Correct 359 ms 33268 KB Output is correct
7 Correct 415 ms 32972 KB Output is correct
8 Correct 386 ms 32084 KB Output is correct
9 Correct 392 ms 31832 KB Output is correct
10 Correct 377 ms 31816 KB Output is correct
11 Correct 157 ms 26460 KB Output is correct
12 Correct 378 ms 33216 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 20276 KB Output is correct
2 Correct 10 ms 19148 KB Output is correct
3 Correct 10 ms 19148 KB Output is correct
4 Correct 22 ms 21176 KB Output is correct
5 Correct 16 ms 20172 KB Output is correct
6 Correct 12 ms 19160 KB Output is correct
7 Correct 10 ms 19148 KB Output is correct
8 Correct 10 ms 19276 KB Output is correct
9 Correct 9 ms 19164 KB Output is correct
10 Correct 16 ms 20172 KB Output is correct
11 Correct 9 ms 19020 KB Output is correct
12 Correct 10 ms 19024 KB Output is correct
13 Correct 11 ms 19148 KB Output is correct
14 Correct 10 ms 19168 KB Output is correct
15 Correct 12 ms 19156 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 347 ms 35252 KB Output is correct
2 Correct 373 ms 31860 KB Output is correct
3 Correct 379 ms 35220 KB Output is correct
4 Correct 330 ms 32188 KB Output is correct
5 Correct 354 ms 32936 KB Output is correct
6 Correct 350 ms 35248 KB Output is correct
7 Correct 380 ms 32896 KB Output is correct
8 Correct 372 ms 32992 KB Output is correct
9 Correct 353 ms 32776 KB Output is correct
10 Correct 293 ms 32884 KB Output is correct
11 Correct 160 ms 25352 KB Output is correct
12 Correct 374 ms 32588 KB Output is correct
13 Correct 388 ms 32296 KB Output is correct
14 Correct 379 ms 31912 KB Output is correct
15 Correct 407 ms 33244 KB Output is correct
16 Correct 377 ms 31872 KB Output is correct
17 Correct 398 ms 32024 KB Output is correct
18 Correct 359 ms 33268 KB Output is correct
19 Correct 415 ms 32972 KB Output is correct
20 Correct 386 ms 32084 KB Output is correct
21 Correct 392 ms 31832 KB Output is correct
22 Correct 377 ms 31816 KB Output is correct
23 Correct 157 ms 26460 KB Output is correct
24 Correct 378 ms 33216 KB Output is correct
25 Correct 17 ms 20276 KB Output is correct
26 Correct 10 ms 19148 KB Output is correct
27 Correct 10 ms 19148 KB Output is correct
28 Correct 22 ms 21176 KB Output is correct
29 Correct 16 ms 20172 KB Output is correct
30 Correct 12 ms 19160 KB Output is correct
31 Correct 10 ms 19148 KB Output is correct
32 Correct 10 ms 19276 KB Output is correct
33 Correct 9 ms 19164 KB Output is correct
34 Correct 16 ms 20172 KB Output is correct
35 Correct 9 ms 19020 KB Output is correct
36 Correct 10 ms 19024 KB Output is correct
37 Correct 11 ms 19148 KB Output is correct
38 Correct 10 ms 19168 KB Output is correct
39 Correct 12 ms 19156 KB Output is correct
40 Correct 367 ms 35296 KB Output is correct
41 Correct 362 ms 31564 KB Output is correct
42 Correct 336 ms 31428 KB Output is correct
43 Correct 217 ms 26620 KB Output is correct
44 Correct 186 ms 25536 KB Output is correct
45 Correct 391 ms 33056 KB Output is correct
46 Correct 384 ms 32676 KB Output is correct
47 Correct 348 ms 35212 KB Output is correct
48 Correct 197 ms 25912 KB Output is correct
49 Correct 300 ms 34832 KB Output is correct
50 Correct 386 ms 33000 KB Output is correct
51 Correct 368 ms 32936 KB Output is correct