oj.uz

Submission #389777

# Submission time Handle Problem Language Result Execution time Memory
389777 2021-04-14T14:09:32 Z cpp219 Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 611 ms 39432 KB 
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define fs first
#define sc second
using namespace std;
typedef pair<ll,ll> LL;
const ll N = 2e5 + 9;
const ll inf = 1e16 + 7;

struct Edge{
    ll u,v,w;
};
Edge a[N];
ll S,T,U,V,n,m,u,v,w,d[N],D[2][N],dp[N][5];
vector<LL> g[N];

void Dij(ll scr,ll cond){
    fill(d,d + n + 1,inf); d[scr] = 0;
    priority_queue<LL,vector<LL>,greater<LL>> pq; pq.push({0,scr});
    while(!pq.empty()){
        LL t = pq.top(); pq.pop();
        ll u = t.sc;
        for (auto i : g[u]){
            ll v = i.fs,L = i.sc;
            if (d[v] > d[u] + L) d[v] = d[u] + L,pq.push({d[v],v});
        }
    }
    for (ll i = 1;i <= n;i++) D[cond][i] = d[i];
}

bool Is_in(ll u,ll v,ll w){
    ll lens = D[0][T];
    if (D[0][u] + D[1][v] + w == lens||D[0][v] + D[1][u] + w == lens) return 1;
    return 0;
}

bool direct(ll u,ll v){
    return (D[0][u] < D[0][v]);
}

struct Node{
    ll val,cur,cond;
};

bool operator < (Node a,Node b){
    return a.val > b.val;
}
priority_queue<Node> pq;

void update(ll u,ll cond,ll val){
    if (dp[u][cond] <= val) return;
    dp[u][cond] = val; pq.push({val,u,cond});
}

/// 0 not in    1 in but small -> big   2 in but big -> small     3 out
void Find_opt(ll scr){
    for (ll i = 1;i <= n;i++)
        for (ll j = 0;j < 5;j++) dp[i][j] = inf;
    dp[scr][0] = 0; pq.push({0,scr,0});
    while(!pq.empty()){
        Node t = pq.top(); pq.pop();
        ll u = t.cur,now = t.cond;
        for (auto i : g[u]){
            ll v = i.fs,L = i.sc;
            if (Is_in(u,v,L)){
                if (!now){
                    if (direct(u,v)) update(v,1,dp[u][now]);
                    else update(v,2,dp[u][now]);
                }
                if (now == 1 && direct(u,v)) update(v,1,dp[u][now]);
                if (now == 2 && !direct(u,v)) update(v,2,dp[u][now]);
            }
            ll nxt = now;
            if (now == 1 || now == 2) nxt = 3;
            if (dp[v][nxt] > dp[u][now] + L) dp[v][nxt] = dp[u][now] + L,pq.push({dp[v][nxt],v,nxt});
        }
    }
    //cout<<direct(3,2); exit(0);
    //cout<<dp[4][0]<<" "<<dp[1][1]<<" "<<dp[4][2]<<" "<<dp[4][3]; exit(0);
    cout<<min(min(dp[V][0],min(dp[V][1],dp[V][2])),dp[V][3]);
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #define task "tst"
    if (fopen(task".inp","r")){
        freopen(task".inp","r",stdin);
        //freopen(task".out","w",stdout);
    }
    cin>>n>>m>>S>>T>>U>>V;
    for (ll i = 1;i <= m;i++){
        cin>>u>>v>>w; a[i] = {u,v,w};
        g[u].push_back({v,w}); g[v].push_back({u,w});
    }
    Dij(S,0); Dij(T,1); Find_opt(U);
}

Compilation message

commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:88:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   88 |         freopen(task".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 410 ms 37184 KB Output is correct
2 Correct 498 ms 34424 KB Output is correct
3 Correct 538 ms 39324 KB Output is correct
4 Correct 382 ms 34712 KB Output is correct
5 Correct 511 ms 37420 KB Output is correct
6 Correct 438 ms 39432 KB Output is correct
7 Correct 555 ms 37480 KB Output is correct
8 Correct 549 ms 37572 KB Output is correct
9 Correct 433 ms 35256 KB Output is correct
10 Correct 327 ms 35488 KB Output is correct
11 Correct 174 ms 22564 KB Output is correct
12 Correct 475 ms 35228 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 521 ms 32656 KB Output is correct
2 Correct 540 ms 34504 KB Output is correct
3 Correct 571 ms 37504 KB Output is correct
4 Correct 543 ms 34424 KB Output is correct
5 Correct 543 ms 34484 KB Output is correct
6 Correct 512 ms 37916 KB Output is correct
7 Correct 611 ms 37488 KB Output is correct
8 Correct 544 ms 34512 KB Output is correct
9 Correct 556 ms 34444 KB Output is correct
10 Correct 543 ms 34444 KB Output is correct
11 Correct 205 ms 24096 KB Output is correct
12 Correct 515 ms 37684 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 6988 KB Output is correct
2 Correct 4 ms 5068 KB Output is correct
3 Correct 4 ms 5068 KB Output is correct
4 Correct 20 ms 8832 KB Output is correct
5 Correct 12 ms 6932 KB Output is correct
6 Correct 4 ms 5196 KB Output is correct
7 Correct 5 ms 5300 KB Output is correct
8 Correct 5 ms 5324 KB Output is correct
9 Correct 4 ms 5196 KB Output is correct
10 Correct 12 ms 6956 KB Output is correct
11 Correct 4 ms 5068 KB Output is correct
12 Correct 3 ms 5068 KB Output is correct
13 Correct 4 ms 5068 KB Output is correct
14 Correct 4 ms 5068 KB Output is correct
15 Correct 4 ms 5068 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 410 ms 37184 KB Output is correct
2 Correct 498 ms 34424 KB Output is correct
3 Correct 538 ms 39324 KB Output is correct
4 Correct 382 ms 34712 KB Output is correct
5 Correct 511 ms 37420 KB Output is correct
6 Correct 438 ms 39432 KB Output is correct
7 Correct 555 ms 37480 KB Output is correct
8 Correct 549 ms 37572 KB Output is correct
9 Correct 433 ms 35256 KB Output is correct
10 Correct 327 ms 35488 KB Output is correct
11 Correct 174 ms 22564 KB Output is correct
12 Correct 475 ms 35228 KB Output is correct
13 Correct 521 ms 32656 KB Output is correct
14 Correct 540 ms 34504 KB Output is correct
15 Correct 571 ms 37504 KB Output is correct
16 Correct 543 ms 34424 KB Output is correct
17 Correct 543 ms 34484 KB Output is correct
18 Correct 512 ms 37916 KB Output is correct
19 Correct 611 ms 37488 KB Output is correct
20 Correct 544 ms 34512 KB Output is correct
21 Correct 556 ms 34444 KB Output is correct
22 Correct 543 ms 34444 KB Output is correct
23 Correct 205 ms 24096 KB Output is correct
24 Correct 515 ms 37684 KB Output is correct
25 Correct 14 ms 6988 KB Output is correct
26 Correct 4 ms 5068 KB Output is correct
27 Correct 4 ms 5068 KB Output is correct
28 Correct 20 ms 8832 KB Output is correct
29 Correct 12 ms 6932 KB Output is correct
30 Correct 4 ms 5196 KB Output is correct
31 Correct 5 ms 5300 KB Output is correct
32 Correct 5 ms 5324 KB Output is correct
33 Correct 4 ms 5196 KB Output is correct
34 Correct 12 ms 6956 KB Output is correct
35 Correct 4 ms 5068 KB Output is correct
36 Correct 3 ms 5068 KB Output is correct
37 Correct 4 ms 5068 KB Output is correct
38 Correct 4 ms 5068 KB Output is correct
39 Correct 4 ms 5068 KB Output is correct
40 Correct 430 ms 38816 KB Output is correct
41 Correct 413 ms 33352 KB Output is correct
42 Correct 428 ms 33456 KB Output is correct
43 Correct 239 ms 24192 KB Output is correct
44 Correct 240 ms 24216 KB Output is correct
45 Correct 537 ms 37396 KB Output is correct
46 Correct 547 ms 37364 KB Output is correct
47 Correct 396 ms 36184 KB Output is correct
48 Correct 258 ms 23748 KB Output is correct
49 Correct 354 ms 38500 KB Output is correct
50 Correct 549 ms 37452 KB Output is correct
51 Correct 554 ms 37392 KB Output is correct