oj.uz

Submission #330871

# Submission time Handle Problem Language Result Execution time Memory
330871 2020-11-26T19:27:50 Z evn Commuter Pass (JOI18_commuter_pass) C++14
31 / 100
 374 ms 35420 KB 
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll, ll> pii;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
vector<pii> adj[100005];
set<int> parents[100005];
ll dijkstra[100005];
ll dijkstra2[100005];
bool vis[100005];
int main(){

	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int N, M, S, T, U, V;
	cin >> N >> M >> S >> T >> U >> V; S--; T--; U--; V--;
	for(int i = 0; i < M;i ++){
		ll a, b, c;
		cin >> a >> b >> c;
		a--; b--;
		adj[a].pb({b,c});
		adj[b].pb({a,c});
	}
	//run yikstras once
	for(int i =0; i < N;i ++){
		dijkstra[i] = 1e18;
		dijkstra2[i] = 1e18;
	}
	dijkstra[S] = 0;
	priority_queue<pii, vector<pii>, greater<pii>> pq; 
	pq.push({0,S});
	while(!pq.empty()){
		pii curr = pq.top(); pq.pop();
		if(dijkstra[curr.s] != curr.f)continue; 
		for(auto it : adj[curr.s]){
			ll next = it.f;
			ll weight = it.s;
			if(weight + dijkstra[curr.s] == dijkstra[next]){
				parents[next].insert(curr.s);
			}
			if(weight + dijkstra[curr.s] < dijkstra[next]){
				parents[next].clear();
				parents[next].insert(curr.s);
				dijkstra[next] = weight + dijkstra[curr.s];
				pq.push({dijkstra[next], next});
			}
		}
	}
	queue<int> q;
	q.push(T);
	while(!q.empty()){
		int top = q.front(); q.pop();
		for(int u : parents[top]){
			if(!vis[u]){
				adj[u].pb({top,0});
				adj[top].pb({u,0});
				vis[u] = true;
				q.push(u);
			}
		}
	}
	dijkstra2[U] = 0;
	pq.push({0, U});
	while(!pq.empty()){
		pii curr = pq.top(); pq.pop();
		if(dijkstra2[curr.s] != curr.f)continue;
		for(auto it : adj[curr.s]){
			ll next = it.f;
			ll weight = it.s;
			if(weight + dijkstra2[curr.s] < dijkstra2[next]){
				//cout << curr.s << " " << next << " " << weight << '\n';
				dijkstra2[next] = weight+dijkstra2[curr.s];
				pq.push({dijkstra2[next], next});
			}
		}
	}
	cout << dijkstra2[V] << '\n';




}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 298 ms 25436 KB Output is correct
2 Correct 326 ms 32224 KB Output is correct
3 Correct 355 ms 33652 KB Output is correct
4 Correct 313 ms 31204 KB Output is correct
5 Correct 362 ms 35296 KB Output is correct
6 Correct 309 ms 28516 KB Output is correct
7 Correct 361 ms 34024 KB Output is correct
8 Correct 347 ms 33760 KB Output is correct
9 Correct 285 ms 28512 KB Output is correct
10 Correct 264 ms 29152 KB Output is correct
11 Correct 173 ms 23908 KB Output is correct
12 Correct 296 ms 28512 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 341 ms 27488 KB Output is correct
2 Correct 335 ms 27788 KB Output is correct
3 Correct 353 ms 30820 KB Output is correct
4 Correct 354 ms 31356 KB Output is correct
5 Correct 353 ms 31588 KB Output is correct
6 Correct 374 ms 33296 KB Output is correct
7 Correct 365 ms 35420 KB Output is correct
8 Correct 335 ms 31464 KB Output is correct
9 Correct 342 ms 31584 KB Output is correct
10 Correct 345 ms 31072 KB Output is correct
11 Correct 180 ms 24680 KB Output is correct
12 Correct 340 ms 33376 KB Output is correct

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 9196 KB Output is correct
2 Correct 5 ms 7404 KB Output is correct
3 Incorrect 5 ms 7404 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 298 ms 25436 KB Output is correct
2 Correct 326 ms 32224 KB Output is correct
3 Correct 355 ms 33652 KB Output is correct
4 Correct 313 ms 31204 KB Output is correct
5 Correct 362 ms 35296 KB Output is correct
6 Correct 309 ms 28516 KB Output is correct
7 Correct 361 ms 34024 KB Output is correct
8 Correct 347 ms 33760 KB Output is correct
9 Correct 285 ms 28512 KB Output is correct
10 Correct 264 ms 29152 KB Output is correct
11 Correct 173 ms 23908 KB Output is correct
12 Correct 296 ms 28512 KB Output is correct
13 Correct 341 ms 27488 KB Output is correct
14 Correct 335 ms 27788 KB Output is correct
15 Correct 353 ms 30820 KB Output is correct
16 Correct 354 ms 31356 KB Output is correct
17 Correct 353 ms 31588 KB Output is correct
18 Correct 374 ms 33296 KB Output is correct
19 Correct 365 ms 35420 KB Output is correct
20 Correct 335 ms 31464 KB Output is correct
21 Correct 342 ms 31584 KB Output is correct
22 Correct 345 ms 31072 KB Output is correct
23 Correct 180 ms 24680 KB Output is correct
24 Correct 340 ms 33376 KB Output is correct
25 Correct 15 ms 9196 KB Output is correct
26 Correct 5 ms 7404 KB Output is correct
27 Incorrect 5 ms 7404 KB Output isn't correct
28 Halted 0 ms 0 KB -