oj.uz

답안 #718447

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
718447 2023-04-04T05:59:23 Z ovidiush11 Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 721 ms 27124 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ff first
#define ss second

const ll N = 1e5+7;

ll pos[4],dis[4][N],n,m;
vector<vector<pair<ll,ll>>> a;

void dijkstra(ll p)
{
    priority_queue<pair<ll,ll>> pq;
    pq.push({0,pos[p]});
    for(ll i = 0;i < n;i++)dis[p][i] = 1e18;
    while(!pq.empty())
    {
        pair<ll,ll> v = pq.top();
        pq.pop();
        v.ff *= -1;
        if(v.ff >= dis[p][v.ss])continue;
        dis[p][v.ss] = v.ff;
        for(auto x : a[v.ss])pq.push(make_pair(-(v.ff + x.ff),x.ss));
    }
    return ;
}

ll in[N],len[N];

void check(ll p)
{
    for(ll i = 0;i < n;i++)in[i] = 0;
    for(ll i = 0;i < n;i++)len[i] = 0;
    priority_queue<pair<ll,pair<ll,ll>>> pq;
    pq.push(make_pair(-dis[1][p],make_pair(p,p)));
    while(!pq.empty())
    {
        pair<ll,pair<ll,ll>> v = pq.top();
        pq.pop();
        len[v.ss.ff] = max(len[v.ss.ff],len[v.ss.ss] + 1);
        if(in[v.ss.ff])continue;
        in[v.ss.ff] = 1;
        for(auto x : a[v.ss.ff]){
            if(dis[0][x.ss] + dis[1][x.ss] == dis[1][pos[0]] && dis[1][x.ss] > dis[1][v.ss.ff]){
                pq.push(make_pair(-dis[1][x.ss],make_pair(x.ss,v.ss.ff)));
            }
        }
    }
}

ll dismin[N][2],st[N];

void getmin(ll s)
{
    for(ll i = 0;i < n;i++)dismin[i][s] = dis[2][i];
    for(ll i = 0;i < n;i++)st[i] = 0;
    priority_queue<pair<ll,pair<ll,ll>>> pq;
    if(s == 1)pq.push(make_pair(-len[pos[s]],make_pair(pos[s],pos[s])));
    else pq.push(make_pair(len[pos[s]],make_pair(pos[s],pos[s])));
    while(!pq.empty())
    {
        pair<ll,pair<ll,ll>> v = pq.top();
        pq.pop();
        dismin[v.ss.ff][s] = min(dismin[v.ss.ff][s],dismin[v.ss.ss][s]);
        if(st[v.ss.ff])continue;
        st[v.ss.ff] = 1;
        for(auto x : a[v.ss.ff])
        {
            if(in[x.ss])
            {
                if(s == 1 && len[x.ss] > len[v.ss.ff])pq.push(make_pair(-len[x.ss],make_pair(x.ss,v.ss.ff)));
                else if(s == 0 && len[x.ss] < len[v.ss.ff])pq.push(make_pair(len[x.ss],make_pair(x.ss,v.ss.ff)));
            }
        }
    }
    return ;
}

