oj.uz

Submission #235998

# Submission time Handle Problem Language Result Execution time Memory
235998 2020-05-30T16:03:25 Z Autoratch Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 449 ms 24344 KB 
#include <bits/stdc++.h>
using namespace std;
#define pii pair<long long,int> 

const int N = 1e5 + 1;

int n,m,s,t,u,v;
vector<pair<int,int> > adj[N];
long long dist[3][N],resu[N][2],resv[N][2];
bool visited[N],ins[N];
priority_queue<pii,vector<pii>,greater<pii> > q;
long long ans = LLONG_MAX;
int deg1[N],deg2[N];

void dijk(int x,long long (&dist)[N])
{
    for(int i = 1;i <= n;i++) dist[i] = LLONG_MAX,visited[i] = false;
    dist[x] = 0;
    q.push({0,x});
    while(!q.empty())
    {
        int u = q.top().second;
        q.pop();
        if(visited[u]) continue;
        visited[u] = true;
        for(auto [w,v] : adj[u]) if(dist[u]+w<dist[v])
        {
            dist[v] = dist[u]+w;
            q.push({dist[v],v});
        }
    }
}

void pre1(int u)
{
    if(visited[u]) return;
    visited[u] = true;
    for(auto [w,v] : adj[u]) if(dist[0][u]+w==dist[0][v]) deg1[v]++,pre1(v);
}

void pre2(int u)
{
    if(visited[u]) return;
    visited[u] = true;
    ins[u] = true;
    for(auto [w,v] : adj[u]) if(dist[0][v]+w==dist[0][u]) deg2[v]++,pre2(v);
}

void run1(int u)
{   
    for(auto [w,v] : adj[u]) if(dist[0][u]+w==dist[0][v]) 
    {
        deg1[v]--;
        resu[v][0] = min(resu[v][0],resu[u][0]),resv[v][0] = min(resv[v][0],resv[u][0]);
        if(!deg1[v]) run1(v);
    }
}

void run2(int u)
{
    for(auto [w,v] : adj[u]) if(dist[0][v]+w==dist[0][u])
    {
        deg2[v]--;
        resu[v][1] = min(resu[v][1],resu[u][1]),resv[v][1] = min(resv[v][1],resv[u][1]);
        if(!deg2[v]) run2(v);
    }
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);

    cin >> n >> m >> s >> t >> u >> v;
    for(int i = 0;i < m;i++)
    {
        int a,b,d;
        cin >> a >> b >> d;
        adj[a].push_back({d,b});
        adj[b].push_back({d,a});
    }
    dijk(s,dist[0]);
    dijk(u,dist[1]);
    dijk(v,dist[2]);
    for(int i = 1;i <= n;i++) visited[i] = false;
    pre1(s);
    for(int i = 1;i <= n;i++) visited[i] = false;
    pre2(t);
    for(int i = 1;i <= n;i++) resu[i][0] = resu[i][1] = dist[1][i],resv[i][0] = resv[i][1] = dist[2][i];
    run1(s);
    run2(t);
    for(int i = 1;i <= n;i++) if(ins[i])
    {
        ans = min(ans,resu[i][0]+resv[i][1]);
        ans = min(ans,resu[i][1]+resv[i][0]);
    }
    ans = min(ans,dist[1][v]);
    cout << ans;
}

Compilation message

commuter_pass.cpp: In function 'void dijk(int, long long int (&)[100001])':
commuter_pass.cpp:26:18: warning: decomposition declaration only available with -std=c++1z or -std=gnu++1z
         for(auto [w,v] : adj[u]) if(dist[u]+w<dist[v])
                  ^
commuter_pass.cpp: In function 'void pre1(int)':
commuter_pass.cpp:38:14: warning: decomposition declaration only available with -std=c++1z or -std=gnu++1z
     for(auto [w,v] : adj[u]) if(dist[0][u]+w==dist[0][v]) deg1[v]++,pre1(v);
              ^
commuter_pass.cpp: In function 'void pre2(int)':
commuter_pass.cpp:46:14: warning: decomposition declaration only available with -std=c++1z or -std=gnu++1z
     for(auto [w,v] : adj[u]) if(dist[0][v]+w==dist[0][u]) deg2[v]++,pre2(v);
              ^
commuter_pass.cpp: In function 'void run1(int)':
commuter_pass.cpp:51:14: warning: decomposition declaration only available with -std=c++1z or -std=gnu++1z
     for(auto [w,v] : adj[u]) if(dist[0][u]+w==dist[0][v]) 
              ^
