oj.uz

답안 #594012

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
594012 2022-07-11T22:11:05 Z urosk Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 306 ms 30332 KB 
#define here cerr<<"===========================================\n"
#include <bits/stdc++.h>
#define ld double
#define ll long long
#define llinf 100000000000000000LL // 10^17
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define sz(a) (ll)(a.size())
#define all(a) a.begin(),a.end()
#define ceri(a,l,r) {for(ll i_ = l;i_<=r;i_++) cerr<<a[i_]<< " ";cerr<<endl;}
#define daj_mi_malo_vremena ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);

using namespace std;
#define maxn 100005
ll n,m;
vector<pll> g[maxn];
vector<ll> dg[maxn];
ll s,t,u,v;
ll d1[maxn];
ll d2[maxn];
ll dpu[maxn];
ll dpv[maxn];
ll dp[maxn];
bool vis[maxn];
vector<ll> b;
void dis(ll* d,ll c){
    fill(d,d+n+1,llinf);
    d[c] = 0;
    priority_queue<pll> q;
    q.push({0,c});
    vector<bool> vis(n+1);
    while(sz(q)){
        ll u = q.top().sc;
        q.pop();
        if(vis[u]) continue;
        vis[u] = 1;
        for(pll p : g[u]){
            ll s = p.fi;
            ll w = p.sc;
            if(d[u]+w<d[s]){
                d[s] = d[u] + w;
                q.push({-d[s],s});
            }
        }
    }
    //cerr<<"source: "<<c<<endl;
    //ceri(d,1,n);
}
void top(ll u){
    vis[u] = 1;
    for(ll s : dg[u]){
        if(vis[s]) continue;
        top(s);
    }
    b.pb(u);
}
int main(){
	daj_mi_malo_vremena
    cin >> n >> m >> s >> t >> u >> v;
    for(ll i = 1;i<=m;i++){
        ll x,y,w; cin >> x >> y >> w;
        g[x].pb({y,w});
        g[y].pb({x,w});
    }
    dis(d1,s);
    dis(d2,t);
    for(ll i = 1;i<=n;i++){
        for(pll p : g[i]){
            ll j = p.fi;
            ll w = p.sc;
            if(d1[i] + w + d2[j]==d1[t]){
                dg[i].pb(j);
            }
        }
    }
    top(s);
    dis(d1,u);
    dis(d2,v);
    fill(dp,dp+n+1,llinf);
    fill(dpv,dpv+n+1,llinf);
    fill(dpu,dpu+n+1,llinf);
    for(ll x : b){
        dp[x] = d1[x] + d2[x];
        dpu[x] = d1[x];
        dpv[x] = d2[x];
        for(pll p : g[x]){
            ll y = p.fi;
            ll w = p.sc;
            dpu[x] = min(dpu[x],dpu[y]);
            dpv[x] = min(dpv[x],dpv[y]);
            dp[x] = min(dp[x],dp[y]);
        }
        dp[x] = min({dp[x],dpu[x]+d2[x],d1[x]+dpv[x]});
    }
    cout<<min(dp[s],d1[v])<<endl;
	return 0;
}
/*
6 6
1 6
1 4
1 2 1
2 3 1
3 5 1
2 4 3
4 5 2
5 6 1
*/

Compilation message

commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:93:16: warning: unused variable 'w' [-Wunused-variable]
   93 |             ll w = p.sc;
      |                ^

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 269 ms 23932 KB Output is correct
2 Correct 257 ms 25484 KB Output is correct
3 Correct 292 ms 30332 KB Output is correct
4 Correct 242 ms 23876 KB Output is correct
5 Correct 258 ms 26316 KB Output is correct
6 Correct 266 ms 24024 KB Output is correct
7 Correct 273 ms 26876 KB Output is correct
8 Correct 277 ms 26744 KB Output is correct
9 Correct 264 ms 23740 KB Output is correct
10 Correct 210 ms 23840 KB Output is correct
11 Correct 117 ms 19620 KB Output is correct
12 Correct 263 ms 23708 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 276 ms 26836 KB Output is correct
2 Correct 279 ms 26908 KB Output is correct
3 Correct 273 ms 26368 KB Output is correct
4 Correct 287 ms 26792 KB Output is correct
5 Correct 286 ms 27496 KB Output is correct
6 Correct 265 ms 29616 KB Output is correct
7 Correct 306 ms 30308 KB Output is correct
8 Correct 288 ms 26808 KB Output is correct
9 Correct 284 ms 27592 KB Output is correct
10 Correct 269 ms 26560 KB Output is correct
11 Correct 110 ms 21516 KB Output is correct
12 Correct 272 ms 29976 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 6836 KB Output is correct
2 Correct 3 ms 5032 KB Output is correct
3 Correct 3 ms 5032 KB Output is correct
4 Correct 17 ms 8444 KB Output is correct
5 Correct 9 ms 6740 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5204 KB Output is correct
8 Correct 4 ms 5216 KB Output is correct
9 Correct 3 ms 5084 KB Output is correct
10 Correct 9 ms 6776 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 3 ms 5032 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5112 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 269 ms 23932 KB Output is correct
2 Correct 257 ms 25484 KB Output is correct
3 Correct 292 ms 30332 KB Output is correct
4 Correct 242 ms 23876 KB Output is correct
5 Correct 258 ms 26316 KB Output is correct
6 Correct 266 ms 24024 KB Output is correct
7 Correct 273 ms 26876 KB Output is correct
8 Correct 277 ms 26744 KB Output is correct
9 Correct 264 ms 23740 KB Output is correct
10 Correct 210 ms 23840 KB Output is correct
11 Correct 117 ms 19620 KB Output is correct
12 Correct 263 ms 23708 KB Output is correct
13 Correct 276 ms 26836 KB Output is correct
14 Correct 279 ms 26908 KB Output is correct
15 Correct 273 ms 26368 KB Output is correct
16 Correct 287 ms 26792 KB Output is correct
17 Correct 286 ms 27496 KB Output is correct
18 Correct 265 ms 29616 KB Output is correct
19 Correct 306 ms 30308 KB Output is correct
20 Correct 288 ms 26808 KB Output is correct
21 Correct 284 ms 27592 KB Output is correct
22 Correct 269 ms 26560 KB Output is correct
23 Correct 110 ms 21516 KB Output is correct
24 Correct 272 ms 29976 KB Output is correct
25 Correct 9 ms 6836 KB Output is correct
26 Correct 3 ms 5032 KB Output is correct
27 Correct 3 ms 5032 KB Output is correct
28 Correct 17 ms 8444 KB Output is correct
29 Correct 9 ms 6740 KB Output is correct
30 Correct 3 ms 5076 KB Output is correct
31 Correct 3 ms 5204 KB Output is correct
32 Correct 4 ms 5216 KB Output is correct
33 Correct 3 ms 5084 KB Output is correct
34 Correct 9 ms 6776 KB Output is correct
35 Correct 3 ms 5076 KB Output is correct
36 Correct 3 ms 5032 KB Output is correct
37 Correct 3 ms 5076 KB Output is correct
38 Correct 3 ms 5076 KB Output is correct
39 Correct 3 ms 5112 KB Output is correct
40 Correct 232 ms 23908 KB Output is correct
41 Correct 248 ms 23664 KB Output is correct
42 Correct 254 ms 23744 KB Output is correct
43 Correct 122 ms 22464 KB Output is correct
44 Correct 116 ms 22428 KB Output is correct
45 Correct 277 ms 28688 KB Output is correct
46 Correct 263 ms 28424 KB Output is correct
47 Correct 250 ms 23832 KB Output is correct
48 Correct 143 ms 20276 KB Output is correct
49 Correct 211 ms 23652 KB Output is correct
50 Correct 256 ms 27728 KB Output is correct
51 Correct 260 ms 28612 KB Output is correct