oj.uz

Submission #331782

# Submission time Handle Problem Language Result Execution time Memory
331782 2020-11-30T05:01:57 Z daniel920712 Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 821 ms 46644 KB 
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <set>
#include <map>
#include <algorithm>
#include <time.h>
#include <algorithm>
#include <queue>
#include <utility>
#include <map>

using namespace std;

vector < pair < long long , pair < long long , long long > > > Next[200005];
vector < long long > Next2[200005];
priority_queue < pair < long long , long long > , vector < pair < long long , long long > > , greater < pair < long long , long long > > > dij;
priority_queue < pair < pair < long long , long long > , long long > , vector < pair < pair < long long , long long > , long long > > , greater < pair < pair < long long , long long > , long long > > > dijj;
queue < long long > ttt;
bool use[200005]={0};
bool have[200005]={0};
long long small[100005]={0};
int main()
{
    //freopen("03-07.txt","rt",stdin);
    long long N,M,S,T,U,V,a,b,c,i,ans=1e18,x;
    scanf("%lld %lld",&N,&M);
    scanf("%lld %lld %lld %lld",&S,&T,&U,&V);
    for(i=1;i<=N;i++) small[i]=-1;
    for(i=0;i<M;i++)
    {
        scanf("%lld %lld %lld",&a,&b,&c);
        Next[a].push_back(make_pair(i,make_pair(b,c)));
        Next[b].push_back(make_pair(i,make_pair(a,c)));
    }
    dij.push(make_pair(0,S));
    while(!dij.empty())
    {
        a=dij.top().first;
        b=dij.top().second;
        dij.pop();
        if(small[b]!=-1) continue;
        small[b]=a;
        for(auto i:Next[b]) dij.push(make_pair(a+i.second.second,i.second.first));

    }
    ttt.push(T);
    while(!ttt.empty())
    {
        i=ttt.front();
        ttt.pop();
        if(have[i]) continue;
        have[i]=1;
        for(auto j:Next[i])
        {
            if(small[i]-j.second.second==small[j.second.first])
            {
                use[j.first]=1;
                ttt.push(j.second.first);
                Next2[j.second.first].push_back(i);
            }
        }

    }

    for(i=1;i<=N;i++) small[i]=-1;
    dijj.push(make_pair(make_pair(0,U),0));
    while(!dijj.empty())
    {
        a=dijj.top().first.first;
        b=dijj.top().first.second;
        x=dijj.top().second;
        dijj.pop();
        if(small[b]!=-1) continue;
        small[b]=a;
        //printf("%lld %lld\n",a,b);
        for(auto i:Next[b])
        {
            if(x==0) dijj.push(make_pair(make_pair(a+i.second.second,i.second.first),0));
            else dijj.push(make_pair(make_pair(a+i.second.second,i.second.first),2));
        }
        if(x==0||x==1) for(auto i:Next2[b]) dijj.push(make_pair(make_pair(a,i),1));

    }
    ans=min(ans,small[V]);

    for(i=1;i<=N;i++) small[i]=-1;
    dijj.push(make_pair(make_pair(0,V),0));
    while(!dijj.empty())
    {
        a=dijj.top().first.first;
        b=dijj.top().first.second;
        x=dijj.top().second;
        dijj.pop();
        if(small[b]!=-1) continue;
        small[b]=a;
        for(auto i:Next[b])
        {
            if(x==0) dijj.push(make_pair(make_pair(a+i.second.second,i.second.first),0));
            else dijj.push(make_pair(make_pair(a+i.second.second,i.second.first),2));
        }
        if(x==0||x==1) for(auto i:Next2[b]) dijj.push(make_pair(make_pair(a,i),1));

    }
    ans=min(ans,small[U]);


    printf("%lld\n",ans);

    return 0;
}

Compilation message

commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:28:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   28 |     scanf("%lld %lld",&N,&M);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
commuter_pass.cpp:29:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   29 |     scanf("%lld %lld %lld %lld",&S,&T,&U,&V);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
commuter_pass.cpp:33:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   33 |         scanf("%lld %lld %lld",&a,&b,&c);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 587 ms 37204 KB Output is correct
2 Correct 583 ms 36840 KB Output is correct
3 Correct 622 ms 41856 KB Output is correct
4 Correct 635 ms 36544 KB Output is correct
5 Correct 600 ms 35292 KB Output is correct
6 Correct 570 ms 36952 KB Output is correct
7 Correct 599 ms 37716 KB Output is correct
8 Correct 580 ms 37332 KB Output is correct
9 Correct 571 ms 37076 KB Output is correct
10 Correct 531 ms 36948 KB Output is correct
11 Correct 246 ms 21472 KB Output is correct
12 Correct 555 ms 37340 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 632 ms 36912 KB Output is correct
2 Correct 626 ms 35072 KB Output is correct
3 Correct 543 ms 34904 KB Output is correct
4 Correct 561 ms 35080 KB Output is correct
5 Correct 569 ms 35032 KB Output is correct
6 Correct 633 ms 41844 KB Output is correct
7 Correct 612 ms 32860 KB Output is correct
8 Correct 567 ms 34988 KB Output is correct
9 Correct 562 ms 34904 KB Output is correct
10 Correct 539 ms 34940 KB Output is correct
11 Correct 291 ms 22088 KB Output is correct
12 Correct 635 ms 41816 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 13412 KB Output is correct
2 Correct 7 ms 9836 KB Output is correct
3 Correct 7 ms 9836 KB Output is correct
4 Correct 75 ms 16644 KB Output is correct
5 Correct 40 ms 14688 KB Output is correct
6 Correct 8 ms 10024 KB Output is correct
7 Correct 10 ms 10092 KB Output is correct
8 Correct 11 ms 10348 KB Output is correct
9 Correct 9 ms 9964 KB Output is correct
10 Correct 40 ms 14432 KB Output is correct
11 Correct 8 ms 9836 KB Output is correct
12 Correct 7 ms 9708 KB Output is correct
13 Correct 8 ms 9836 KB Output is correct
14 Correct 8 ms 9964 KB Output is correct
15 Correct 8 ms 9836 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 587 ms 37204 KB Output is correct
2 Correct 583 ms 36840 KB Output is correct
3 Correct 622 ms 41856 KB Output is correct
4 Correct 635 ms 36544 KB Output is correct
5 Correct 600 ms 35292 KB Output is correct
6 Correct 570 ms 36952 KB Output is correct
7 Correct 599 ms 37716 KB Output is correct
8 Correct 580 ms 37332 KB Output is correct
9 Correct 571 ms 37076 KB Output is correct
10 Correct 531 ms 36948 KB Output is correct
11 Correct 246 ms 21472 KB Output is correct
12 Correct 555 ms 37340 KB Output is correct
13 Correct 632 ms 36912 KB Output is correct
14 Correct 626 ms 35072 KB Output is correct
15 Correct 543 ms 34904 KB Output is correct
16 Correct 561 ms 35080 KB Output is correct
17 Correct 569 ms 35032 KB Output is correct
18 Correct 633 ms 41844 KB Output is correct
19 Correct 612 ms 32860 KB Output is correct
20 Correct 567 ms 34988 KB Output is correct
21 Correct 562 ms 34904 KB Output is correct
22 Correct 539 ms 34940 KB Output is correct
23 Correct 291 ms 22088 KB Output is correct
24 Correct 635 ms 41816 KB Output is correct
25 Correct 44 ms 13412 KB Output is correct
26 Correct 7 ms 9836 KB Output is correct
27 Correct 7 ms 9836 KB Output is correct
28 Correct 75 ms 16644 KB Output is correct
29 Correct 40 ms 14688 KB Output is correct
30 Correct 8 ms 10024 KB Output is correct
31 Correct 10 ms 10092 KB Output is correct
32 Correct 11 ms 10348 KB Output is correct
33 Correct 9 ms 9964 KB Output is correct
34 Correct 40 ms 14432 KB Output is correct
35 Correct 8 ms 9836 KB Output is correct
36 Correct 7 ms 9708 KB Output is correct
37 Correct 8 ms 9836 KB Output is correct
38 Correct 8 ms 9964 KB Output is correct
39 Correct 8 ms 9836 KB Output is correct
40 Correct 569 ms 40048 KB Output is correct
41 Correct 589 ms 41176 KB Output is correct
42 Correct 573 ms 41428 KB Output is correct
43 Correct 328 ms 25444 KB Output is correct
44 Correct 296 ms 25444 KB Output is correct
45 Correct 736 ms 46644 KB Output is correct
46 Correct 705 ms 40060 KB Output is correct
47 Correct 558 ms 35552 KB Output is correct
48 Correct 289 ms 24804 KB Output is correct
49 Correct 549 ms 38936 KB Output is correct
50 Correct 724 ms 45484 KB Output is correct
51 Correct 821 ms 46340 KB Output is correct