oj.uz

답안 #736205

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
736205 2023-05-05T10:09:41 Z Ahmed57 Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 358 ms 25980 KB 
#include <bits/stdc++.h>

using namespace std;
long long cost[4][100001];
vector<pair<int,long long>> adj[100001];
void d(int s,int ty){
    priority_queue<pair<long long,long long>> q1;
    q1.push({0,s});
    cost[ty][s] = 0;
    while(!q1.empty()){
        long long co = q1.top().first*-1;
        long long no = q1.top().second;
        q1.pop();
        if (co>cost[ty][no]) continue ;
        for(int i= 0;i<adj[no].size();i++){
            if(cost[ty][adj[no][i].first]>(adj[no][i].second+co)){
                cost[ty][adj[no][i].first] = (adj[no][i].second+co);
                q1.push({cost[ty][adj[no][i].first]*-1,adj[no][i].first});
            }
        }
    }
}
long long dp[100001];
long long u,v,s,t,n,m,ans;
long long solve(int a,int ty){
    if(dp[a]!=-1)return dp[a];
    if(cost[2][a]+cost[3][a]==cost[2][t]){
        dp[a] = cost[1][a];
        for(auto j:adj[a]){
            if(ty?cost[2][a]+j.second==cost[2][j.first]:cost[3][a]+j.second==cost[3][j.first]){
                dp[a] = min(dp[a],solve(j.first,ty));
            }
        }
        ans = min(ans,dp[a]+cost[0][a]);
    }else dp[a] = 1e18;
    return dp[a];
}
signed main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    cin>>n>>m;
    cin>>s>>t;
    cin>>u>>v;
    for(int i = 0;i<m;i++){
        int a,b,c;cin>>a>>b>>c;
        adj[a].push_back({b,c});
        adj[b].push_back({a,c});
    }
    for(int i = 0;i<=n;i++){
        cost[0][i] = 1e18;cost[1][i] = 1e18;
        cost[2][i] = 1e18;cost[3][i] = 1e18;
    }
    d(u,0);d(v,1);d(s,2);d(t,3);
    ans = cost[0][v];
    memset(dp,-1,sizeof dp);
    solve(t,0);
    memset(dp,-1,sizeof dp);
    solve(s,1);
    cout<<ans<<endl;
    return 0;
}

Compilation message

commuter_pass.cpp: In function 'void d(int, int)':
commuter_pass.cpp:15:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |         for(int i= 0;i<adj[no].size();i++){
      |                      ~^~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 303 ms 23196 KB Output is correct
2 Correct 272 ms 21584 KB Output is correct
3 Correct 309 ms 25980 KB Output is correct
4 Correct 265 ms 22984 KB Output is correct
5 Correct 304 ms 21408 KB Output is correct
6 Correct 270 ms 23352 KB Output is correct
7 Correct 328 ms 21444 KB Output is correct
8 Correct 358 ms 21600 KB Output is correct
9 Correct 279 ms 22332 KB Output is correct
10 Correct 230 ms 22292 KB Output is correct
11 Correct 116 ms 17188 KB Output is correct
12 Correct 288 ms 22224 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 333 ms 22896 KB Output is correct
2 Correct 311 ms 23124 KB Output is correct
3 Correct 296 ms 22568 KB Output is correct
4 Correct 304 ms 23020 KB Output is correct
5 Correct 297 ms 23508 KB Output is correct
6 Correct 317 ms 25356 KB Output is correct
7 Correct 347 ms 25612 KB Output is correct
8 Correct 310 ms 23180 KB Output is correct
9 Correct 325 ms 23568 KB Output is correct
10 Correct 305 ms 22724 KB Output is correct
11 Correct 134 ms 18764 KB Output is correct
12 Correct 309 ms 25680 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 5204 KB Output is correct
2 Correct 3 ms 3412 KB Output is correct
3 Correct 2 ms 3540 KB Output is correct
4 Correct 16 ms 6920 KB Output is correct
5 Correct 9 ms 5204 KB Output is correct
6 Correct 3 ms 3512 KB Output is correct
7 Correct 3 ms 3668 KB Output is correct
8 Correct 4 ms 3736 KB Output is correct
9 Correct 3 ms 3540 KB Output is correct
10 Correct 8 ms 5204 KB Output is correct
11 Correct 2 ms 3412 KB Output is correct
12 Correct 2 ms 3412 KB Output is correct
13 Correct 3 ms 3460 KB Output is correct
14 Correct 2 ms 3472 KB Output is correct
15 Correct 3 ms 3504 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 303 ms 23196 KB Output is correct
2 Correct 272 ms 21584 KB Output is correct
3 Correct 309 ms 25980 KB Output is correct
4 Correct 265 ms 22984 KB Output is correct
5 Correct 304 ms 21408 KB Output is correct
6 Correct 270 ms 23352 KB Output is correct
7 Correct 328 ms 21444 KB Output is correct
8 Correct 358 ms 21600 KB Output is correct
9 Correct 279 ms 22332 KB Output is correct
10 Correct 230 ms 22292 KB Output is correct
11 Correct 116 ms 17188 KB Output is correct
12 Correct 288 ms 22224 KB Output is correct
13 Correct 333 ms 22896 KB Output is correct
14 Correct 311 ms 23124 KB Output is correct
15 Correct 296 ms 22568 KB Output is correct
16 Correct 304 ms 23020 KB Output is correct
17 Correct 297 ms 23508 KB Output is correct
18 Correct 317 ms 25356 KB Output is correct
19 Correct 347 ms 25612 KB Output is correct
20 Correct 310 ms 23180 KB Output is correct
21 Correct 325 ms 23568 KB Output is correct
22 Correct 305 ms 22724 KB Output is correct
23 Correct 134 ms 18764 KB Output is correct
24 Correct 309 ms 25680 KB Output is correct
25 Correct 9 ms 5204 KB Output is correct
26 Correct 3 ms 3412 KB Output is correct
27 Correct 2 ms 3540 KB Output is correct
28 Correct 16 ms 6920 KB Output is correct
29 Correct 9 ms 5204 KB Output is correct
30 Correct 3 ms 3512 KB Output is correct
31 Correct 3 ms 3668 KB Output is correct
32 Correct 4 ms 3736 KB Output is correct
33 Correct 3 ms 3540 KB Output is correct
34 Correct 8 ms 5204 KB Output is correct
35 Correct 2 ms 3412 KB Output is correct
36 Correct 2 ms 3412 KB Output is correct
37 Correct 3 ms 3460 KB Output is correct
38 Correct 2 ms 3472 KB Output is correct
39 Correct 3 ms 3504 KB Output is correct
40 Correct 290 ms 23196 KB Output is correct
41 Correct 307 ms 22444 KB Output is correct
42 Correct 271 ms 22368 KB Output is correct
43 Correct 157 ms 17732 KB Output is correct
44 Correct 161 ms 17768 KB Output is correct
45 Correct 280 ms 21024 KB Output is correct
46 Correct 283 ms 20792 KB Output is correct
47 Correct 272 ms 23124 KB Output is correct
48 Correct 136 ms 14756 KB Output is correct
49 Correct 221 ms 22704 KB Output is correct
50 Correct 309 ms 21224 KB Output is correct
51 Correct 281 ms 21228 KB Output is correct