oj.uz

Submission #862212

# Submission time Handle Problem Language Result Execution time Memory
862212 2023-10-17T17:31:16 Z green_gold_dog Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 287 ms 29248 KB 
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,sse,sse2,sse3,ssse3,sse4,abm,popcnt,mmx")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double db;
typedef long double ldb;
typedef complex<double> cd;

constexpr ll INF64 = 9'000'000'000'000'000'000, INF32 = 2'000'000'000, MOD = 1'000'000'007;
constexpr db PI = acos(-1);
constexpr bool IS_FILE = false, IS_TEST_CASES = false;

random_device rd;
mt19937 rnd32(rd());
mt19937_64 rnd64(rd());

template<typename T>
bool assign_max(T& a, T b) {
        if (b > a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
bool assign_min(T& a, T b) {
        if (b < a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
T square(T a) {
        return a * a;
}

template<>
struct std::hash<pair<ll, ll>> {
        ll operator() (pair<ll, ll> p) const {
                return ((__int128)p.first * MOD + p.second) % INF64;
        }
};

vector<ll> dist(ll v, vector<vector<pair<ll, ll>>>& arr) {
        vector<ll> d(arr.size(), INF64);
        priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>> pq;
        pq.emplace(0, v);
        d[v] = 0;
        while (!pq.empty()) {
                auto[nd, u] = pq.top();
                pq.pop();
                if (nd != d[u]) {
                        continue;
                }
                for (auto[i, di] : arr[u]) {
                        if (assign_min(d[i], nd + di)) {
                                pq.emplace(d[i], i);
                        }
                }
        }
        return d;
}

void dfs(ll v, vector<bool>& used, vector<vector<ll>>& tree, vector<ll>& ts) {
        used[v] = true;
        for (auto i : tree[v]) {
                if (!used[i]) {
                        dfs(i, used, tree, ts);
                }
        }
        ts.push_back(v);
}

void solve() {
        ll n, m, s, t, u, v;
        cin >> n >> m >> s >> t >> u >> v;
        s--;
        t--;
        u--;
        v--;
        vector<vector<pair<ll, ll>>> arr(n);
        for (ll i = 0; i < m; i++) {
                ll a, b, c;
                cin >> a >> b >> c;
                a--;
                b--;
                arr[a].emplace_back(b, c);
                arr[b].emplace_back(a, c);
        }
        vector<ll> ds = dist(s, arr), dt = dist(t, arr), du = dist(u, arr), dv = dist(v, arr);
        ll dst = ds[t];
        vector<vector<ll>> narr(n);
        for (ll i = 0; i < n; i++) {
                for (auto[j, c] : arr[i]) {
                        if (ds[i] + c + dt[j] == dst) {
                                narr[i].push_back(j);
                        }
                }
        }
        vector<ll> ts;
        vector<bool> used(n, false);
        for (ll i = 0; i < n; i++) {
                if (!used[i]) {
                        dfs(i, used, narr, ts);
                }
        }
        ll ans = du[v];
        vector<ll> dp = du;
        for (auto i : ts) {
                for (auto j : narr[i]) {
                        assign_min(dp[i], dp[j]);
                }
                assign_min(ans, dp[i] + dv[i]);
        }
        dp = dv;
        for (auto i : ts) {
                for (auto j : narr[i]) {
                        assign_min(dp[i], dp[j]);
                }
                assign_min(ans, dp[i] + du[i]);
        }
        cout << ans << '\n';
}

int main() {
        if (IS_FILE) {
                freopen("", "r", stdin);
                freopen("", "w", stdout);
        }
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        cout.tie(0);
        ll t = 1;
        if (IS_TEST_CASES) {
                cin >> t;
        }
        for (ll i = 0; i < t; i++) {
                solve();
        }
}

Compilation message

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

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 251 ms 24292 KB Output is correct
2 Correct 242 ms 24304 KB Output is correct
3 Correct 222 ms 27892 KB Output is correct
4 Correct 238 ms 24140 KB Output is correct
5 Correct 216 ms 24792 KB Output is correct
6 Correct 287 ms 24280 KB Output is correct
7 Correct 207 ms 25176 KB Output is correct
8 Correct 208 ms 25060 KB Output is correct
9 Correct 213 ms 24828 KB Output is correct
10 Correct 166 ms 24880 KB Output is correct
11 Correct 97 ms 20932 KB Output is correct
12 Correct 233 ms 24704 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 209 ms 25360 KB Output is correct
2 Correct 211 ms 25872 KB Output is correct
3 Correct 243 ms 26288 KB Output is correct
4 Correct 238 ms 24864 KB Output is correct
5 Correct 211 ms 25324 KB Output is correct
6 Correct 206 ms 27856 KB Output is correct
7 Correct 248 ms 29248 KB Output is correct
8 Correct 223 ms 25312 KB Output is correct
9 Correct 232 ms 25812 KB Output is correct
10 Correct 210 ms 26096 KB Output is correct
11 Correct 70 ms 22620 KB Output is correct
12 Correct 263 ms 28800 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2140 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 13 ms 3876 KB Output is correct
5 Correct 5 ms 2392 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 7 ms 2032 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 251 ms 24292 KB Output is correct
2 Correct 242 ms 24304 KB Output is correct
3 Correct 222 ms 27892 KB Output is correct
4 Correct 238 ms 24140 KB Output is correct
5 Correct 216 ms 24792 KB Output is correct
6 Correct 287 ms 24280 KB Output is correct
7 Correct 207 ms 25176 KB Output is correct
8 Correct 208 ms 25060 KB Output is correct
9 Correct 213 ms 24828 KB Output is correct
10 Correct 166 ms 24880 KB Output is correct
11 Correct 97 ms 20932 KB Output is correct
12 Correct 233 ms 24704 KB Output is correct
13 Correct 209 ms 25360 KB Output is correct
14 Correct 211 ms 25872 KB Output is correct
15 Correct 243 ms 26288 KB Output is correct
16 Correct 238 ms 24864 KB Output is correct
17 Correct 211 ms 25324 KB Output is correct
18 Correct 206 ms 27856 KB Output is correct
19 Correct 248 ms 29248 KB Output is correct
20 Correct 223 ms 25312 KB Output is correct
21 Correct 232 ms 25812 KB Output is correct
22 Correct 210 ms 26096 KB Output is correct
23 Correct 70 ms 22620 KB Output is correct
24 Correct 263 ms 28800 KB Output is correct
25 Correct 6 ms 2140 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 13 ms 3876 KB Output is correct
29 Correct 5 ms 2392 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 7 ms 2032 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 232 ms 23688 KB Output is correct
41 Correct 200 ms 24476 KB Output is correct
42 Correct 217 ms 24612 KB Output is correct
43 Correct 88 ms 23408 KB Output is correct
44 Correct 77 ms 23648 KB Output is correct
45 Correct 205 ms 26824 KB Output is correct
46 Correct 230 ms 26620 KB Output is correct
47 Correct 188 ms 24232 KB Output is correct
48 Correct 113 ms 20748 KB Output is correct
49 Correct 199 ms 23404 KB Output is correct
50 Correct 178 ms 26076 KB Output is correct
51 Correct 195 ms 27160 KB Output is correct