oj.uz

Submission #662634

# Submission time Handle Problem Language Result Execution time Memory
662634 2022-11-26T11:21:44 Z Ninja_Kunai Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 486 ms 28224 KB 
/**
*    Author :  Nguyen Tuan Vu
*    Created : 26.11.2022
**/

#pragma GCC optimize("O2")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#define MASK(x) ((1)<<(x))
#define BIT(x, i) (((x)>>(i))&(1))
#define ALL(v)  (v).begin(), (v).end()
#define REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define FOR(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define FORD(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i)
#define db(val) "["#val" = "<<(val)<<"] "
#define TIME  (1.0 * clock() / CLOCKS_PER_SEC)

template <class X, class Y> bool minimize(X &a, Y b) {
    if (a > b) return a = b, true;
    return false;
}
template <class X, class Y> bool maximize(X &a, Y b) {
    if (a < b) return a = b, true;
    return false;
}

using namespace std;

mt19937 jdg(chrono::steady_clock::now().time_since_epoch().count());
int Rand(int l, int r) {return l + jdg() % (r - l + 1);}

void file(){
    #define TASK "TASK"
    if(fopen(TASK".in", "r")) {
        freopen(TASK".in", "r", stdin);
        freopen(TASK".out", "w", stdout);
    }
}

const int N = 1e5 + 5;
int n, m, st[2], en[2];
long long dp[2][N], f[N][2][2], ans;
vector <pair <int, int>> adj[N];

void dijkstra(int x, long long dp[]) {
	FOR(i, 1, n) dp[i] = 1e18 + 7;
	priority_queue <pair <long long, int>, vector <pair <long long, int>>, greater <pair <long long, int>>> heap;
	heap.push({dp[x] = 0, x});

	while (heap.size()) {
		auto [du, u] = heap.top();
		heap.pop();

		if (du != dp[u]) continue;
		for (auto v : adj[u]) if (minimize(dp[v.second], dp[u] + v.first)) {
			heap.push({dp[v.second], v.second});
		}
	}
}

bool check(int u, int w, int v, int type) {
	if (type == 0)
		return (dp[0][u] + w + dp[1][v] == dp[0][en[0]]);
	return (dp[0][v] + w + dp[1][u] == dp[0][en[0]]);
}

void dijkstra2(int mask) {
    FOR(i, 1, n) REP(j, 2) REP(k, 2) f[i][j][k] = 1e18 + 7;
    #define iii pair <long long, tuple <int, int, int>>
    priority_queue <iii, vector <iii>, greater <iii>> heap;
    heap.push({f[st[1]][0][0] = 0, {st[1], 0, 0}});

    //cout << check(1, 1, 2) << '\n';

    while (heap.size()) {
    	auto [du, tmp] = heap.top();
    	auto [u, type, type2] = tmp;
    	heap.pop();
    	if (du != f[u][type][type2]) continue;
    	//cout << u << ' ' << type << ' ' << type2 << ' ' << f[u][type][type2] << '\n';
    	for (auto v : adj[u]) {
    		if (type == 0) {
    			if (minimize(f[v.second][type][type2], f[u][type][type2] + v.first)) {
    				heap.push({f[v.second][type][type2], {v.second, type, type2}});
    			}

    			if (check(u, v.first, v.second, mask)) {
    				if (minimize(f[v.second][1][1], f[u][type][type2])) {
    					heap.push({f[v.second][1][1], {v.second, 1, 1}});
    				}
    			}
    		}
    		else {
    			if (type2 == 0) {
	    			if (minimize(f[v.second][type][type2], f[u][type][type2] + v.first)) {
	    				heap.push({f[v.second][type][type2], {v.second, type, type2}});
	    			}
    			}
    			else {
 	    			if (minimize(f[v.second][type][0], f[u][type][type2] + v.first)) {
	    				heap.push({f[v.second][type][0], {v.second, type, 0}});
	    			}

	    			if (check(u, v.first, v.second, mask)) {
	    				if (minimize(f[v.second][1][1], f[u][type][type2])) {
	    					heap.push({f[v.second][1][1], {v.second, 1, 1}});
	    				}
	    			}
    			}
    		}
    	}
    }

    minimize(ans, min({f[en[1]][0][0], f[en[1]][1][0], f[en[1]][1][1]}));
}

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    file();
    ans = 1e18 + 7;
    cin >> n >> m;
    cin >> st[0] >> en[0];
    cin >> st[1] >> en[1];
    FOR(i, 1, m) {
    	int u, v, w; cin >> u >> v >> w;
    	adj[u].push_back({w, v});
    	adj[v].push_back({w, u});
    }

    dijkstra(st[0], dp[0]);
    dijkstra(en[0], dp[1]);

    //FOR(i, 1, n) cout << dp[0][i] << ' ' << dp[1][i] << '\n';

    dijkstra2(0);
    dijkstra2(1);
    cout << ans;

    cerr << "Time elapsed: " << TIME << " s.\n";
    return 0;
}

