oj.uz

Submission #175808

# Submission time Handle Problem Language Result Execution time Memory
175808 2020-01-07T11:19:37 Z stefdasca Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 660 ms 24552 KB 
#include<bits/stdc++.h>
#define god dimasi5eks
#pragma GCC optimize("O3")
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define mod 1000000007
#define dancila 3.14159265359
#define eps 1e-9

// #define fisier

using namespace std;

typedef long long ll;

int n, m;
int s, t;
int u, v;
vector<pair<int, int> >g[200002];
ll shp[2][100002];
bool viz[2][100002];
struct cmp
{
    bool operator()(pair<ll, pair<int, int> > a,pair<ll, pair<int, int> > b)
    {
        return a.fi > b.fi;
    }
};
priority_queue<pair<ll, pair<int, int> >, vector<pair<ll, pair<int, int> > >, cmp> q;

bool was[2][100002];

void djk(int wh, int st)
{
    viz[wh][st] = 1;
    q.push({0, {0, st}});
    while(!q.empty())
    {
        pair<ll, pair<int, int> > nod = q.top();
        q.pop();
        if(was[wh][nod.se.se])
            continue;
        was[wh][nod.se.se] = 1;
        for(int i = 0; i < g[nod.se.se].size(); ++i)
        {
            int vecin = g[nod.se.se][i].fi;
            int cost = g[nod.se.se][i].se;
            if(!viz[wh][vecin] || nod.fi + cost < shp[wh][vecin])
            {
                 shp[wh][vecin] = nod.fi + cost;
                 viz[wh][vecin] = 1;
                 q.push({shp[wh][vecin], {0, vecin}});
            }
        }
    }
    while(!q.empty())
        q.pop();

}

