oj.uz

Submission #210382

# Submission time Handle Problem Language Result Execution time Memory
210382 2020-03-17T08:36:15 Z SamAnd Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 450 ms 33580 KB 
#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
const int N = 200005;
struct ban
{
    int x;
    long long d;
    ban(){}
    ban(int x, long long d)
    {
        this->x = x;
        this->d = d;
    }
};
bool operator<(const ban& a, const ban& b)
{
    return a.d > b.d;
}

int n, m;
int s, t;
int u, v;
vector<ban> a[N];

long long ds[N], dt[N], du[N], dv[N];

bool c[N];
void djk(int x, long long d[])
{
    memset(c, false, sizeof c);
    priority_queue<ban> q;
    q.push(ban(x, 0));
    while (1)
    {
        ban t;
        do
        {
            if (q.empty())
                return;
            t = q.top();
            q.pop();
        } while(c[t.x]);
        c[t.x] = true;
        d[t.x] = t.d;
        for (int i = 0; i < a[t.x].size(); ++i)
        {
            ban h = a[t.x][i];
            h.d += t.d;
            if (!c[h.x])
                q.push(h);
        }
    }
}

vector<int> g[N];

long long ans;

long long minu[N], minv[N];
void dfs(int x)
{
    if (c[x])
        return;
    c[x] = true;
    minu[x] = du[x];
    minv[x] = dv[x];
    for (int i = 0; i < g[x].size(); ++i)
    {
        int h = g[x][i];
        dfs(h);
        minu[x] = min(minu[x], minu[h]);
        minv[x] = min(minv[x], minv[h]);
    }
    ans = min(ans, minu[x] + dv[x]);
    ans = min(ans, minv[x] + du[x]);
}

int main()
{
    scanf("%d%d", &n, &m);
    scanf("%d%d", &s, &t);
    scanf("%d%d", &v, &u);
    for (int i = 0; i < m; ++i)
    {
        int x, y, d;
        scanf("%d%d%d", &x, &y, &d);
        a[x].push_back(ban(y, d));
        a[y].push_back(ban(x, d));
    }
    djk(s, ds);
    djk(t, dt);
    djk(u, du);
    djk(v, dv);
    for (int x = 1; x <= n; ++x)
    {
        for (int i = 0; i < a[x].size(); ++i)
        {
            ban h = a[x][i];
            if (ds[x] + h.d + dt[h.x] == ds[t])
                g[x].push_back(h.x);
        }
    }
    ans = du[v];
    memset(c, false, sizeof c);
    dfs(s);
    printf("%lld\n", ans);
    return 0;
}

Compilation message

commuter_pass.cpp: In function 'void djk(int, long long int*)':
commuter_pass.cpp:46:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < a[t.x].size(); ++i)
                         ~~^~~~~~~~~~~~~~~
commuter_pass.cpp: In function 'void dfs(int)':
commuter_pass.cpp:68:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < g[x].size(); ++i)
                     ~~^~~~~~~~~~~~~
commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:97:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < a[x].size(); ++i)
                         ~~^~~~~~~~~~~~~
commuter_pass.cpp:81: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:82: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:83:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &v, &u);
     ~~~~~^~~~~~~~~~~~~~~~