/*
==================================================+
INPUT:                                            |
--------------------------------------------------|

--------------------------------------------------|
==================================================+
OUTPUT:                                           |
--------------------------------------------------|

--------------------------------------------------|
==================================================+
*/

Compilation message

commuter_pass.cpp: In function 'void file()':
commuter_pass.cpp:35:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |         freopen(TASK".in", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
commuter_pass.cpp:36:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |         freopen(TASK".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 359 ms 26832 KB Output is correct
2 Correct 427 ms 22928 KB Output is correct
3 Correct 431 ms 26500 KB Output is correct
4 Correct 361 ms 23388 KB Output is correct
5 Correct 375 ms 24648 KB Output is correct
6 Correct 352 ms 27096 KB Output is correct
7 Correct 422 ms 24696 KB Output is correct
8 Correct 395 ms 24636 KB Output is correct
9 Correct 390 ms 22932 KB Output is correct
10 Correct 318 ms 22836 KB Output is correct
11 Correct 141 ms 14228 KB Output is correct
12 Correct 386 ms 23332 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 417 ms 23292 KB Output is correct
2 Correct 440 ms 22744 KB Output is correct
3 Correct 443 ms 26296 KB Output is correct
4 Correct 419 ms 22748 KB Output is correct
5 Correct 428 ms 22896 KB Output is correct
6 Correct 408 ms 24968 KB Output is correct
7 Correct 486 ms 26248 KB Output is correct
8 Correct 427 ms 22992 KB Output is correct
9 Correct 429 ms 22880 KB Output is correct
10 Correct 434 ms 22732 KB Output is correct
11 Correct 194 ms 15696 KB Output is correct
12 Correct 410 ms 24964 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 3796 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2772 KB Output is correct
4 Correct 14 ms 4772 KB Output is correct
5 Correct 9 ms 3832 KB Output is correct
6 Correct 2 ms 2772 KB Output is correct
7 Correct 3 ms 2872 KB Output is correct
8 Correct 4 ms 2900 KB Output is correct
9 Correct 3 ms 2772 KB Output is correct
10 Correct 10 ms 3840 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2772 KB Output is correct
14 Correct 3 ms 2772 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 359 ms 26832 KB Output is correct
2 Correct 427 ms 22928 KB Output is correct
3 Correct 431 ms 26500 KB Output is correct
4 Correct 361 ms 23388 KB Output is correct
5 Correct 375 ms 24648 KB Output is correct
6 Correct 352 ms 27096 KB Output is correct
7 Correct 422 ms 24696 KB Output is correct
8 Correct 395 ms 24636 KB Output is correct
9 Correct 390 ms 22932 KB Output is correct
10 Correct 318 ms 22836 KB Output is correct
11 Correct 141 ms 14228 KB Output is correct
12 Correct 386 ms 23332 KB Output is correct
13 Correct 417 ms 23292 KB Output is correct
14 Correct 440 ms 22744 KB Output is correct
15 Correct 443 ms 26296 KB Output is correct
16 Correct 419 ms 22748 KB Output is correct
17 Correct 428 ms 22896 KB Output is correct
18 Correct 408 ms 24968 KB Output is correct
19 Correct 486 ms 26248 KB Output is correct
20 Correct 427 ms 22992 KB Output is correct
21 Correct 429 ms 22880 KB Output is correct
22 Correct 434 ms 22732 KB Output is correct
23 Correct 194 ms 15696 KB Output is correct
24 Correct 410 ms 24964 KB Output is correct
25 Correct 14 ms 3796 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 2 ms 2772 KB Output is correct
28 Correct 14 ms 4772 KB Output is correct
29 Correct 9 ms 3832 KB Output is correct
30 Correct 2 ms 2772 KB Output is correct
31 Correct 3 ms 2872 KB Output is correct
32 Correct 4 ms 2900 KB Output is correct
33 Correct 3 ms 2772 KB Output is correct
34 Correct 10 ms 3840 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct
36 Correct 2 ms 2644 KB Output is correct
37 Correct 2 ms 2772 KB Output is correct
38 Correct 3 ms 2772 KB Output is correct
39 Correct 3 ms 2772 KB Output is correct
40 Correct 389 ms 28224 KB Output is correct
41 Correct 374 ms 20820 KB Output is correct
42 Correct 391 ms 20740 KB Output is correct
43 Correct 216 ms 15888 KB Output is correct
44 Correct 212 ms 14936 KB Output is correct
45 Correct 442 ms 24696 KB Output is correct
46 Correct 447 ms 25984 KB Output is correct
47 Correct 353 ms 26508 KB Output is correct
48 Correct 210 ms 15156 KB Output is correct
49 Correct 335 ms 27452 KB Output is correct
50 Correct 451 ms 24784 KB Output is correct
51 Correct 403 ms 24784 KB Output is correct