oj.uz

Submission #766317

# Submission time Handle Problem Language Result Execution time Memory
766317 2023-06-25T13:38:48 Z OrazB Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 297 ms 28996 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

ll 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), 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<pii,ll>, vector<pair<pii,ll>>, greater<pair<pii,ll>>> q;
	q.push({{0, s}, 0});
	dis[s] = 0;
	while(!q.empty()){
		ll w = q.top().ff.ff;
		int x = q.top().ff.ss, pr = q.top().ss;
		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 : E[x]){
			if (dis[i.ff] >= dis[x]+i.ss){
				dis[i.ff] = dis[x]+i.ss;
				q.push({{dis[i.ff], i.ff}, x});
			}
		}
	}
	cout << min(canu[t]+canv[t], disv[u]);
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 241 ms 22912 KB Output is correct
2 Correct 222 ms 20148 KB Output is correct
3 Correct 226 ms 19700 KB Output is correct
4 Correct 251 ms 22308 KB Output is correct
5 Correct 220 ms 20076 KB Output is correct
6 Correct 258 ms 22792 KB Output is correct
7 Correct 216 ms 19784 KB Output is correct
8 Correct 244 ms 20540 KB Output is correct
9 Correct 265 ms 20088 KB Output is correct
10 Correct 178 ms 20308 KB Output is correct
11 Correct 72 ms 11776 KB Output is correct
12 Correct 280 ms 20248 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 289 ms 20604 KB Output is correct
2 Correct 288 ms 19788 KB Output is correct
3 Correct 286 ms 20252 KB Output is correct
4 Correct 297 ms 20252 KB Output is correct
5 Correct 251 ms 20160 KB Output is correct
6 Correct 255 ms 19904 KB Output is correct
7 Correct 250 ms 19940 KB Output is correct
8 Correct 234 ms 20184 KB Output is correct
9 Correct 241 ms 20264 KB Output is correct
10 Correct 236 ms 19824 KB Output is correct
11 Correct 62 ms 11852 KB Output is correct
12 Correct 213 ms 20372 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4308 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 16 ms 6600 KB Output is correct
5 Correct 7 ms 4472 KB Output is correct
6 Correct 2 ms 2772 KB Output is correct
7 Correct 3 ms 2772 KB Output is correct
8 Correct 3 ms 2900 KB Output is correct
9 Correct 2 ms 2772 KB Output is correct
10 Correct 7 ms 4348 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 2 ms 2668 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2684 KB Output is correct
15 Correct 3 ms 2772 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 241 ms 22912 KB Output is correct
2 Correct 222 ms 20148 KB Output is correct
3 Correct 226 ms 19700 KB Output is correct
4 Correct 251 ms 22308 KB Output is correct
5 Correct 220 ms 20076 KB Output is correct
6 Correct 258 ms 22792 KB Output is correct
7 Correct 216 ms 19784 KB Output is correct
8 Correct 244 ms 20540 KB Output is correct
9 Correct 265 ms 20088 KB Output is correct
10 Correct 178 ms 20308 KB Output is correct
11 Correct 72 ms 11776 KB Output is correct
12 Correct 280 ms 20248 KB Output is correct
13 Correct 289 ms 20604 KB Output is correct
14 Correct 288 ms 19788 KB Output is correct
15 Correct 286 ms 20252 KB Output is correct
16 Correct 297 ms 20252 KB Output is correct
17 Correct 251 ms 20160 KB Output is correct
18 Correct 255 ms 19904 KB Output is correct
19 Correct 250 ms 19940 KB Output is correct
20 Correct 234 ms 20184 KB Output is correct
21 Correct 241 ms 20264 KB Output is correct
22 Correct 236 ms 19824 KB Output is correct
23 Correct 62 ms 11852 KB Output is correct
24 Correct 213 ms 20372 KB Output is correct
25 Correct 8 ms 4308 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 16 ms 6600 KB Output is correct
29 Correct 7 ms 4472 KB Output is correct
30 Correct 2 ms 2772 KB Output is correct
31 Correct 3 ms 2772 KB Output is correct
32 Correct 3 ms 2900 KB Output is correct
33 Correct 2 ms 2772 KB Output is correct
34 Correct 7 ms 4348 KB Output is correct
35 Correct 1 ms 2644 KB Output is correct
36 Correct 2 ms 2668 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 2 ms 2684 KB Output is correct
39 Correct 3 ms 2772 KB Output is correct
40 Correct 239 ms 28656 KB Output is correct
41 Correct 223 ms 24552 KB Output is correct
42 Correct 227 ms 24724 KB Output is correct
43 Correct 62 ms 13900 KB Output is correct
44 Correct 63 ms 13968 KB Output is correct
45 Correct 218 ms 23368 KB Output is correct
46 Correct 190 ms 23336 KB Output is correct
47 Correct 258 ms 26604 KB Output is correct
48 Correct 62 ms 13400 KB Output is correct
49 Correct 204 ms 28996 KB Output is correct
50 Correct 219 ms 23736 KB Output is correct
51 Correct 186 ms 23616 KB Output is correct