oj.uz

Submission #319649

# Submission time Handle Problem Language Result Execution time Memory
319649 2020-11-06T02:50:37 Z Gilgamesh Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 366 ms 23004 KB 
#include <bits/stdc++.h>
//#include <bits/extc++.h>
//#include <ext/pb_ds/assoc_container.hpp> // Common file
//#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
 
using namespace std;
//using namespace __gnu_pbds;
//template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using ull = unsigned ll;
 
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define x first
#define y second

//const int MOD = 1e9 + 7;
const int MOD = 998244353;
const int dx[] = {0, 0, 1, -1};
const int dy[] = {1, -1, 0, 0}; 
const char dir[] = {'R', 'L', 'D', 'U'};
 /*
int add(int a, int b){ //(a + b) % 1e9 + 7
    a += b;
    if(a < 0){
        a += MOD;
    }
    if(a >= MOD){
        a -= MOD;
    }
    return a;
}
 
int sub(int a, int b){
    a -= b;
    if(a < 0) a += MOD;
    return a;
}
 
int mult(int a, int b){
    return ((ll) a * b) % MOD;
}*/
 
void setIO() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
//    freopen((s+".in").c_str(),"r",stdin);
//    freopen((s+".text").c_str(),"w",stdout);
}

const int mxN = 100'000;

int n, m, s, t, u, v;
vector<pii> adj[mxN];
ll du[mxN], dv[mxN], ds[mxN];
ll dp[2][mxN];
ll ans;

void dijkstra(int src, ll dist[]){
	for (int i = 0; i < n; ++i) dist[i] = LLONG_MAX;
    using T = pair<ll,int>; priority_queue<T,vector<T>,greater<T>> pq;
    dist[src] = 0;
    pq.push({0, src});
    while (pq.size()) {
        ll cdist; int node; tie(cdist, node) = pq.top(); pq.pop();
        if (cdist != dist[node]) continue;
        for (pair<int, int> i : adj[node]) {
            if (cdist+i.second < dist[i.first]) {
                pq.push({dist[i.first] = cdist+i.second, i.first});
            }
        }
    }
}

ll solve(int start, int end){
	bool visited[mxN];
	fill(visited, visited + mxN, false);
    priority_queue<pair<ll, pii>, vector<pair<ll, pii>>, greater<pair<ll, pii>>> pq;
    pq.push(mp(0, mp(start, 0)));
    while (!pq.empty()) {
    	auto cur = pq.top(); pq.pop();
        ll c = cur.x;
        int node = cur.y.x;
        int par = cur.y.y;
        if (!visited[node]) {
            ds[node] = c;
            visited[node] = true;
            dp[0][node] = min(dp[0][par], du[node]);
            dp[1][node] = min(dp[1][par], dv[node]);
            for (auto& i : adj[node]) pq.push({c + i.y, mp(i.x, node)});
        } else {
        	if(c == ds[node] && min(du[node], dp[0][par]) + min(dv[node], dp[1][par]) <= dp[0][node] + dp[1][node]){
        		dp[0][node] = min(du[node], dp[0][par]);
        		dp[1][node] = min(dv[node], dp[1][par]);
        	}
        }
    }
    return dp[0][end] + dp[1][end];
}

