oj.uz

Submission #127200

# Submission time Handle Problem Language Result Execution time Memory
127200 2019-07-09T06:21:43 Z FutymyClone Commuter Pass (JOI18_commuter_pass) C++14
31 / 100
 406 ms 17304 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 5;

int n, m, s, t, s2, t2;
long long d[N], d2[N], d3[N];
vector <pair <int, int> > g[N];
priority_queue <pair <long long, int>, vector <pair <long long, int> >, greater <pair <long long, int> > > pq;

int main(){
    scanf("%d %d", &n, &m);
    scanf("%d %d", &s, &t);
    scanf("%d %d", &s2, &t2);
    for (int i = 1; i <= m; i++) {
        int u, v, w;
        scanf("%d %d %d", &u, &v, &w);
        g[u].push_back({w, v});
        g[v].push_back({w, u});
    }

    memset(d, 0x3f, sizeof(d));
    d[s] = 0; pq.push({d[s], s});
    while (!pq.empty()) {
        pair <long long, int> val = pq.top(); pq.pop();
        long long dist = val.first;
        int u = val.second;

        if (dist == d[u]) {
            for (auto V: g[u]) {
                int w = V.first, v = V.second;
                if (d[v] > d[u] + w) {
                    d[v] = d[u] + w;
                    pq.push({d[v], v});
                }
            }
        }
    }

    memset(d3, 0x3f, sizeof(d3));
    d3[t] = 0; pq.push({d3[t], t});
    while (!pq.empty()) {
        pair <long long, int> val = pq.top(); pq.pop();
        long long dist = val.first;
        int u = val.second;

        if (dist == d3[u]) {
            for (auto V: g[u]) {
                int w = V.first, v = V.second;
                if (d3[v] > d3[u] + w) {
                    d3[v] = d3[u] + w;
                    pq.push({d3[v], v});
                }
            }
        }
    }

    memset(d2, 0x3f, sizeof(d2));
    d2[s2] = 0; pq.push({d2[s2], s2});
    while (!pq.empty()) {
        pair <long long, int> val = pq.top(); pq.pop();
        long long dist = val.first;
        int u = val.second;

        if (dist == d2[u]) {
            for (auto V: g[u]) {
                int v = V.second;
                int w = (d[u] + d3[v] + V.first == d[t] || d[v] + d3[u] + V.first == d[t] ? 0 : V.first);
                if (d2[v] > d2[u] + w) {
                    d2[v] = d2[u] + w;
                    pq.push({d2[v], v});
                }
            }
        }
    }

    printf("%lld", d2[t2]);
    return 0;
}

Compilation message

commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:13:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~~
commuter_pass.cpp:14:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &s, &t);
     ~~~~~^~~~~~~~~~~~~~~~~
commuter_pass.cpp:15:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &s2, &t2);
     ~~~~~^~~~~~~~~~~~~~~~~~~
commuter_pass.cpp:18:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d", &u, &v, &w);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 312 ms 16484 KB Output is correct
2 Correct 320 ms 16000 KB Output is correct
3 Correct 318 ms 16464 KB Output is correct
4 Correct 308 ms 16316 KB Output is correct
5 Correct 291 ms 15704 KB Output is correct
6 Correct 346 ms 16480 KB Output is correct
7 Correct 314 ms 15864 KB Output is correct
8 Correct 326 ms 15852 KB Output is correct
9 Correct 312 ms 16492 KB Output is correct
10 Correct 287 ms 16476 KB Output is correct
11 Correct 141 ms 10232 KB Output is correct
12 Correct 354 ms 16492 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 406 ms 17304 KB Output is correct
2 Correct 326 ms 15820 KB Output is correct
3 Correct 340 ms 17004 KB Output is correct
4 Correct 339 ms 15972 KB Output is correct
5 Correct 353 ms 16056 KB Output is correct
6 Correct 330 ms 16104 KB Output is correct
7 Correct 346 ms 17000 KB Output is correct
8 Correct 334 ms 15824 KB Output is correct
9 Correct 333 ms 16872 KB Output is correct
10 Correct 360 ms 15912 KB Output is correct
11 Correct 120 ms 10292 KB Output is correct
12 Correct 300 ms 16108 KB Output is correct

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 6136 KB Output is correct
2 Correct 8 ms 4984 KB Output is correct
3 Incorrect 6 ms 4984 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 312 ms 16484 KB Output is correct
2 Correct 320 ms 16000 KB Output is correct
3 Correct 318 ms 16464 KB Output is correct
4 Correct 308 ms 16316 KB Output is correct
5 Correct 291 ms 15704 KB Output is correct
6 Correct 346 ms 16480 KB Output is correct
7 Correct 314 ms 15864 KB Output is correct
8 Correct 326 ms 15852 KB Output is correct
9 Correct 312 ms 16492 KB Output is correct
10 Correct 287 ms 16476 KB Output is correct
11 Correct 141 ms 10232 KB Output is correct
12 Correct 354 ms 16492 KB Output is correct
13 Correct 406 ms 17304 KB Output is correct
14 Correct 326 ms 15820 KB Output is correct
15 Correct 340 ms 17004 KB Output is correct
16 Correct 339 ms 15972 KB Output is correct
17 Correct 353 ms 16056 KB Output is correct
18 Correct 330 ms 16104 KB Output is correct
19 Correct 346 ms 17000 KB Output is correct
20 Correct 334 ms 15824 KB Output is correct
21 Correct 333 ms 16872 KB Output is correct
22 Correct 360 ms 15912 KB Output is correct
23 Correct 120 ms 10292 KB Output is correct
24 Correct 300 ms 16108 KB Output is correct
25 Correct 16 ms 6136 KB Output is correct
26 Correct 8 ms 4984 KB Output is correct
27 Incorrect 6 ms 4984 KB Output isn't correct
28 Halted 0 ms 0 KB -