oj.uz

Submission #856372

# Submission time Handle Problem Language Result Execution time Memory
856372 2023-10-03T09:17:31 Z hgglmao Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 219 ms 32560 KB 
#include <bits/stdc++.h>
#define TASK "commuter_pass"
#define f first
#define s second

using namespace std;

typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, ll> ill;
typedef pair<ll, int> lli;
typedef pair<ll, ll> pll;

const int MAX = 1e5 + 10;
const int MOD = 1e9 + 7;

class state
{
public:
        int v;
        ll w;
        bool cont, cur_cont;
        state() { v = w = cont = cur_cont = 0; }
        state(const int &I_v, const ll &I_w, const bool &I_cont, const bool &I_ccont)
        {
                v = I_v;
                w = I_w;
                cont = I_cont;
                cur_cont = I_ccont;
        }

        bool operator<(const state &SE) const { return w > SE.w; }
};

struct cmp
{
        bool operator()(ill FI, ill SE) { return FI.s > SE.s; }
};

int n, m, free_start, free_end, p_start, p_end;
vector<ii> e[MAX];
ll fdist[2][MAX];
priority_queue<ill, vector<ill>, cmp> qx;

void DIJKSTRA_BUILD(int start, int nt)
{
        for (int i = 1; i <= n; ++i)
                fdist[nt][i] = LLONG_MAX;
        fdist[nt][start] = 0;
        qx.push({start, 0});

        while (qx.size())
        {
                int cv = qx.top().f;
                ll cw = qx.top().s;
                qx.pop();
                if (fdist[nt][cv] < cw)
                        continue;

                for (auto itr : e[cv])
                {
                        int nv = itr.f, nxw = itr.s;
                        if (fdist[nt][nv] > cw + nxw)
                        {
                                fdist[nt][nv] = cw + nxw;
                                qx.push({nv, cw + nxw});
                        }
                }
        }
}

ll rdist[MAX][2][2];
priority_queue<state> qrx;
ll result = LLONG_MAX;

bool IN_PATH(int v1, int v2, int w)
{
        return fdist[0][v1] + fdist[1][v2] + w == fdist[0][free_end];
}

void DIJKSTRA_RUN(int z_start, int z_end)
{
        for (int i = 1; i <= n; ++i)
                for (int j = 0; j < 2; ++j)
                        rdist[i][j][0] = rdist[i][j][1] = LLONG_MAX;
        rdist[z_start][0][0] = 0;
        qrx.push(state(z_start, 0, 0, 0));
        while (qrx.size())
        {
                int cv = qrx.top().v;
                ll cw = qrx.top().w;
                bool cc1 = qrx.top().cont, cc2 = qrx.top().cur_cont;
                qrx.pop();
                if (cw > rdist[cv][cc1][cc2])
                        continue;
                if (cv == z_end)
                        break;

                for (auto itr : e[cv])
                {
                        int nv = itr.f, nxw = itr.s;
                        if (rdist[nv][cc1][0] > cw + nxw)
                        {
                                rdist[nv][cc1][0] = cw + nxw;
                                qrx.push(state(nv, cw + nxw, cc1, 0));
                        }
                        if (IN_PATH(cv, nv, nxw))
                        {
                                if (cc1 && !cc2)
                                        continue;
                                if (rdist[nv][1][1] > cw)
                                {
                                        rdist[nv][1][1] = cw;
                                        qrx.push(state(nv, cw, 1, 1));
                                }
                        }
                }
        }
        result = min({result, rdist[z_end][1][1], rdist[z_end][1][0], rdist[z_end][0][0]});
}

int main()
{
        ios_base::sync_with_stdio(0);
        cin.tie(0);
        cout.tie(0);

        if (fopen(TASK ".inp", "r"))
        {
                freopen(TASK ".inp", "r", stdin);
                freopen(TASK ".out", "w", stdout);
        }

        cin >> n >> m >> free_start >> free_end >> p_start >> p_end;
        while (m--)
        {
                int u1, u2, uw;
                cin >> u1 >> u2 >> uw;
                e[u1].push_back({u2, uw});
                e[u2].push_back({u1, uw});
        }

        DIJKSTRA_BUILD(free_start, 0);
        DIJKSTRA_BUILD(free_end, 1);

        DIJKSTRA_RUN(p_start, p_end);
        DIJKSTRA_RUN(p_end, p_start);
        cout << result;
}

Compilation message

commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:130:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  130 |                 freopen(TASK ".inp", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
commuter_pass.cpp:131:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  131 |                 freopen(TASK ".out", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 169 ms 26552 KB Output is correct
2 Correct 184 ms 25852 KB Output is correct
3 Correct 197 ms 26524 KB Output is correct
4 Correct 153 ms 22928 KB Output is correct
5 Correct 203 ms 24968 KB Output is correct
6 Correct 181 ms 28356 KB Output is correct
7 Correct 160 ms 25380 KB Output is correct
8 Correct 153 ms 26048 KB Output is correct
9 Correct 146 ms 22720 KB Output is correct
10 Correct 120 ms 26388 KB Output is correct
11 Correct 68 ms 14204 KB Output is correct
12 Correct 163 ms 23576 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 139 ms 20560 KB Output is correct
2 Correct 145 ms 26748 KB Output is correct
3 Correct 191 ms 26816 KB Output is correct
4 Correct 195 ms 25004 KB Output is correct
5 Correct 144 ms 21944 KB Output is correct
6 Correct 200 ms 25532 KB Output is correct
7 Correct 206 ms 25216 KB Output is correct
8 Correct 203 ms 26036 KB Output is correct
9 Correct 137 ms 22460 KB Output is correct
10 Correct 123 ms 22604 KB Output is correct
11 Correct 78 ms 17248 KB Output is correct
12 Correct 217 ms 26208 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 6316 KB Output is correct
2 Correct 1 ms 5212 KB Output is correct
3 Correct 1 ms 5208 KB Output is correct
4 Correct 10 ms 7280 KB Output is correct
5 Correct 6 ms 6236 KB Output is correct
6 Correct 2 ms 5212 KB Output is correct
7 Correct 2 ms 5468 KB Output is correct
8 Correct 2 ms 5468 KB Output is correct
9 Correct 2 ms 5212 KB Output is correct
10 Correct 6 ms 6236 KB Output is correct
11 Correct 1 ms 5256 KB Output is correct
12 Correct 1 ms 5464 KB Output is correct
13 Correct 1 ms 5248 KB Output is correct
14 Correct 1 ms 5212 KB Output is correct
15 Correct 1 ms 5288 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 169 ms 26552 KB Output is correct
2 Correct 184 ms 25852 KB Output is correct
3 Correct 197 ms 26524 KB Output is correct
4 Correct 153 ms 22928 KB Output is correct
5 Correct 203 ms 24968 KB Output is correct
6 Correct 181 ms 28356 KB Output is correct
7 Correct 160 ms 25380 KB Output is correct
8 Correct 153 ms 26048 KB Output is correct
9 Correct 146 ms 22720 KB Output is correct
10 Correct 120 ms 26388 KB Output is correct
11 Correct 68 ms 14204 KB Output is correct
12 Correct 163 ms 23576 KB Output is correct
13 Correct 139 ms 20560 KB Output is correct
14 Correct 145 ms 26748 KB Output is correct
15 Correct 191 ms 26816 KB Output is correct
16 Correct 195 ms 25004 KB Output is correct
17 Correct 144 ms 21944 KB Output is correct
18 Correct 200 ms 25532 KB Output is correct
19 Correct 206 ms 25216 KB Output is correct
20 Correct 203 ms 26036 KB Output is correct
21 Correct 137 ms 22460 KB Output is correct
22 Correct 123 ms 22604 KB Output is correct
23 Correct 78 ms 17248 KB Output is correct
24 Correct 217 ms 26208 KB Output is correct
25 Correct 7 ms 6316 KB Output is correct
26 Correct 1 ms 5212 KB Output is correct
27 Correct 1 ms 5208 KB Output is correct
28 Correct 10 ms 7280 KB Output is correct
29 Correct 6 ms 6236 KB Output is correct
30 Correct 2 ms 5212 KB Output is correct
31 Correct 2 ms 5468 KB Output is correct
32 Correct 2 ms 5468 KB Output is correct
33 Correct 2 ms 5212 KB Output is correct
34 Correct 6 ms 6236 KB Output is correct
35 Correct 1 ms 5256 KB Output is correct
36 Correct 1 ms 5464 KB Output is correct
37 Correct 1 ms 5248 KB Output is correct
38 Correct 1 ms 5212 KB Output is correct
39 Correct 1 ms 5288 KB Output is correct
40 Correct 197 ms 26684 KB Output is correct
41 Correct 124 ms 23636 KB Output is correct
42 Correct 140 ms 24004 KB Output is correct
43 Correct 101 ms 15820 KB Output is correct
44 Correct 80 ms 16584 KB Output is correct
45 Correct 216 ms 31164 KB Output is correct
46 Correct 182 ms 24820 KB Output is correct
47 Correct 219 ms 26380 KB Output is correct
48 Correct 91 ms 16816 KB Output is correct
49 Correct 173 ms 32560 KB Output is correct
50 Correct 186 ms 26560 KB Output is correct
51 Correct 153 ms 24768 KB Output is correct