oj.uz

Submission #557386

# Submission time Handle Problem Language Result Execution time Memory
557386 2022-05-05T09:03:24 Z alextodoran Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 414 ms 23384 KB 
/**
 ____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|

**/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N_MAX = 100000;

int N, M;
int S, T;
int U, V;

struct Edge {
    int to;
    int cost;
};
vector <Edge> adj[N_MAX + 2];

bool seen[N_MAX + 2];
void Dijkstra (int start, ll dist[]) {
    fill(dist + 1, dist + N + 1, LLONG_MAX);
    fill(seen + 1, seen + N + 1, false);
    priority_queue <pair <ll, int>> q;
    dist[start] = 0;
    q.push(make_pair(-dist[start], start));
    while (q.empty() == false) {
        ll d; int u; tie(d, u) = q.top();
        q.pop();
        if (seen[u] == true) {
            continue;
        }
        seen[u] = true;
        for (Edge e : adj[u]) {
            if (dist[u] + e.cost < dist[e.to]) {
                dist[e.to] = dist[u] + e.cost;
                q.push(make_pair(-dist[e.to], e.to));
            }
        }
    }
}

ll distS[N_MAX + 2];
ll distT[N_MAX + 2];
ll distU[N_MAX + 2];
ll distV[N_MAX + 2];

vector <int> out[N_MAX + 2];
int cntin[N_MAX + 2];

ll minU[N_MAX + 2];
ll minV[N_MAX + 2];

int 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 = 1; i <= M; i++) {
        int u, v, cost;
        cin >> u >> v >> cost;
        adj[u].push_back(Edge{v, cost});
        adj[v].push_back(Edge{u, cost});
    }

    Dijkstra(S, distS);
    Dijkstra(T, distT);
    Dijkstra(U, distU);
    Dijkstra(V, distV);

    for (int u = 1; u <= N; u++) {
        for (Edge e : adj[u]) {
            if (distS[u] + e.cost + distT[e.to] == distS[T]) {
                out[u].push_back(e.to);
                cntin[e.to]++;
            }
        }
    }

    queue <int> q;
    for (int u = 1; u <= N; u++) {
        if (cntin[u] == 0) {
            q.push(u);
        }
    }
    vector <int> topsort;
    while (q.empty() == false) {
        int u = q.front();
        q.pop();
        topsort.push_back(u);
        for (int v : out[u]) {
            if (--cntin[v] == 0) {
                q.push(v);
            }
        }
    }

    ll answer = LLONG_MAX;
    reverse(topsort.begin(), topsort.end());
    for (int u : topsort) {
        minU[u] = distU[u];
        minV[u] = distV[u];
        for (int v : out[u]) {
            minU[u] = min(minU[u], minU[v]);
            minV[u] = min(minV[u], minV[v]);
        }
        answer = min(answer, distU[u] + minV[u]);
        answer = min(answer, distV[u] + minU[u]);
    }
    cout << answer << "\n";

    return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 260 ms 21456 KB Output is correct
2 Correct 265 ms 21568 KB Output is correct
3 Correct 271 ms 22800 KB Output is correct
4 Correct 255 ms 21320 KB Output is correct
5 Correct 255 ms 22128 KB Output is correct
6 Correct 262 ms 21484 KB Output is correct
7 Correct 277 ms 22268 KB Output is correct
8 Correct 301 ms 22184 KB Output is correct
9 Correct 251 ms 21716 KB Output is correct
10 Correct 214 ms 21808 KB Output is correct
11 Correct 101 ms 17396 KB Output is correct
12 Correct 316 ms 21560 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 281 ms 21636 KB Output is correct
2 Correct 273 ms 21568 KB Output is correct
3 Correct 271 ms 21336 KB Output is correct
4 Correct 270 ms 21456 KB Output is correct
5 Correct 298 ms 21608 KB Output is correct
6 Correct 310 ms 22552 KB Output is correct
7 Correct 333 ms 22516 KB Output is correct
8 Correct 345 ms 21496 KB Output is correct
9 Correct 361 ms 21592 KB Output is correct
10 Correct 414 ms 21464 KB Output is correct
11 Correct 143 ms 18028 KB Output is correct
12 Correct 312 ms 22752 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 6152 KB Output is correct
2 Correct 3 ms 5076 KB Output is correct
3 Correct 3 ms 5076 KB Output is correct
4 Correct 17 ms 7112 KB Output is correct
5 Correct 10 ms 6100 KB Output is correct
6 Correct 5 ms 5052 KB Output is correct
7 Correct 5 ms 5176 KB Output is correct
8 Correct 5 ms 5204 KB Output is correct
9 Correct 4 ms 5052 KB Output is correct
10 Correct 14 ms 6100 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 3 ms 5076 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5072 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 260 ms 21456 KB Output is correct
2 Correct 265 ms 21568 KB Output is correct
3 Correct 271 ms 22800 KB Output is correct
4 Correct 255 ms 21320 KB Output is correct
5 Correct 255 ms 22128 KB Output is correct
6 Correct 262 ms 21484 KB Output is correct
7 Correct 277 ms 22268 KB Output is correct
8 Correct 301 ms 22184 KB Output is correct
9 Correct 251 ms 21716 KB Output is correct
10 Correct 214 ms 21808 KB Output is correct
11 Correct 101 ms 17396 KB Output is correct
12 Correct 316 ms 21560 KB Output is correct
13 Correct 281 ms 21636 KB Output is correct
14 Correct 273 ms 21568 KB Output is correct
15 Correct 271 ms 21336 KB Output is correct
16 Correct 270 ms 21456 KB Output is correct
17 Correct 298 ms 21608 KB Output is correct
18 Correct 310 ms 22552 KB Output is correct
19 Correct 333 ms 22516 KB Output is correct
20 Correct 345 ms 21496 KB Output is correct
21 Correct 361 ms 21592 KB Output is correct
22 Correct 414 ms 21464 KB Output is correct
23 Correct 143 ms 18028 KB Output is correct
24 Correct 312 ms 22752 KB Output is correct
25 Correct 14 ms 6152 KB Output is correct
26 Correct 3 ms 5076 KB Output is correct
27 Correct 3 ms 5076 KB Output is correct
28 Correct 17 ms 7112 KB Output is correct
29 Correct 10 ms 6100 KB Output is correct
30 Correct 5 ms 5052 KB Output is correct
31 Correct 5 ms 5176 KB Output is correct
32 Correct 5 ms 5204 KB Output is correct
33 Correct 4 ms 5052 KB Output is correct
34 Correct 14 ms 6100 KB Output is correct
35 Correct 3 ms 5076 KB Output is correct
36 Correct 3 ms 5076 KB Output is correct
37 Correct 3 ms 5076 KB Output is correct
38 Correct 3 ms 5076 KB Output is correct
39 Correct 3 ms 5072 KB Output is correct
40 Correct 249 ms 21904 KB Output is correct
41 Correct 262 ms 21584 KB Output is correct
42 Correct 257 ms 21724 KB Output is correct
43 Correct 116 ms 19012 KB Output is correct
44 Correct 111 ms 19048 KB Output is correct
45 Correct 241 ms 23384 KB Output is correct
46 Correct 269 ms 23232 KB Output is correct
47 Correct 247 ms 21444 KB Output is correct
48 Correct 117 ms 18416 KB Output is correct
49 Correct 208 ms 21452 KB Output is correct
50 Correct 274 ms 22900 KB Output is correct
51 Correct 235 ms 23324 KB Output is correct