signed main(){
    setIO();
    //CHECK FOR LONG LONG!!!
    //LONG LONG OVERFLOW??
    cin >> n >> m >> s >> t >> u >> v; --s; --t; --u; --v;
    for(int i = 0; i < m; ++i){
    	int a, b, c; cin >> a >> b >> c; --a; --b;
    	adj[a].eb(mp(b, c));
    	adj[b].eb(mp(a, c));
    }
    memset(dp, 0x3f, sizeof dp);
    dijkstra(u, du);
    dijkstra(v, dv);
    ans = min(du[v], solve(s, t));
    cout << ans << "\n";
    //CHECK FOR LONG LONG!!!
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 356 ms 22872 KB Output is correct
2 Correct 330 ms 20880 KB Output is correct
3 Correct 324 ms 19904 KB Output is correct
4 Correct 358 ms 22896 KB Output is correct
5 Correct 327 ms 19640 KB Output is correct
6 Correct 365 ms 23004 KB Output is correct
7 Correct 345 ms 20736 KB Output is correct
8 Correct 335 ms 20660 KB Output is correct
9 Correct 356 ms 21448 KB Output is correct
10 Correct 322 ms 21576 KB Output is correct
11 Correct 131 ms 12004 KB Output is correct
12 Correct 363 ms 21396 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 353 ms 20920 KB Output is correct
2 Correct 344 ms 19600 KB Output is correct
3 Correct 335 ms 19472 KB Output is correct
4 Correct 342 ms 19472 KB Output is correct
5 Correct 340 ms 19572 KB Output is correct
6 Correct 324 ms 19688 KB Output is correct
7 Correct 336 ms 19512 KB Output is correct
8 Correct 356 ms 19472 KB Output is correct
9 Correct 332 ms 19488 KB Output is correct
10 Correct 341 ms 19720 KB Output is correct
11 Correct 127 ms 11876 KB Output is correct
12 Correct 324 ms 19732 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 6120 KB Output is correct
2 Correct 4 ms 4460 KB Output is correct
3 Correct 4 ms 4460 KB Output is correct
4 Correct 34 ms 7644 KB Output is correct
5 Correct 19 ms 6628 KB Output is correct
6 Correct 4 ms 4460 KB Output is correct
7 Correct 5 ms 4588 KB Output is correct
8 Correct 6 ms 4588 KB Output is correct
9 Correct 4 ms 4588 KB Output is correct
10 Correct 18 ms 6128 KB Output is correct
11 Correct 3 ms 4332 KB Output is correct
12 Correct 4 ms 4460 KB Output is correct
13 Correct 3 ms 4460 KB Output is correct
14 Correct 4 ms 4460 KB Output is correct
15 Correct 4 ms 4460 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 356 ms 22872 KB Output is correct
2 Correct 330 ms 20880 KB Output is correct
3 Correct 324 ms 19904 KB Output is correct
4 Correct 358 ms 22896 KB Output is correct
5 Correct 327 ms 19640 KB Output is correct
6 Correct 365 ms 23004 KB Output is correct
7 Correct 345 ms 20736 KB Output is correct
8 Correct 335 ms 20660 KB Output is correct
9 Correct 356 ms 21448 KB Output is correct
10 Correct 322 ms 21576 KB Output is correct
11 Correct 131 ms 12004 KB Output is correct
12 Correct 363 ms 21396 KB Output is correct
13 Correct 353 ms 20920 KB Output is correct
14 Correct 344 ms 19600 KB Output is correct
15 Correct 335 ms 19472 KB Output is correct
16 Correct 342 ms 19472 KB Output is correct
17 Correct 340 ms 19572 KB Output is correct
18 Correct 324 ms 19688 KB Output is correct
19 Correct 336 ms 19512 KB Output is correct
20 Correct 356 ms 19472 KB Output is correct
21 Correct 332 ms 19488 KB Output is correct
22 Correct 341 ms 19720 KB Output is correct
23 Correct 127 ms 11876 KB Output is correct
24 Correct 324 ms 19732 KB Output is correct
25 Correct 18 ms 6120 KB Output is correct
26 Correct 4 ms 4460 KB Output is correct
27 Correct 4 ms 4460 KB Output is correct
28 Correct 34 ms 7644 KB Output is correct
29 Correct 19 ms 6628 KB Output is correct
30 Correct 4 ms 4460 KB Output is correct
31 Correct 5 ms 4588 KB Output is correct
32 Correct 6 ms 4588 KB Output is correct
33 Correct 4 ms 4588 KB Output is correct
34 Correct 18 ms 6128 KB Output is correct
35 Correct 3 ms 4332 KB Output is correct
36 Correct 4 ms 4460 KB Output is correct
37 Correct 3 ms 4460 KB Output is correct
38 Correct 4 ms 4460 KB Output is correct
39 Correct 4 ms 4460 KB Output is correct
40 Correct 338 ms 22932 KB Output is correct
41 Correct 359 ms 21516 KB Output is correct
42 Correct 351 ms 21548 KB Output is correct
43 Correct 128 ms 11908 KB Output is correct
44 Correct 127 ms 12024 KB Output is correct
45 Correct 319 ms 19540 KB Output is correct
46 Correct 321 ms 19276 KB Output is correct
47 Correct 366 ms 20676 KB Output is correct
48 Correct 131 ms 11364 KB Output is correct
49 Correct 315 ms 22536 KB Output is correct
50 Correct 325 ms 19516 KB Output is correct
51 Correct 309 ms 19384 KB Output is correct