Submission #743343

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
743343	2023-05-17T10:06:38 Z	josanneo22	Commuter Pass (JOI18_commuter_pass)	C++17	100 / 100	308 ms	22340 KB

commuter_pass

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
 
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
 
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
 
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
 
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
 
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
 
const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;
 
int N,M,S,T,U,V;
 
 
template<int SZ> struct Dijkstra {
    ll dist[SZ];
    vpi adj[SZ];
    priority_queue<pl,vpl,greater<pl>> q;
    
    void addEdge(int A, int B, int C) {
        adj[A].pb({B,C}), adj[B].pb({A,C});
    }
    
    void gen(int st) {
        fill_n(dist,SZ,INF); 
        q = priority_queue<pl,vpl,greater<pl>>();
        
        dist[st] = 0; q.push({0,st});
    	while (sz(q)) {
    		pl x = q.top(); q.pop();
    		if (dist[x.s] < x.f) continue;
    		for (pi y: adj[x.s]) if (x.f+y.s < dist[y.f]) {
    			dist[y.f] = x.f+y.s;
    			q.push({dist[y.f],y.f});
    		}
    	}
    }
};
 
Dijkstra<MX> D;
ll dist[2][MX], DIST[2][MX];
pl mn[MX];
bool ok[MX];
 
pl comb(pl a, pl b) {
    return {min(a.f,b.f),min(a.s,b.s)};
}
 
int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N >> M >> S >> T >> U >> V;
    F0R(i,M) {
        int A,B,C; cin >> A >> B >> C;
        D.addEdge(A,B,C);
    }
    
    D.gen(U);
    FOR(i,1,N+1) dist[0][i] = D.dist[i];
    D.gen(V);
    FOR(i,1,N+1) dist[1][i] = D.dist[i];
    
    FOR(i,1,N+1) mn[i] = {INF,INF};
    D.gen(S);
    FOR(i,1,N+1) DIST[0][i] = D.dist[i];
    D.gen(T);
    FOR(i,1,N+1) DIST[1][i] = D.dist[i];
    
    ll ans = dist[0][V];
    vpl v; 
    FOR(i,1,N+1) if (DIST[0][i]+DIST[1][i] == DIST[0][T]) {
        ok[i] = 1;
        v.pb({DIST[0][i],i});
    }
    sort(v.rbegin(),v.rend());
    for (auto a: v) {
        for (auto t: D.adj[a.s]) if (ok[t.f]) mn[a.s] = comb(mn[a.s],mn[t.f]);
        ans = min(ans,min(mn[a.s].f+dist[1][a.s],mn[a.s].s+dist[0][a.s]));
        mn[a.s] = comb(mn[a.s],{dist[0][a.s],dist[1][a.s]});
    }
    cout << ans;
}

Subtask #1
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	244 ms	21384 KB	Output is correct
2	Correct	307 ms	19912 KB	Output is correct
3	Correct	280 ms	22340 KB	Output is correct
4	Correct	264 ms	20420 KB	Output is correct
5	Correct	261 ms	20484 KB	Output is correct
6	Correct	268 ms	21520 KB	Output is correct
7	Correct	286 ms	20784 KB	Output is correct
8	Correct	282 ms	20668 KB	Output is correct
9	Correct	263 ms	20540 KB	Output is correct
10	Correct	205 ms	20632 KB	Output is correct
11	Correct	124 ms	14540 KB	Output is correct
12	Correct	290 ms	20440 KB	Output is correct

Subtask #2
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	293 ms	20012 KB	Output is correct
2	Correct	301 ms	19932 KB	Output is correct
3	Correct	279 ms	19800 KB	Output is correct
4	Correct	250 ms	19800 KB	Output is correct
5	Correct	264 ms	20416 KB	Output is correct
6	Correct	308 ms	21264 KB	Output is correct
7	Correct	279 ms	21852 KB	Output is correct
8	Correct	257 ms	19840 KB	Output is correct
9	Correct	257 ms	20400 KB	Output is correct
10	Correct	258 ms	19784 KB	Output is correct
11	Correct	93 ms	14544 KB	Output is correct
12	Correct	273 ms	21196 KB	Output is correct