bool viz2[4][100002];
bool was2[4][100002];
ll cost[4][100002];
int main()
{

    #ifdef fisier
        ifstream f("input.in");
        ofstream g("output.out");
    #endif

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> m;
    cin >> s >> t;
    cin >> u >> v;
    for(int i = 1; i <= m; ++i)
    {
        int a, b, c;
        cin >> a >> b >> c;
        g[a].pb({b, c});
        g[b].pb({a, c});
    }
    djk(0, s);
    djk(1, t);

    viz2[0][u] = 1;
    q.push({0, {0, u}});
    while(!q.empty())
    {
        pair<ll, pair<int, int> > nod = q.top();
        q.pop();
        if(was2[nod.se.fi][nod.se.se])
            continue;
       // cout << nod.fi << " " << nod.se.fi << " " << nod.se.se << '\n';
        was2[nod.se.fi][nod.se.se] = 1;
        for(int i = 0; i < g[nod.se.se].size(); ++i)
        {
            int vecin = g[nod.se.se][i].fi;
            int cs = g[nod.se.se][i].se;
            if(nod.se.fi == 3)
            {
                if(!viz2[3][vecin] || nod.fi + cs < cost[3][vecin])
                {
                     cost[3][vecin] = nod.fi + cs;
                     viz2[3][vecin] = 1;
                     q.push({cost[3][vecin], {3, vecin}});
                }
            }
            if(nod.se.fi == 2)
            {
                if(shp[0][t] == shp[0][vecin] + shp[1][vecin] && shp[0][t] == shp[0][nod.se.se] + shp[1][nod.se.se] && shp[0][vecin] > shp[0][nod.se.se])
                {
                    if(!viz2[2][vecin] || nod.fi < cost[2][vecin])
                    {
                         cost[2][vecin] = nod.fi;
                         viz2[2][vecin] = 1;
                         q.push({cost[2][vecin], {2, vecin}});
                    }
                }
                else
                {
                    if(!viz2[3][vecin] || nod.fi + cs < cost[3][vecin])
                    {
                         cost[3][vecin] = nod.fi + cs;
                         viz2[3][vecin] = 1;
                         q.push({cost[3][vecin], {3, vecin}});
                    }
                }
            }
            if(nod.se.fi == 1)
            {
                if(shp[0][t] == shp[0][vecin] + shp[1][vecin] && shp[0][t] == shp[0][nod.se.se] + shp[1][nod.se.se] && shp[0][vecin] < shp[0][nod.se.se])
                {
                    if(!viz2[1][vecin] || nod.fi < cost[1][vecin])
                    {
                         cost[1][vecin] = nod.fi;
                         viz2[1][vecin] = 1;
                         q.push({cost[1][vecin], {1, vecin}});
                    }
                }
                else
                {
                    if(!viz2[3][vecin] || nod.fi + cs < cost[3][vecin])
                    {
                         cost[3][vecin] = nod.fi + cs;
                         viz2[3][vecin] = 1;
                         q.push({cost[3][vecin], {3, vecin}});
                    }
                }
            }
            if(nod.se.fi == 0)
            {
                if(shp[0][t] == shp[0][vecin] + shp[1][vecin] && shp[0][t] == shp[0][nod.se.se] + shp[1][nod.se.se] && shp[0][vecin] > shp[0][nod.se.se])
                {
                    if(!viz2[2][vecin] || nod.fi < cost[2][vecin])
                    {
                         cost[2][vecin] = nod.fi;
                         viz2[2][vecin] = 1;
                         q.push({cost[2][vecin], {2, vecin}});
                    }
                }
                else
                    if(shp[0][t] == shp[0][vecin] + shp[1][vecin] && shp[0][t] == shp[0][nod.se.se] + shp[1][nod.se.se] && shp[0][vecin] < shp[0][nod.se.se])
                    {
                        if(!viz2[1][vecin] || nod.fi < cost[1][vecin])
                        {
                             cost[1][vecin] = nod.fi;
                             viz2[1][vecin] = 1;
                             q.push({cost[1][vecin], {1, vecin}});
                        }
                    }
                if(!viz2[0][vecin] || nod.fi + cs < cost[0][vecin])
                {
                     cost[0][vecin] = nod.fi + cs;
                     viz2[0][vecin] = 1;
                     q.push({cost[0][vecin], {0, vecin}});
                }
            }
            /*
            int mult = 1;
            if(shp[0][t] == shp[0][nod.se] + shp[1][nod.se] && shp[0][t] == shp[0][vecin] + shp[1][vecin])
                mult = 0;
            if(!viz2[vecin] || nod.fi + cs * mult < cost[vecin])
            {
                 cost[vecin] = nod.fi + cs * mult;
                 viz2[vecin] = 1;
                 q.push({cost[vecin], vecin});
            }
            */
        }
    }
    ll ans = (1LL<<60);
    for(int i = 0; i <= 3; ++i)
        if(viz2[i][v])
            ans = min(ans, cost[i][v]);
    cout << ans << '\n';
    return 0;
}

Compilation message

commuter_pass.cpp: In function 'void djk(int, int)':
commuter_pass.cpp:46:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = 0; i < g[nod.se.se].size(); ++i)
                        ~~^~~~~~~~~~~~~~~~~~~~~
commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:100:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = 0; i < g[nod.se.se].size(); ++i)
                        ~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 660 ms 23524 KB Output is correct