commuter_pass.cpp: In function 'void run2(int)':
commuter_pass.cpp:61:14: warning: decomposition declaration only available with -std=c++1z or -std=gnu++1z
     for(auto [w,v] : adj[u]) if(dist[0][v]+w==dist[0][u])
              ^

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 396 ms 19388 KB Output is correct
2 Correct 441 ms 19704 KB Output is correct
3 Correct 449 ms 22996 KB Output is correct
4 Correct 360 ms 20072 KB Output is correct
5 Correct 408 ms 19972 KB Output is correct
6 Correct 368 ms 20204 KB Output is correct
7 Correct 405 ms 19952 KB Output is correct
8 Correct 429 ms 20080 KB Output is correct
9 Correct 401 ms 20196 KB Output is correct
10 Correct 314 ms 20340 KB Output is correct
11 Correct 187 ms 17048 KB Output is correct
12 Correct 394 ms 20148 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 410 ms 22240 KB Output is correct
2 Correct 426 ms 22088 KB Output is correct
3 Correct 410 ms 22148 KB Output is correct
4 Correct 417 ms 22124 KB Output is correct
5 Correct 445 ms 22100 KB Output is correct
6 Correct 439 ms 22468 KB Output is correct
7 Correct 441 ms 24344 KB Output is correct
8 Correct 430 ms 22208 KB Output is correct
9 Correct 395 ms 22160 KB Output is correct
10 Correct 374 ms 22092 KB Output is correct
11 Correct 208 ms 17272 KB Output is correct
12 Correct 431 ms 22584 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 3840 KB Output is correct
2 Correct 6 ms 2816 KB Output is correct
3 Correct 7 ms 2816 KB Output is correct
4 Correct 21 ms 4864 KB Output is correct
5 Correct 14 ms 3840 KB Output is correct
6 Correct 7 ms 2816 KB Output is correct
7 Correct 7 ms 2816 KB Output is correct
8 Correct 8 ms 2944 KB Output is correct
9 Correct 7 ms 2816 KB Output is correct
10 Correct 22 ms 3840 KB Output is correct
11 Correct 6 ms 2740 KB Output is correct
12 Correct 6 ms 2816 KB Output is correct
13 Correct 6 ms 2816 KB Output is correct
14 Correct 7 ms 2816 KB Output is correct
15 Correct 6 ms 2816 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 396 ms 19388 KB Output is correct
2 Correct 441 ms 19704 KB Output is correct
3 Correct 449 ms 22996 KB Output is correct
4 Correct 360 ms 20072 KB Output is correct
5 Correct 408 ms 19972 KB Output is correct
6 Correct 368 ms 20204 KB Output is correct
7 Correct 405 ms 19952 KB Output is correct
8 Correct 429 ms 20080 KB Output is correct
9 Correct 401 ms 20196 KB Output is correct
10 Correct 314 ms 20340 KB Output is correct
11 Correct 187 ms 17048 KB Output is correct
12 Correct 394 ms 20148 KB Output is correct
13 Correct 410 ms 22240 KB Output is correct
14 Correct 426 ms 22088 KB Output is correct
15 Correct 410 ms 22148 KB Output is correct
16 Correct 417 ms 22124 KB Output is correct
17 Correct 445 ms 22100 KB Output is correct
18 Correct 439 ms 22468 KB Output is correct
19 Correct 441 ms 24344 KB Output is correct
20 Correct 430 ms 22208 KB Output is correct
21 Correct 395 ms 22160 KB Output is correct
22 Correct 374 ms 22092 KB Output is correct
23 Correct 208 ms 17272 KB Output is correct
24 Correct 431 ms 22584 KB Output is correct
25 Correct 18 ms 3840 KB Output is correct
26 Correct 6 ms 2816 KB Output is correct
27 Correct 7 ms 2816 KB Output is correct
28 Correct 21 ms 4864 KB Output is correct
29 Correct 14 ms 3840 KB Output is correct
30 Correct 7 ms 2816 KB Output is correct
31 Correct 7 ms 2816 KB Output is correct
32 Correct 8 ms 2944 KB Output is correct
33 Correct 7 ms 2816 KB Output is correct
34 Correct 22 ms 3840 KB Output is correct
35 Correct 6 ms 2740 KB Output is correct
36 Correct 6 ms 2816 KB Output is correct
37 Correct 6 ms 2816 KB Output is correct
38 Correct 7 ms 2816 KB Output is correct
39 Correct 6 ms 2816 KB Output is correct
40 Correct 333 ms 20456 KB Output is correct
41 Correct 324 ms 20296 KB Output is correct
42 Correct 322 ms 20296 KB Output is correct
43 Correct 218 ms 16784 KB Output is correct
44 Correct 263 ms 16760 KB Output is correct
45 Correct 411 ms 19564 KB Output is correct
46 Correct 385 ms 19320 KB Output is correct
47 Correct 384 ms 20256 KB Output is correct
48 Correct 243 ms 15096 KB Output is correct
49 Correct 291 ms 20192 KB Output is correct
50 Correct 356 ms 19688 KB Output is correct
51 Correct 328 ms 19564 KB Output is correct