제출 #1069803

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1069803		Hugo1729	Commuter Pass (JOI18_commuter_pass)	C++17	16 / 100	461 ms	28544 KiB

commuter_pass

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int n,m,a,b,c,d;

vector<pair<ll,int>> adj[100001];

vector<ll> dijkstra(int v){
    vector<ll> dist(n+1,-1);

    priority_queue<pair<ll,int>,vector<pair<ll,int>>, greater<pair<ll,int>>> pq;
    pq.push({0,v});


    while(!pq.empty()){
        auto [cost,w] = pq.top();
        pq.pop();

        if(dist[w]!=-1)continue;

        dist[w]=cost;

        for(auto [dist,e] : adj[w]){
            pq.push({dist+cost,e});
        }
    }

    return dist;
}

int main(){
    // cin.tie(0)->sync_with_stdio(0);



    cin >> n >> m >> a >> b >> c >> d;

    for(int i=0;i<m;i++){
        int x,y,cost; cin >> x >> y >> cost;
        adj[x].push_back({cost,y});
        adj[y].push_back({cost,x});
    }

    vector<ll> path1 = dijkstra(a),path2 = dijkstra(b),sus1=dijkstra(c),sus2=dijkstra(d);

    vector<ll> dp(n+1,LLONG_MAX/4),dp1(n+1,LLONG_MAX/4),dp2(n+1,LLONG_MAX/4);
    // vector<pair<ll,ll>> dp1(n+1,{LLONG_MAX,LLONG_MAX}),dp2(n+1,{LLONG_MAX,LLONG_MAX});

    vector<pair<ll,int>> elza_help_asb_ek_kan_nie_meer_nie_die_vraag_werk_nie_adsfasdfasdfadsfasdfkjlasdasdfasdfasddfasdfasdfadsfasdfasdfadsf;

    for(int i=1;i<=n;i++){
        if(path1[i]+path2[i]==path1[b])elza_help_asb_ek_kan_nie_meer_nie_die_vraag_werk_nie_adsfasdfasdfadsfasdfkjlasdasdfasdfasddfasdfasdfadsfasdfasdfadsf.push_back({path1[i],i});
    }

    dp[a]=sus1[a]+sus2[a];
    dp1[a]=sus1[a];
    dp2[a]=sus2[a];

    sort(elza_help_asb_ek_kan_nie_meer_nie_die_vraag_werk_nie_adsfasdfasdfadsfasdfkjlasdasdfasdfasddfasdfasdfadsfasdfasdfadsf.begin(),elza_help_asb_ek_kan_nie_meer_nie_die_vraag_werk_nie_adsfasdfasdfadsfasdfkjlasdasdfasdfasddfasdfasdfadsfasdfasdfadsf.end());

    for(int i=0;i<elza_help_asb_ek_kan_nie_meer_nie_die_vraag_werk_nie_adsfasdfasdfadsfasdfkjlasdasdfasdfasddfasdfasdfadsfasdfasdfadsf.size();i++){
        int v = elza_help_asb_ek_kan_nie_meer_nie_die_vraag_werk_nie_adsfasdfasdfadsfasdfkjlasdasdfasdfasddfasdfasdfadsfasdfasdfadsf[i].second;
        for(auto [cost, w] : adj[v]){
            if(path1[v]+path2[v]==path1[b]&&path1[w]<path1[v]){
                dp1[v]=min(dp1[w],sus1[v]);
                dp2[v]=min(dp2[w],sus2[v]);
                dp[v]=min(dp[v],dp[w]);
            }
        }

        for(auto [cost, w] : adj[v]){
            if(path1[v]+path2[v]==path1[b]&&path1[w]<path1[v]){
                dp[v]=min(dp[v],dp1[v]+sus2[v]);
                dp[v]=min(dp[v],dp2[v]+sus1[v]);
            }
        }
        // cout << v << ": " << dp[v] << ' ' << dp1[v] << ' ' << dp2[v] << '\n';
    }

    cout << min(dp[b],sus1[d]);

    // cout << '\n';

    // for(int i = 0;i<elza_help_asb_ek_kan_nie_meer_nie_die_vraag_werk_nie_adsfasdfasdfadsfasdfkjlasdasdfasdfasddfasdfasdfadsfasdfasdfadsf.size();i++)cout << elza_help_asb_ek_kan_nie_meer_nie_die_vraag_werk_nie_adsfasdfasdfadsfasdfkjlasdasdfasdfasddfasdfasdfadsfasdfasdfadsf[i].first << ' ' << elza_help_asb_ek_kan_nie_meer_nie_die_vraag_werk_nie_adsfasdfasdfadsfasdfkjlasdasdfasdfasddfasdfasdfadsfasdfasdfadsf[i].second << '\n';


    // cout << '\n';

    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

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

• Subtask 1: 16 / 16
• Subtask 2: 0 / 15
• Subtask 3: 0 / 24
• Subtask 4: 0 / 45