oj.uz

Submission #307297

# Submission time Handle Problem Language Result Execution time Memory
307297 2020-09-27T15:00:15 Z Spongiforma Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 515 ms 28956 KB 
#include <bits/stdc++.h>
#define INF LLONG_MAX/2
#define sacnf scanf
#define scnf scanf
#define scnaf scanf
#define CRLF <<'\n';
#define ALL(v) v.begin,v.end()
#define SIZE(v) (int)v.size()
#define PRPAIR(x) x.first << x.second
#define DEBUG(x) do { std::cerr <<(x)<<'\n'; } while (0)
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;
typedef pair<int,ii> pip;
typedef vector<ll> vi;
#define N 100005
#define M 200005

int n,m,s,t,u,v;
vi ds,dt,du,dv;
vector<ii> adj[N];

void sssp(int i,vi &dist){
    dist.assign(n,INF);
    dist[i] = 0;
    priority_queue<ii,vector<ii>,greater<ii>> q;
    q.push({0,i});
    while(!q.empty()){
        ii a=q.top(); q.pop();
        ll d = a.first, u = a.second;
        if (dist[u] < d)
            continue;
        for(auto v: adj[u]){
            if (dist[u] + v.second < dist[v.first]){
                dist[v.first] = dist[u] + v.second;
                q.push({dist[v.first],v.first});
            }
        }
    }
}
bitset<N> onsp,vis;

vi g[N],g2[N];
ll mem1[N],mem2[N];

ll mutosp1(int i){
    if (mem1[i]!=-1)
        return mem1[i];
    if (i == s){
        mem1[i] = du[s];
        return mem1[i];
    }
    mem1[i] = du[i];
    for(auto v: adj[i]){
        if (dt[i] + v.second + ds[v.first] == ds[t])
            mem1[i] = min(mem1[i],mutosp1(v.first));
    }
    return mem1[i];
}
ll mutosp2(int i){
    if (mem2[i]!=-1)
        return mem2[i];

    if (i == t){
        mem2[i] = du[t];
        return mem2[i];
    }
    mem2[i] = du[i];
    for(auto v: adj[i]){
        if (ds[i] + v.second + dt[v.first] == ds[t])
            mem2[i] = min(mem2[i],mutosp2(v.first));
    }
    return mem2[i];
}

ll mem3[N],mem4[N];

ll dfs(int i){
    if (mem3[i] != -1)
        return mem3[i];
    ll minv=dv[i]+mem2[i];
    for(auto v: adj[i]){
        if (ds[i] + v.second + dt[v.first] == ds[t])
            minv = min(dfs(v.first),minv);
    }
    return mem3[i] = minv;
}


ll dfs2(int i){
    if (mem4[i] != -1)
        return mem4[i];
    ll minv=dv[i]+mem1[i];
    for(auto v: adj[i]){
        if (dt[i] + v.second + ds[v.first] == ds[t])
            minv = min(dfs2(v.first),minv);
    }
    return mem4[i]=minv;
}

int main(){
    scanf("%d%d%d%d%d%d",&n,&m,&s,&t,&u,&v);
    s--,t--,u--,v--;

    rep(i,0,m){
        ll a,b,c;
        scanf("%lld%lld%lld",&a,&b,&c);
        a--,b--;
        adj[a].emplace_back(b,c);
        adj[b].emplace_back(a,c);
    }
    sssp(s,ds),sssp(t,dt),sssp(u,du),sssp(v,dv);
    vis.reset();
    memset(mem1,-1,sizeof mem1);
    memset(mem2,-1,sizeof mem2);
    memset(mem3,-1,sizeof mem3);
    memset(mem4,-1,sizeof mem4);
    mutosp1(t);
    mutosp2(s);
    ll ans = dfs(s);
    ans = min(ans,dfs2(t));
    ans = min(du[v],ans);
    cout << ans;
}

Compilation message

commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:103:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  103 |     scanf("%d%d%d%d%d%d",&n,&m,&s,&t,&u,&v);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
commuter_pass.cpp:108:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  108 |         scanf("%lld%lld%lld",&a,&b,&c);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 422 ms 24372 KB Output is correct
2 Correct 445 ms 24216 KB Output is correct
3 Correct 504 ms 28956 KB Output is correct
4 Correct 411 ms 24120 KB Output is correct
5 Correct 464 ms 27684 KB Output is correct
6 Correct 443 ms 28064 KB Output is correct
7 Correct 503 ms 27640 KB Output is correct
8 Correct 487 ms 27704 KB Output is correct
9 Correct 404 ms 28412 KB Output is correct
10 Correct 346 ms 28296 KB Output is correct
11 Correct 228 ms 22776 KB Output is correct
12 Correct 416 ms 28380 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 456 ms 25580 KB Output is correct
2 Correct 455 ms 25848 KB Output is correct
3 Correct 456 ms 25660 KB Output is correct
4 Correct 451 ms 25588 KB Output is correct
5 Correct 462 ms 26008 KB Output is correct
6 Correct 469 ms 27060 KB Output is correct
7 Correct 485 ms 27248 KB Output is correct
8 Correct 467 ms 25996 KB Output is correct
9 Correct 479 ms 26204 KB Output is correct
10 Correct 449 ms 25596 KB Output is correct
11 Correct 232 ms 21880 KB Output is correct
12 Correct 485 ms 27196 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 11776 KB Output is correct
2 Correct 8 ms 10496 KB Output is correct
3 Correct 8 ms 10496 KB Output is correct
4 Correct 28 ms 13820 KB Output is correct
5 Correct 18 ms 12160 KB Output is correct
6 Correct 8 ms 10624 KB Output is correct
7 Correct 9 ms 10624 KB Output is correct
8 Correct 10 ms 10752 KB Output is correct
9 Correct 9 ms 10624 KB Output is correct
10 Correct 18 ms 12160 KB Output is correct
11 Correct 8 ms 10496 KB Output is correct
12 Correct 7 ms 10496 KB Output is correct
13 Correct 8 ms 10496 KB Output is correct
14 Correct 8 ms 10624 KB Output is correct
15 Correct 8 ms 10624 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 422 ms 24372 KB Output is correct
2 Correct 445 ms 24216 KB Output is correct
3 Correct 504 ms 28956 KB Output is correct
4 Correct 411 ms 24120 KB Output is correct
5 Correct 464 ms 27684 KB Output is correct
6 Correct 443 ms 28064 KB Output is correct
7 Correct 503 ms 27640 KB Output is correct
8 Correct 487 ms 27704 KB Output is correct
9 Correct 404 ms 28412 KB Output is correct
10 Correct 346 ms 28296 KB Output is correct
11 Correct 228 ms 22776 KB Output is correct
12 Correct 416 ms 28380 KB Output is correct
13 Correct 456 ms 25580 KB Output is correct
14 Correct 455 ms 25848 KB Output is correct
15 Correct 456 ms 25660 KB Output is correct
16 Correct 451 ms 25588 KB Output is correct
17 Correct 462 ms 26008 KB Output is correct
18 Correct 469 ms 27060 KB Output is correct
19 Correct 485 ms 27248 KB Output is correct
20 Correct 467 ms 25996 KB Output is correct
21 Correct 479 ms 26204 KB Output is correct
22 Correct 449 ms 25596 KB Output is correct
23 Correct 232 ms 21880 KB Output is correct
24 Correct 485 ms 27196 KB Output is correct
25 Correct 19 ms 11776 KB Output is correct
26 Correct 8 ms 10496 KB Output is correct
27 Correct 8 ms 10496 KB Output is correct
28 Correct 28 ms 13820 KB Output is correct
29 Correct 18 ms 12160 KB Output is correct
30 Correct 8 ms 10624 KB Output is correct
31 Correct 9 ms 10624 KB Output is correct
32 Correct 10 ms 10752 KB Output is correct
33 Correct 9 ms 10624 KB Output is correct
34 Correct 18 ms 12160 KB Output is correct
35 Correct 8 ms 10496 KB Output is correct
36 Correct 7 ms 10496 KB Output is correct
37 Correct 8 ms 10496 KB Output is correct
38 Correct 8 ms 10624 KB Output is correct
39 Correct 8 ms 10624 KB Output is correct
40 Correct 389 ms 27128 KB Output is correct
41 Correct 416 ms 27728 KB Output is correct
42 Correct 402 ms 27680 KB Output is correct
43 Correct 262 ms 23288 KB Output is correct
44 Correct 265 ms 23288 KB Output is correct
45 Correct 515 ms 28340 KB Output is correct
46 Correct 486 ms 27460 KB Output is correct
47 Correct 413 ms 27680 KB Output is correct
48 Correct 285 ms 21240 KB Output is correct
49 Correct 341 ms 27004 KB Output is correct
50 Correct 465 ms 27648 KB Output is correct
51 Correct 478 ms 27588 KB Output is correct