oj.uz

답안 #926789

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
926789 2024-02-13T17:52:25 Z haru09 Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 241 ms 16088 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define task "code"

const int ar=1e5+5;
const ll mod=1e9+7;
int n,m;
int s,t;
int u,v;
ll dp[2][ar];
vector<pair<int,int>> ad[ar];
vector<int> it;
priority_queue<pair<ll,int>, vector<pair<ll,int>>, greater<pair<ll,int>> > pq;
ll dist[5][ar];
void dijkstra(int x,int t)
{
    for (int i=1;i<=n;i++) dist[t][i]=1e18;
    dist[t][x]=0;
    pq.push({0,x});
    while(pq.size())
    {
        pair<ll,int> top=pq.top();
        pq.pop();
        ll d=top.fi;
        int u=top.se;
        if (d>dist[t][u]) continue;
        for (auto [v,w]:ad[u])
        {
            ll val=dist[t][u]+w;
            if (val<dist[t][v])
            {
                dist[t][v]=val;
                pq.push({val,v});
            }
        }
    }
}
bool cmp(int x,int y)
{
    return dist[1][x]<dist[1][y];
}
ll ans=1e18;
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    if (fopen(task".inp","r"))
    {
        freopen(task".inp","r",stdin);
        freopen(task".out","w",stdout);
    }
    cin>>n>>m>>s>>t>>u>>v;
    for (int i=1;i<=m;i++)
    {
        int a,b,c;
        cin>>a>>b>>c;
        ad[a].push_back({b,c});
        ad[b].push_back({a,c});
    }
    dijkstra(s,1);
    dijkstra(t,2);
    dijkstra(u,3);
    dijkstra(v,4);
    for (int i=1;i<=n;i++) it.push_back(i);
    sort(it.begin(),it.end(),cmp);
    ans=dist[3][v];
    for (auto ver:it)
    {
        if (dist[1][ver]+dist[2][ver]!=dist[1][t]) continue;
        dp[0][ver]=dist[3][ver];
        dp[1][ver]=dist[4][ver];
        for (auto [p,w]:ad[ver])
        {
            if (dist[1][p]!=dist[1][ver]-w) continue;
            if (dist[1][p]+dist[2][p]!=dist[1][t]) continue;
            ans=min(ans,dist[3][ver]+dp[1][p]);
            ans=min(ans,dist[4][ver]+dp[0][p]);
            dp[0][ver]=min(dp[0][ver],dp[0][p]);
            dp[1][ver]=min(dp[1][ver],dp[1][p]);
        }
    }
    cout<<ans;
}

Compilation message

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

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 210 ms 14852 KB Output is correct
2 Correct 177 ms 16012 KB Output is correct
3 Correct 173 ms 16072 KB Output is correct
4 Correct 161 ms 15056 KB Output is correct
5 Correct 187 ms 15796 KB Output is correct
6 Correct 204 ms 14948 KB Output is correct
7 Correct 182 ms 15968 KB Output is correct
8 Correct 192 ms 16088 KB Output is correct
9 Correct 180 ms 14532 KB Output is correct
10 Correct 167 ms 14396 KB Output is correct
11 Correct 62 ms 11652 KB Output is correct
12 Correct 193 ms 14560 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 236 ms 16084 KB Output is correct
2 Correct 214 ms 16052 KB Output is correct
3 Correct 210 ms 15928 KB Output is correct
4 Correct 182 ms 16068 KB Output is correct
5 Correct 218 ms 15908 KB Output is correct
6 Correct 174 ms 15988 KB Output is correct
7 Correct 198 ms 16004 KB Output is correct
8 Correct 241 ms 15928 KB Output is correct
9 Correct 203 ms 15904 KB Output is correct
10 Correct 191 ms 16072 KB Output is correct
11 Correct 60 ms 11636 KB Output is correct
12 Correct 171 ms 16080 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 7260 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 10 ms 7836 KB Output is correct
5 Correct 6 ms 7260 KB Output is correct
6 Correct 2 ms 6492 KB Output is correct
7 Correct 2 ms 6488 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 2 ms 6492 KB Output is correct
10 Correct 5 ms 7260 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6488 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
14 Correct 2 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 210 ms 14852 KB Output is correct
2 Correct 177 ms 16012 KB Output is correct
3 Correct 173 ms 16072 KB Output is correct
4 Correct 161 ms 15056 KB Output is correct
5 Correct 187 ms 15796 KB Output is correct
6 Correct 204 ms 14948 KB Output is correct
7 Correct 182 ms 15968 KB Output is correct
8 Correct 192 ms 16088 KB Output is correct
9 Correct 180 ms 14532 KB Output is correct
10 Correct 167 ms 14396 KB Output is correct
11 Correct 62 ms 11652 KB Output is correct
12 Correct 193 ms 14560 KB Output is correct
13 Correct 236 ms 16084 KB Output is correct
14 Correct 214 ms 16052 KB Output is correct
15 Correct 210 ms 15928 KB Output is correct
16 Correct 182 ms 16068 KB Output is correct
17 Correct 218 ms 15908 KB Output is correct
18 Correct 174 ms 15988 KB Output is correct
19 Correct 198 ms 16004 KB Output is correct
20 Correct 241 ms 15928 KB Output is correct
21 Correct 203 ms 15904 KB Output is correct
22 Correct 191 ms 16072 KB Output is correct
23 Correct 60 ms 11636 KB Output is correct
24 Correct 171 ms 16080 KB Output is correct
25 Correct 6 ms 7260 KB Output is correct
26 Correct 1 ms 6492 KB Output is correct
27 Correct 1 ms 6492 KB Output is correct
28 Correct 10 ms 7836 KB Output is correct
29 Correct 6 ms 7260 KB Output is correct
30 Correct 2 ms 6492 KB Output is correct
31 Correct 2 ms 6488 KB Output is correct
32 Correct 2 ms 6492 KB Output is correct
33 Correct 2 ms 6492 KB Output is correct
34 Correct 5 ms 7260 KB Output is correct
35 Correct 1 ms 6492 KB Output is correct
36 Correct 1 ms 6488 KB Output is correct
37 Correct 2 ms 6492 KB Output is correct
38 Correct 2 ms 6492 KB Output is correct
39 Correct 1 ms 6492 KB Output is correct
40 Correct 208 ms 14660 KB Output is correct
41 Correct 180 ms 14812 KB Output is correct
42 Correct 198 ms 14840 KB Output is correct
43 Correct 61 ms 11648 KB Output is correct
44 Correct 62 ms 11724 KB Output is correct
45 Correct 177 ms 15576 KB Output is correct
46 Correct 146 ms 15568 KB Output is correct
47 Correct 165 ms 15564 KB Output is correct
48 Correct 68 ms 11724 KB Output is correct
49 Correct 140 ms 14916 KB Output is correct
50 Correct 156 ms 15688 KB Output is correct
51 Correct 179 ms 15556 KB Output is correct