commuter_pass.cpp:87:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d", &x, &y, &d);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 419 ms 28064 KB Output is correct
2 Correct 402 ms 27568 KB Output is correct
3 Correct 426 ms 30340 KB Output is correct
4 Correct 416 ms 27732 KB Output is correct
5 Correct 409 ms 27304 KB Output is correct
6 Correct 437 ms 28076 KB Output is correct
7 Correct 412 ms 27596 KB Output is correct
8 Correct 420 ms 27700 KB Output is correct
9 Correct 428 ms 27680 KB Output is correct
10 Correct 330 ms 27624 KB Output is correct
11 Correct 155 ms 22904 KB Output is correct
12 Correct 444 ms 26896 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 437 ms 27044 KB Output is correct
2 Correct 395 ms 26848 KB Output is correct
3 Correct 414 ms 31832 KB Output is correct
4 Correct 408 ms 30136 KB Output is correct
5 Correct 417 ms 30652 KB Output is correct
6 Correct 427 ms 32668 KB Output is correct
7 Correct 411 ms 33580 KB Output is correct
8 Correct 403 ms 30212 KB Output is correct
9 Correct 410 ms 30692 KB Output is correct
10 Correct 408 ms 30084 KB Output is correct
11 Correct 165 ms 26488 KB Output is correct
12 Correct 421 ms 33044 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 11884 KB Output is correct
2 Correct 11 ms 9976 KB Output is correct
3 Correct 11 ms 9976 KB Output is correct
4 Correct 65 ms 13464 KB Output is correct
5 Correct 31 ms 12112 KB Output is correct
6 Correct 11 ms 10104 KB Output is correct
7 Correct 13 ms 10104 KB Output is correct
8 Correct 13 ms 10232 KB Output is correct
9 Correct 12 ms 10104 KB Output is correct
10 Correct 34 ms 12072 KB Output is correct
11 Correct 10 ms 9976 KB Output is correct
12 Correct 10 ms 9976 KB Output is correct
13 Correct 11 ms 9976 KB Output is correct
14 Correct 11 ms 9976 KB Output is correct
15 Correct 11 ms 9976 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 419 ms 28064 KB Output is correct
2 Correct 402 ms 27568 KB Output is correct
3 Correct 426 ms 30340 KB Output is correct
4 Correct 416 ms 27732 KB Output is correct
5 Correct 409 ms 27304 KB Output is correct
6 Correct 437 ms 28076 KB Output is correct
7 Correct 412 ms 27596 KB Output is correct
8 Correct 420 ms 27700 KB Output is correct
9 Correct 428 ms 27680 KB Output is correct
10 Correct 330 ms 27624 KB Output is correct
11 Correct 155 ms 22904 KB Output is correct
12 Correct 444 ms 26896 KB Output is correct
13 Correct 437 ms 27044 KB Output is correct
14 Correct 395 ms 26848 KB Output is correct
15 Correct 414 ms 31832 KB Output is correct
16 Correct 408 ms 30136 KB Output is correct
17 Correct 417 ms 30652 KB Output is correct
18 Correct 427 ms 32668 KB Output is correct
19 Correct 411 ms 33580 KB Output is correct
20 Correct 403 ms 30212 KB Output is correct
21 Correct 410 ms 30692 KB Output is correct
22 Correct 408 ms 30084 KB Output is correct
23 Correct 165 ms 26488 KB Output is correct
24 Correct 421 ms 33044 KB Output is correct
25 Correct 33 ms 11884 KB Output is correct
26 Correct 11 ms 9976 KB Output is correct
27 Correct 11 ms 9976 KB Output is correct
28 Correct 65 ms 13464 KB Output is correct
29 Correct 31 ms 12112 KB Output is correct
30 Correct 11 ms 10104 KB Output is correct
31 Correct 13 ms 10104 KB Output is correct
32 Correct 13 ms 10232 KB Output is correct
33 Correct 12 ms 10104 KB Output is correct
34 Correct 34 ms 12072 KB Output is correct
35 Correct 10 ms 9976 KB Output is correct
36 Correct 10 ms 9976 KB Output is correct
37 Correct 11 ms 9976 KB Output is correct
38 Correct 11 ms 9976 KB Output is correct
39 Correct 11 ms 9976 KB Output is correct
40 Correct 406 ms 30748 KB Output is correct
41 Correct 421 ms 31184 KB Output is correct
42 Correct 414 ms 31096 KB Output is correct
43 Correct 179 ms 27256 KB Output is correct
44 Correct 160 ms 27128 KB Output is correct
45 Correct 429 ms 30964 KB Output is correct
46 Correct 423 ms 30728 KB Output is correct
47 Correct 420 ms 30664 KB Output is correct
48 Correct 179 ms 25080 KB Output is correct
49 Correct 415 ms 30112 KB Output is correct
50 Correct 421 ms 30268 KB Output is correct
51 Correct 450 ms 30980 KB Output is correct