Submission #1328310

#TimeUsernameProblemLanguageResultExecution timeMemory
1328310tranthienphuc2657Commuter Pass (JOI18_commuter_pass)C++20
100 / 100
185 ms19152 KiB
// TranThienPhuc2657
#include <bits/stdc++.h>
using namespace std;
#define file "TASK"
#define TIME 1.0 * clock() / CLOCKS_PER_SEC
#define ll long long
#define pb push_back
#define fi first
#define se second
#define pii pair <int, int>
#define pll pair <ll, ll>
#define Sz(x) ((int) (x).size())
#define getBit(mask, i) (((mask) >> (i)) & 1)
template <typename T1, typename T2> bool mini(T1 &A, T2 B) {if (A > B) A = B; else return 0; return 1;}
template <typename T1, typename T2> bool maxi(T1 &A, T2 B) {if (A < B) A = B; else return 0; return 1;}
const int inf = 2e9 + 7;
const ll linf = 1e18l + 7;
const int mod = 1e9 + 7;
const int N = 2e5 + 5;

int n, m, A, B, C, D;
vector <pii> adj[N];
vector <int> nadj[N];
ll dA[N], dB[N], dC[N], dD[N];
int in[N];
ll dpC[N], dpD[N];
ll res = linf;

// inp
void inp() {
    cin >> n >> m >> A >> B >> C >> D;
    for (int i = 1; i <= m; i++) {
        int u, v, w; cin >> u >> v >> w;
        adj[u].pb({v, w});
        adj[v].pb({u, w});
    }
}

// init
void dijkstra(ll *d, const int &s) {
    for (int u = 1; u <= n; u++) d[u] = linf;
    priority_queue <pll, vector <pll>, greater <pll>> pq;
    d[s] = 0;
    pq.push({0, s});

    while (!pq.empty()) {
        ll du = pq.top().fi, u = pq.top().se; pq.pop();
        if (du > d[u]) continue;
        for (pii e: adj[u]) {
            int v = e.fi, w = e.se;
            if (mini(d[v], d[u] + w)) pq.push({d[v], v});
        }
    }
}

bool inSP(int u, int v, int w) {
    return dA[u] + w == dA[v] and dA[u] + w + dB[v] == dA[B];
}

void init() {
    dijkstra(dA, A); dijkstra(dB, B); dijkstra(dC, C); dijkstra(dD, D);

    for (int u = 1; u <= n; u++) {
        for (pii e: adj[u]) {
            int v = e.fi, w = e.se;
            if (inSP(u, v, w)) {
                nadj[u].pb(v);
                in[v]++;
            }
        }
    }
}

// proc
void proc() {
    for (int u = 1; u <= n; u++) dpC[u] = dpD[u] = linf;
    queue <int> q;
    for (int u = 1; u <= n; u++) if (!in[u]) q.push(u);
    while (!q.empty()) {
        int u = q.front(); q.pop();

        mini(dpC[u], dC[u]);
        mini(dpD[u], dD[u]);

        mini(res, dpC[u] + dD[u]);
        mini(res, dpD[u] + dC[u]);

        for (int v: nadj[u]) {
            mini(dpC[v], dpC[u]);
            mini(dpD[v], dpD[u]);

            if (--in[v] == 0) q.push(v);
        }
    }

    cout << res;
}

signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    if (fopen(file".inp", "r")) {
        freopen(file".inp", "r", stdin);
        freopen(file".out", "w", stdout);
    }

    inp();
    init();
    proc();
    cerr << "Time elapsed: " << TIME << "s.\n";
    return 0;
}

Compilation message (stderr)

commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:102:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  102 |         freopen(file".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
commuter_pass.cpp:103:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  103 |         freopen(file".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...