제출 #229458

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
229458		toxic_hack	Commuter Pass (JOI18_commuter_pass)	C++14	31 / 100	765 ms	34528 KiB

commuter_pass

// g++ -std=c++14

/*

Today might be the chance to grasp the chance to let your talent bloom.
May be tomorrow, the day after, or next year...
May be even when you are 30. I'm not sure if physique has anything to do with it
but if you think that it will never come, it probably never will.

- Tooru Oikawa.

*/


#include<bits/stdc++.h>

typedef long long ll;
typedef long double lld;
using namespace std;

#define endl "\n"
#define fi first
#define se second
#define MEMS(a,b) memset(a,b,sizeof(a))
#define _ ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define __ freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define all(c) c.begin(),c.end()
#define pii pair<int, int>

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r)
{
	uniform_int_distribution<int> uid(l, r);
	return uid(rng);
}

#define tr(...) cout<<__FUNCTION__<<' '<<__LINE__<<" = ";trace(#__VA_ARGS__, __VA_ARGS__)
template<typename S, typename T>
ostream& operator<<(ostream& out,pair<S,T> const& p){out<<'('<<p.fi<<", "<<p.se<<')';return out;}

template<typename T>
ostream& operator<<(ostream& out,vector<T> const& v){
ll l=v.size();for(ll i=0;i<l-1;i++)out<<v[i]<<' ';if(l>0)out<<v[l-1];return out;}

template <typename T>
ostream &operator<<(ostream &out, set<T> const &v) {
    for (auto i = v.begin(); i != v.end(); i++)
        out << (*i) << ' ';
    return out;
}
template <typename T>
ostream &operator<<(ostream &out, multiset<T> const &v) {
    for (auto i = v.begin(); i != v.end(); i++)
        out << (*i) << ' ';
    return out;
}
template <typename T, typename V>
ostream &operator<<(ostream &out, map<T, V> const &v) {
    for (auto i = v.begin(); i != v.end(); i++)
        out << "\n" << (i->first) <<  ":"  << (i->second);
    return out;
}

template<typename T>
void trace(const char* name, T&& arg1){cout<<name<<" : "<<arg1<<endl;}

template<typename T, typename... Args>
void trace(const char* names, T&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');cout.write(names, comma-names)<<" : "<<arg1<<" | ";trace(comma+1,args...);}

#define int ll
const int N = 1e5 + 100;
int n, m;
const int INF = 1e18;
int ans = INF;

void dijkstra(int s, vector<int> & d, vector<vector<pii>> &g) {
    d.assign(n + 1, INF);
    d[s] = 0;
    priority_queue<pii, vector<pii>, greater<pii>> q;
    q.push({0, s});
    while (!q.empty()) {
        int v = q.top().second;
        int d_v = q.top().first;
        q.pop();
        if (d_v != d[v])
            continue;

        for (auto edge : g[v]) {
            int to = edge.first;
            int len = edge.second;

            if (d[v] + len < d[to]) {
                d[to] = d[v] + len;
                q.push({d[to], to});
            }
        }
    }
}
vector<vector<pii>> g(N);
int s, t, a, b;

void get(int st, int ed, int a, int b) {
    vector<int> d1(n + 1);
    vector<int> d2(n + 1);
    dijkstra(st, d1, g);
    dijkstra(ed, d2, g);

    vector<vector<pii>> g2(N);

    for (int i = 1; i <= n; i++) {
        for (auto u : g[i]) {
            if ((d1[i] + u.se + d2[u.fi]) == d1[ed]) {
                g2[i].push_back({u.fi, 0});
            } else  {
                g2[i].push_back(u);
            }
        }
    }

    // tr(st, ed);
    // for (int i = 1; i <= n; i++) {
    //     tr(i, g2[i]);
    // }

    vector<int> t1(n + 1);
    vector<int> t2(n + 1);
    dijkstra(a, t1, g2);
    ans = min(ans, t1[b]);
    dijkstra(b, t2, g2);
    ans = min(ans, t2[a]);
    // tr(t1, a, t2, b, n);
}

int solve() {
    cin >> n >> m;
    cin >> s >> t >> a >> b;
    for (int i = 0; i < m; i++) {
        int v, u, w;
        cin >> v >> u >> w;
        g[v].push_back({u, w});
        g[u].push_back({v, w});
    }
    get(s, t, a, b);
    get(t, s, a, b);
    cout << ans << endl;
    return 0;
}

int32_t main(){ _
    int t;
    // cin >> t;
    t = 1;
    while (t--) solve();
}

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