oj.uz

Submission #204069

# Submission time Handle Problem Language Result Execution time Memory
204069 2020-02-24T07:26:00 Z Kastanda Commuter Pass (JOI18_commuter_pass) C++11
100 / 100
 405 ms 30956 KB 
// In The Name Of The Queen
#include<bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef long long ll;
const int N = 100005;
int n, m, st, fn, vs, ut, M[N], M2[N];
ll Mn = LLONG_MAX, dp[N];
vector < int > Ad[N], Adt[N];
vector < pair < int , int > > Adj[N];
priority_queue < pair < ll , int > > Pq;
vector < ll > Dst, Dvs, Dut;
vector < ll > SSSP(int v)
{
    vector < ll > D(n + 1, (ll)(1e18));
    D[v] = 0; Pq.push({0, v});
    while (Pq.size())
    {
        ll d = - Pq.top().first;
        v = Pq.top().second; Pq.pop();
        if (d > D[v])
            continue;
        for (auto u : Adj[v])
            if (D[u.x] > D[v] + u.y)
                D[u.x] = D[v] + u.y, Pq.push({-D[u.x], u.x});
    }
    return (D);
}
void DFS(int v)
{
    M[v] = 1;
    dp[v] = Dut[v];
    for (int u : Ad[v])
    {
        if (!M2[u])
            continue;
        if (!M[u])
            DFS(u);
        dp[v] = min(dp[v], dp[u]);
        Mn = min(Mn, Dvs[v] + dp[u]);
    }
}
void DFS2(int v)
{
    M2[v] = 1;
    for (int u : Adt[v])
        if (!M2[u])
            DFS2(u);
}
int main()
{
    scanf("%d%d%d%d%d%d", &n, &m, &st, &fn, &vs, &ut);
    for (int i = 1; i <= m; i ++)
    {
        int v, u, w;
        scanf("%d%d%d", &v, &u, &w);
        Adj[v].push_back({u, w});
        Adj[u].push_back({v, w});
    }
    Dst = SSSP(st);
    Dvs = SSSP(vs);
    Dut = SSSP(ut);
    for (int i = 1; i <= n; i ++)
        for (auto u : Adj[i])
            if (Dst[u.x] == Dst[i] + u.y)
                Ad[i].push_back(u.x),
                Adt[u.x].push_back(i);
    Mn = Dvs[ut];
    DFS2(fn);
    DFS(st);
    Dvs.swap(Dut);
    memset(M, 0, sizeof(M));
    DFS(st);
    return !printf("%lld\n", Mn);
}

Compilation message

commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:53:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d%d%d%d", &n, &m, &st, &fn, &vs, &ut);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
commuter_pass.cpp:57:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d", &v, &u, &w);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 354 ms 22024 KB Output is correct
2 Correct 372 ms 27248 KB Output is correct
3 Correct 405 ms 30956 KB Output is correct
4 Correct 355 ms 26384 KB Output is correct
5 Correct 390 ms 27628 KB Output is correct
6 Correct 358 ms 25704 KB Output is correct
7 Correct 400 ms 27884 KB Output is correct
8 Correct 400 ms 27884 KB Output is correct
9 Correct 354 ms 26092 KB Output is correct
10 Correct 293 ms 25836 KB Output is correct
11 Correct 194 ms 24648 KB Output is correct
12 Correct 348 ms 26988 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 359 ms 24572 KB Output is correct
2 Correct 379 ms 28268 KB Output is correct
3 Correct 367 ms 28012 KB Output is correct
4 Correct 370 ms 28396 KB Output is correct
5 Correct 371 ms 28468 KB Output is correct
6 Correct 373 ms 30716 KB Output is correct
7 Correct 397 ms 30828 KB Output is correct
8 Correct 374 ms 28268 KB Output is correct
9 Correct 372 ms 28552 KB Output is correct
10 Correct 369 ms 28268 KB Output is correct
11 Correct 201 ms 25696 KB Output is correct
12 Correct 377 ms 30828 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 8568 KB Output is correct
2 Correct 9 ms 7800 KB Output is correct
3 Correct 10 ms 7800 KB Output is correct
4 Correct 30 ms 9976 KB Output is correct
5 Correct 18 ms 8828 KB Output is correct
6 Correct 10 ms 7800 KB Output is correct
7 Correct 11 ms 7928 KB Output is correct
8 Correct 11 ms 7928 KB Output is correct
9 Correct 10 ms 7804 KB Output is correct
10 Correct 20 ms 8824 KB Output is correct
11 Correct 9 ms 7800 KB Output is correct
12 Correct 9 ms 7800 KB Output is correct
13 Correct 10 ms 7800 KB Output is correct
14 Correct 10 ms 7800 KB Output is correct
15 Correct 10 ms 7800 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 354 ms 22024 KB Output is correct
2 Correct 372 ms 27248 KB Output is correct
3 Correct 405 ms 30956 KB Output is correct
4 Correct 355 ms 26384 KB Output is correct
5 Correct 390 ms 27628 KB Output is correct
6 Correct 358 ms 25704 KB Output is correct
7 Correct 400 ms 27884 KB Output is correct
8 Correct 400 ms 27884 KB Output is correct
9 Correct 354 ms 26092 KB Output is correct
10 Correct 293 ms 25836 KB Output is correct
11 Correct 194 ms 24648 KB Output is correct
12 Correct 348 ms 26988 KB Output is correct
13 Correct 359 ms 24572 KB Output is correct
14 Correct 379 ms 28268 KB Output is correct
15 Correct 367 ms 28012 KB Output is correct
16 Correct 370 ms 28396 KB Output is correct
17 Correct 371 ms 28468 KB Output is correct
18 Correct 373 ms 30716 KB Output is correct
19 Correct 397 ms 30828 KB Output is correct
20 Correct 374 ms 28268 KB Output is correct
21 Correct 372 ms 28552 KB Output is correct
22 Correct 369 ms 28268 KB Output is correct
23 Correct 201 ms 25696 KB Output is correct
24 Correct 377 ms 30828 KB Output is correct
25 Correct 20 ms 8568 KB Output is correct
26 Correct 9 ms 7800 KB Output is correct
27 Correct 10 ms 7800 KB Output is correct
28 Correct 30 ms 9976 KB Output is correct
29 Correct 18 ms 8828 KB Output is correct
30 Correct 10 ms 7800 KB Output is correct
31 Correct 11 ms 7928 KB Output is correct
32 Correct 11 ms 7928 KB Output is correct
33 Correct 10 ms 7804 KB Output is correct
34 Correct 20 ms 8824 KB Output is correct
35 Correct 9 ms 7800 KB Output is correct
36 Correct 9 ms 7800 KB Output is correct
37 Correct 10 ms 7800 KB Output is correct
38 Correct 10 ms 7800 KB Output is correct
39 Correct 10 ms 7800 KB Output is correct
40 Correct 317 ms 25608 KB Output is correct
41 Correct 336 ms 25976 KB Output is correct
42 Correct 340 ms 26092 KB Output is correct
43 Correct 224 ms 25208 KB Output is correct
44 Correct 227 ms 25208 KB Output is correct
45 Correct 401 ms 27516 KB Output is correct
46 Correct 398 ms 27244 KB Output is correct
47 Correct 378 ms 27208 KB Output is correct
48 Correct 219 ms 23032 KB Output is correct
49 Correct 314 ms 26480 KB Output is correct
50 Correct 384 ms 27220 KB Output is correct
51 Correct 390 ms 27500 KB Output is correct