int main()
{
    cin>>n>>m;
    cin>>pos[0]>>pos[1]>>pos[2]>>pos[3];
    pos[0]--;pos[1]--;pos[2]--;pos[3]--;
    a.resize(n);
    for(ll i = 0;i < m;i++)
    {
        ll x,y,z;
        cin>>x>>y>>z;x--;y--;
        a[x].push_back(make_pair(z,y));
        a[y].push_back(make_pair(z,x));
    }
    dijkstra(0);dijkstra(1);dijkstra(2);dijkstra(3);
    check(pos[1]);
    getmin(0);
    getmin(1);
    ll ans = dis[2][pos[3]];
    for(ll i = 0;i < n;i++)if(in[i])ans = min(min(dismin[i][0],dismin[i][1]) + dis[3][i],ans);
    cout<<ans;
    return 0;
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 609 ms 23452 KB Output is correct
2 Correct 517 ms 23052 KB Output is correct
3 Correct 627 ms 24020 KB Output is correct
4 Correct 594 ms 22580 KB Output is correct
5 Correct 625 ms 20804 KB Output is correct
6 Correct 632 ms 23024 KB Output is correct
7 Correct 630 ms 22904 KB Output is correct
8 Correct 592 ms 22780 KB Output is correct
9 Correct 588 ms 23156 KB Output is correct
10 Correct 578 ms 23048 KB Output is correct
11 Correct 254 ms 15004 KB Output is correct
12 Correct 580 ms 23044 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 602 ms 23244 KB Output is correct
2 Correct 591 ms 24128 KB Output is correct
3 Correct 539 ms 22552 KB Output is correct
4 Correct 593 ms 20612 KB Output is correct
5 Correct 550 ms 20588 KB Output is correct
6 Correct 638 ms 24304 KB Output is correct
7 Correct 646 ms 22468 KB Output is correct
8 Correct 538 ms 20624 KB Output is correct
9 Correct 595 ms 22628 KB Output is correct
10 Correct 571 ms 24236 KB Output is correct
11 Correct 223 ms 15108 KB Output is correct
12 Correct 623 ms 24320 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 2764 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 87 ms 5064 KB Output is correct
5 Correct 43 ms 3472 KB Output is correct
6 Correct 3 ms 468 KB Output is correct
7 Correct 5 ms 596 KB Output is correct
8 Correct 6 ms 724 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 44 ms 3620 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 609 ms 23452 KB Output is correct
2 Correct 517 ms 23052 KB Output is correct
3 Correct 627 ms 24020 KB Output is correct
4 Correct 594 ms 22580 KB Output is correct
5 Correct 625 ms 20804 KB Output is correct
6 Correct 632 ms 23024 KB Output is correct
7 Correct 630 ms 22904 KB Output is correct
8 Correct 592 ms 22780 KB Output is correct
9 Correct 588 ms 23156 KB Output is correct
10 Correct 578 ms 23048 KB Output is correct
11 Correct 254 ms 15004 KB Output is correct
12 Correct 580 ms 23044 KB Output is correct
13 Correct 602 ms 23244 KB Output is correct
14 Correct 591 ms 24128 KB Output is correct
15 Correct 539 ms 22552 KB Output is correct
16 Correct 593 ms 20612 KB Output is correct
17 Correct 550 ms 20588 KB Output is correct
18 Correct 638 ms 24304 KB Output is correct
19 Correct 646 ms 22468 KB Output is correct
20 Correct 538 ms 20624 KB Output is correct
21 Correct 595 ms 22628 KB Output is correct
22 Correct 571 ms 24236 KB Output is correct
23 Correct 223 ms 15108 KB Output is correct
24 Correct 623 ms 24320 KB Output is correct
25 Correct 48 ms 2764 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 87 ms 5064 KB Output is correct
29 Correct 43 ms 3472 KB Output is correct
30 Correct 3 ms 468 KB Output is correct
31 Correct 5 ms 596 KB Output is correct
32 Correct 6 ms 724 KB Output is correct
33 Correct 3 ms 468 KB Output is correct
34 Correct 44 ms 3620 KB Output is correct
35 Correct 1 ms 320 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 324 KB Output is correct
38 Correct 2 ms 468 KB Output is correct
39 Correct 2 ms 468 KB Output is correct
40 Correct 564 ms 26536 KB Output is correct
41 Correct 619 ms 26988 KB Output is correct
42 Correct 603 ms 27124 KB Output is correct
43 Correct 256 ms 16948 KB Output is correct
44 Correct 202 ms 16980 KB Output is correct
45 Correct 721 ms 26248 KB Output is correct
46 Correct 710 ms 25988 KB Output is correct
47 Correct 574 ms 23964 KB Output is correct
48 Correct 233 ms 16400 KB Output is correct
49 Correct 530 ms 25268 KB Output is correct
50 Correct 661 ms 25900 KB Output is correct
51 Correct 664 ms 26172 KB Output is correct