Subtask #3
24.0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	4564 KB	Output is correct
2	Correct	3 ms	3456 KB	Output is correct
3	Correct	3 ms	3456 KB	Output is correct
4	Correct	15 ms	5628 KB	Output is correct
5	Correct	11 ms	4492 KB	Output is correct
6	Correct	3 ms	3540 KB	Output is correct
7	Correct	3 ms	3640 KB	Output is correct
8	Correct	4 ms	3668 KB	Output is correct
9	Correct	3 ms	3540 KB	Output is correct
10	Correct	11 ms	4472 KB	Output is correct
11	Correct	3 ms	3452 KB	Output is correct
12	Correct	2 ms	3412 KB	Output is correct
13	Correct	2 ms	3540 KB	Output is correct
14	Correct	2 ms	3540 KB	Output is correct
15	Correct	3 ms	3464 KB	Output is correct

Subtask #4
45.0 / 45.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	244 ms	21384 KB	Output is correct
2	Correct	307 ms	19912 KB	Output is correct
3	Correct	280 ms	22340 KB	Output is correct
4	Correct	264 ms	20420 KB	Output is correct
5	Correct	261 ms	20484 KB	Output is correct
6	Correct	268 ms	21520 KB	Output is correct
7	Correct	286 ms	20784 KB	Output is correct
8	Correct	282 ms	20668 KB	Output is correct
9	Correct	263 ms	20540 KB	Output is correct
10	Correct	205 ms	20632 KB	Output is correct
11	Correct	124 ms	14540 KB	Output is correct
12	Correct	290 ms	20440 KB	Output is correct
13	Correct	293 ms	20012 KB	Output is correct
14	Correct	301 ms	19932 KB	Output is correct
15	Correct	279 ms	19800 KB	Output is correct
16	Correct	250 ms	19800 KB	Output is correct
17	Correct	264 ms	20416 KB	Output is correct
18	Correct	308 ms	21264 KB	Output is correct
19	Correct	279 ms	21852 KB	Output is correct
20	Correct	257 ms	19840 KB	Output is correct
21	Correct	257 ms	20400 KB	Output is correct
22	Correct	258 ms	19784 KB	Output is correct
23	Correct	93 ms	14544 KB	Output is correct
24	Correct	273 ms	21196 KB	Output is correct
25	Correct	8 ms	4564 KB	Output is correct
26	Correct	3 ms	3456 KB	Output is correct
27	Correct	3 ms	3456 KB	Output is correct
28	Correct	15 ms	5628 KB	Output is correct
29	Correct	11 ms	4492 KB	Output is correct
30	Correct	3 ms	3540 KB	Output is correct
31	Correct	3 ms	3640 KB	Output is correct
32	Correct	4 ms	3668 KB	Output is correct
33	Correct	3 ms	3540 KB	Output is correct
34	Correct	11 ms	4472 KB	Output is correct
35	Correct	3 ms	3452 KB	Output is correct
36	Correct	2 ms	3412 KB	Output is correct
37	Correct	2 ms	3540 KB	Output is correct
38	Correct	2 ms	3540 KB	Output is correct
39	Correct	3 ms	3464 KB	Output is correct
40	Correct	229 ms	21724 KB	Output is correct
41	Correct	286 ms	20504 KB	Output is correct
42	Correct	230 ms	20540 KB	Output is correct
43	Correct	129 ms	15592 KB	Output is correct
44	Correct	138 ms	15544 KB	Output is correct
45	Correct	277 ms	22092 KB	Output is correct
46	Correct	248 ms	21776 KB	Output is correct
47	Correct	237 ms	21356 KB	Output is correct
48	Correct	113 ms	15088 KB	Output is correct
49	Correct	239 ms	21444 KB	Output is correct
50	Correct	275 ms	21836 KB	Output is correct
51	Correct	267 ms	22016 KB	Output is correct

Submission #743343

Compilation message

Subtask #1 16.0 / 16.0

Subtask #2 15.0 / 15.0

Subtask #3 24.0 / 24.0

Subtask #4 45.0 / 45.0

Subtask #1
16.0 / 16.0

Subtask #2
15.0 / 15.0

Subtask #3
24.0 / 24.0

Subtask #4
45.0 / 45.0