2 Correct 487 ms 22344 KB Output is correct
3 Correct 560 ms 23264 KB Output is correct
4 Correct 481 ms 21744 KB Output is correct
5 Correct 489 ms 22516 KB Output is correct
6 Correct 494 ms 23476 KB Output is correct
7 Correct 537 ms 22504 KB Output is correct
8 Correct 541 ms 22508 KB Output is correct
9 Correct 441 ms 22028 KB Output is correct
10 Correct 329 ms 22000 KB Output is correct
11 Correct 207 ms 16872 KB Output is correct
12 Correct 454 ms 22000 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 563 ms 23016 KB Output is correct
2 Correct 575 ms 22580 KB Output is correct
3 Correct 532 ms 22884 KB Output is correct
4 Correct 526 ms 22628 KB Output is correct
5 Correct 548 ms 22584 KB Output is correct
6 Correct 534 ms 23272 KB Output is correct
7 Correct 593 ms 23816 KB Output is correct
8 Correct 515 ms 22472 KB Output is correct
9 Correct 540 ms 22504 KB Output is correct
10 Correct 540 ms 22628 KB Output is correct
11 Correct 246 ms 17236 KB Output is correct
12 Correct 556 ms 23272 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 6268 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 7 ms 5240 KB Output is correct
4 Correct 24 ms 7160 KB Output is correct
5 Correct 16 ms 6264 KB Output is correct
6 Correct 6 ms 5240 KB Output is correct
7 Correct 8 ms 5240 KB Output is correct
8 Correct 11 ms 5244 KB Output is correct
9 Correct 8 ms 5240 KB Output is correct
10 Correct 16 ms 6136 KB Output is correct
11 Correct 6 ms 5240 KB Output is correct
12 Correct 6 ms 5116 KB Output is correct
13 Correct 7 ms 5112 KB Output is correct
14 Correct 9 ms 5240 KB Output is correct
15 Correct 7 ms 5240 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 660 ms 23524 KB Output is correct
2 Correct 487 ms 22344 KB Output is correct
3 Correct 560 ms 23264 KB Output is correct
4 Correct 481 ms 21744 KB Output is correct
5 Correct 489 ms 22516 KB Output is correct
6 Correct 494 ms 23476 KB Output is correct
7 Correct 537 ms 22504 KB Output is correct
8 Correct 541 ms 22508 KB Output is correct
9 Correct 441 ms 22028 KB Output is correct
10 Correct 329 ms 22000 KB Output is correct
11 Correct 207 ms 16872 KB Output is correct
12 Correct 454 ms 22000 KB Output is correct
13 Correct 563 ms 23016 KB Output is correct
14 Correct 575 ms 22580 KB Output is correct
15 Correct 532 ms 22884 KB Output is correct
16 Correct 526 ms 22628 KB Output is correct
17 Correct 548 ms 22584 KB Output is correct
18 Correct 534 ms 23272 KB Output is correct
19 Correct 593 ms 23816 KB Output is correct
20 Correct 515 ms 22472 KB Output is correct
21 Correct 540 ms 22504 KB Output is correct
22 Correct 540 ms 22628 KB Output is correct
23 Correct 246 ms 17236 KB Output is correct
24 Correct 556 ms 23272 KB Output is correct
25 Correct 17 ms 6268 KB Output is correct
26 Correct 6 ms 5112 KB Output is correct
27 Correct 7 ms 5240 KB Output is correct
28 Correct 24 ms 7160 KB Output is correct
29 Correct 16 ms 6264 KB Output is correct
30 Correct 6 ms 5240 KB Output is correct
31 Correct 8 ms 5240 KB Output is correct
32 Correct 11 ms 5244 KB Output is correct
33 Correct 8 ms 5240 KB Output is correct
34 Correct 16 ms 6136 KB Output is correct
35 Correct 6 ms 5240 KB Output is correct
36 Correct 6 ms 5116 KB Output is correct
37 Correct 7 ms 5112 KB Output is correct
38 Correct 9 ms 5240 KB Output is correct
39 Correct 7 ms 5240 KB Output is correct
40 Correct 462 ms 23172 KB Output is correct
41 Correct 413 ms 20720 KB Output is correct
42 Correct 431 ms 20844 KB Output is correct
43 Correct 270 ms 17008 KB Output is correct
44 Correct 254 ms 17132 KB Output is correct
45 Correct 551 ms 22792 KB Output is correct
46 Correct 533 ms 24552 KB Output is correct
47 Correct 490 ms 22504 KB Output is correct
48 Correct 552 ms 16460 KB Output is correct
49 Correct 393 ms 22860 KB Output is correct
50 Correct 610 ms 23396 KB Output is correct
51 Correct 596 ms 23668 KB Output is correct