oj.uz

Submission #766334

# Submission time Handle Problem Language Result Execution time Memory
766334 2023-06-25T13:53:48 Z OrazB Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 284 ms 22816 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_set;
//Dijkstra->set
//set.find_by_order(x) x-position value
//set.order_of_key(x) number of strictly less elements don't need *set.??
#define N 100005
#define wr cout << "Continue debugging\n";
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <ll, ll>
#define pb push_back
#define ff first
#define ss second
 
int n, m, s, t, u, v;
vector<pii> E[N];
 
void dijk(int x, vector<ll>&dis){
	set<pii> s = {{0, x}};
	dis[x] = 0;
	while(!s.empty()){
		int x = (*s.begin()).ss;
		s.erase(s.begin());
		for (auto i : E[x]){
			if (dis[i.ff] > dis[x]+i.ss){
				s.erase({dis[i.ff], i.ff});
				dis[i.ff] = dis[x]+i.ss;
				s.insert({dis[i.ff], i.ff});
			}
		}
	}
}
 
int main ()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> m >> s >> t >> u >> v;
	while(m--){
		int x, y, w;
		cin >> x >> y >> w;
		E[x].pb({y, w});
		E[y].pb({x, w});
	}
	vector<ll> disu(n+1, 1e17), disv(n+1, 1e17), diss(n+1, 1e17);
	dijk(v, disv); dijk(u, disu);
	vector<ll> dis(n+1, 1e17);
	vector<ll> canu(n+1, 1e17), canv(n+1, 1e17);
	priority_queue<pii, vector<pii>, greater<pii>> q;
	q.push({0, s});
	dis[s] = 0;
	canu[s] = disu[s]; canv[s] = disv[s]; 
	while(!q.empty()){
		ll w = q.top().ff;
		int x = q.top().ss;
		q.pop();
		if (w != dis[x]) continue;
		for (auto i : E[x]){
			if (dis[i.ff] > dis[x]+i.ss){
				dis[i.ff] = dis[x]+i.ss;
				canv[i.ff] = min(canv[x], disv[i.ff]);
				canu[i.ff] = min(canu[x], disu[i.ff]);
				q.push({dis[i.ff], i.ff});
			}else if (dis[i.ff] == dis[x]+i.ss and canv[i.ff]+canu[i.ff] > min(canv[x], disv[i.ff])+min(canu[x], disu[i.ff])){
				canv[i.ff] = min(canv[x], disv[i.ff]);
				canu[i.ff] = min(canu[x], disu[i.ff]);
				q.push({dis[i.ff], i.ff});
			}
		}
	}
	cout << min(canu[t]+canv[t], disv[u]);
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 228 ms 21136 KB Output is correct
2 Correct 258 ms 20356 KB Output is correct
3 Correct 240 ms 19936 KB Output is correct
4 Correct 219 ms 21076 KB Output is correct
5 Correct 217 ms 19912 KB Output is correct
6 Correct 242 ms 21712 KB Output is correct
7 Correct 206 ms 20036 KB Output is correct
8 Correct 206 ms 20800 KB Output is correct
9 Correct 223 ms 19888 KB Output is correct
10 Correct 177 ms 20148 KB Output is correct
11 Correct 59 ms 12616 KB Output is correct
12 Correct 250 ms 20320 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 235 ms 20056 KB Output is correct
2 Correct 273 ms 19260 KB Output is correct
3 Correct 224 ms 20352 KB Output is correct
4 Correct 255 ms 19648 KB Output is correct
5 Correct 242 ms 20268 KB Output is correct
6 Correct 214 ms 20060 KB Output is correct
7 Correct 230 ms 19956 KB Output is correct
8 Correct 231 ms 19664 KB Output is correct
9 Correct 284 ms 20320 KB Output is correct
10 Correct 255 ms 20052 KB Output is correct
11 Correct 62 ms 12576 KB Output is correct
12 Correct 216 ms 20216 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 4052 KB Output is correct
2 Correct 3 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 11 ms 5428 KB Output is correct
5 Correct 7 ms 4052 KB Output is correct
6 Correct 2 ms 2772 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 3 ms 2772 KB Output is correct
9 Correct 2 ms 2772 KB Output is correct
10 Correct 6 ms 4052 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 1 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 228 ms 21136 KB Output is correct
2 Correct 258 ms 20356 KB Output is correct
3 Correct 240 ms 19936 KB Output is correct
4 Correct 219 ms 21076 KB Output is correct
5 Correct 217 ms 19912 KB Output is correct
6 Correct 242 ms 21712 KB Output is correct
7 Correct 206 ms 20036 KB Output is correct
8 Correct 206 ms 20800 KB Output is correct
9 Correct 223 ms 19888 KB Output is correct
10 Correct 177 ms 20148 KB Output is correct
11 Correct 59 ms 12616 KB Output is correct
12 Correct 250 ms 20320 KB Output is correct
13 Correct 235 ms 20056 KB Output is correct
14 Correct 273 ms 19260 KB Output is correct
15 Correct 224 ms 20352 KB Output is correct
16 Correct 255 ms 19648 KB Output is correct
17 Correct 242 ms 20268 KB Output is correct
18 Correct 214 ms 20060 KB Output is correct
19 Correct 230 ms 19956 KB Output is correct
20 Correct 231 ms 19664 KB Output is correct
21 Correct 284 ms 20320 KB Output is correct
22 Correct 255 ms 20052 KB Output is correct
23 Correct 62 ms 12576 KB Output is correct
24 Correct 216 ms 20216 KB Output is correct
25 Correct 10 ms 4052 KB Output is correct
26 Correct 3 ms 2644 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 11 ms 5428 KB Output is correct
29 Correct 7 ms 4052 KB Output is correct
30 Correct 2 ms 2772 KB Output is correct
31 Correct 2 ms 2772 KB Output is correct
32 Correct 3 ms 2772 KB Output is correct
33 Correct 2 ms 2772 KB Output is correct
34 Correct 6 ms 4052 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct
36 Correct 1 ms 2644 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 2 ms 2644 KB Output is correct
39 Correct 2 ms 2644 KB Output is correct
40 Correct 250 ms 22816 KB Output is correct
41 Correct 211 ms 20052 KB Output is correct
42 Correct 227 ms 20652 KB Output is correct
43 Correct 88 ms 12652 KB Output is correct
44 Correct 69 ms 12524 KB Output is correct
45 Correct 178 ms 20280 KB Output is correct
46 Correct 166 ms 19904 KB Output is correct
47 Correct 251 ms 21880 KB Output is correct
48 Correct 59 ms 12600 KB Output is correct
49 Correct 193 ms 22456 KB Output is correct
50 Correct 189 ms 20352 KB Output is correct
51 Correct 179 ms 19952 KB Output is correct