oj.uz

Submission #413458

# Submission time Handle Problem Language Result Execution time Memory
413458 2021-05-28T18:08:00 Z egorlifar Robot (JOI21_ho_t4) C++17
100 / 100
 1660 ms 114756 KB 
/*
KAMUI!
▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓ 
▓▓▓▓▓▓▓▓▓▓▓▓▓██████████▓▓▓▓▓▓▓▓▓▓▓▓▓▓ 
▓▓▓▓▓▓▓▓▓▓███▓▓▓▓▓▓▓▓▓▓█████▓▓▓▓▓▓▓▓▓
▓▓▓▓▓▓▓███▓▒▒░▒▒▒▒▒░░░▒▒▒▓▓███▓▓▓▓▓▓▓ 
▓▓▓▓▓▓█▓▒▒▒▓▓████████▓▒▒░▒▒▒▓██▓▓▓▓▓▓
▓▓▓▓██▒▓████████████████▓░▒▒▒▒▓██▓▓▓▓ 
▓▓▓██▓███████▓▒░░░░░░░▒███▒░░▒▒▒██▓▓▓ 
▓▓█████████▓░░░░░░░░░░░░░██▓▓██████▓▓ 
▓▓█▒▓███████████▓▓▒▒▒▓▓██████████▓█▓▓ 
▓██▒▒▒███████████████████████████▓▓█▓ 
▓█▓▒▒░░████████▒░░░░▓███████████▓░▒█▓ 
▓█▒▒▒░██░▒████░░░░░░█████░░████▓░░▒█▓ 
▓█▒▒▒▒██░░░██▓░░░░░░░███▒░░████▒▒▒▒█▓ 
▓█▓▒▒▒██▒░░░▓█▓░░░░░▓█▓░░░▓███▓▒▒░▓█▓ 
▓█▓▒▒▒███░░░░████████▓░░░░░████▒▒▒▓█▓ 
▓▓█▒▒░▓███░░░▒███████▒░░░▒███▓▒▒▒▒█▓▓ 
▓▓██▒▒░████▒░░███████░░░▓███▓░▒▒▒██▓▓ 
▓▓▓██▒▒▒█████▓░░██████▒▓███▓▒░▒▒██▓▓▓ 
▓▓▓▓██▓▒░▓██████████████▓▒░▒▒▒▓██▓▓▓▓ 
▓▓▓▓▓▓██▓░▒▓█████████▒░░▒▒▒▒▓██▓▓▓▓▓▓ 
▓▓▓▓▓▓▓███▓▒▒▓██████▓░▒▒▒▓▓███▓▓▓▓▓▓▓ 
▓▓▓▓▓▓▓▓▓▓▓███▓▓▓▓███▓▓▓████▓▓▓▓▓▓▓▓▓ 
▓▓▓▓▓▓▓▓▓▓▓▓▓███████████▓▓▓▓▓▓▓▓▓▓▓▓▓ 
▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
*/
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
#include <array>
 
using namespace std;
template<typename T1, typename T2> inline void chkmin(T1 &a, T2 b) {if (a > b) a = b;}
template<typename T1, typename T2> inline void chkmax(T1 &a, T2 b) {if (a < b) a = b;}
#define files(FILENAME) read(FILENAME); write(FILENAME)
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define all(c) (c).begin(), (c).end()
#define sz(c) (int)(c).size()
#define left left228
#define right right228
#define y1 y1228
#define mp make_pair
#define pb push_back
#define y2 y2228
#define rank rank228
using ll = long long;
using ld = long double; 
const string FILENAME = "input";


const int MAXN = 200229;
const ll LLINF = 3e18;


int N, M;
map<int, vector<pair<int, int> > > edge[MAXN];
int color[MAXN];
int cost[MAXN];
map<int, ll> sum[MAXN];
//you can only save it if its color is unique or its color is twice and you just used one of them & paid.
ll dist[MAXN];
map<int, ll> special[MAXN];
priority_queue<array<ll, 3>, vector<array<ll, 3> >, greater<array<ll, 3> > > pq;
ll ans;


void solve() {
    cin >> N >> M;
    for (int i = 0; i < M; i++) { 
        int u, v, c, d;
        cin >> u >> v >> c >> d; u--; v--;
        edge[u][c].pb({v, i});
        edge[v][c].pb({u, i});
        sum[u][c] += d;
        sum[v][c] += d;
        color[i] = c;
        cost[i] = d;
    }
    for (int u = 0; u < N; u++)
    {
        for (auto &p : edge[u])
        {
            sort(all(p.second), [&](pair<int, int> a, pair<int, int> b)
            {
                return cost[a.second] > cost[b.second];
            });
        }
    }
    fill(dist, dist + N, LLINF);
    dist[0] = 0;
    pq.push({0, 0, -1});
    while(!pq.empty())
    {
        ll d = pq.top()[0]; int u = pq.top()[1], c = pq.top()[2];
        pq.pop();
        if (c != -1)
        {
            if (d != special[u][c]) continue;
            int cl = color[c];
            int it = 0;
            for (auto e : edge[u][cl])
            {
                int v = e.first, eid = e.second; ll dis = cost[eid];
                ll nd = d + min(dis, sum[u][cl] - dis - cost[c]);
                if (dist[v] > nd)
                {
                    dist[v] = nd;
                    pq.push({nd, v, -1});
                }
                it++;
                if (it > 3) break;
            }
        }
        else
        {
            if (d != dist[u]) continue;
            for (auto p : edge[u])
            {
                int cl = p.first;
                for (auto e : p.second)
                {
                    int v = e.first, eid = e.second; ll dis = cost[eid];
                    ll nd = d + min(dis, sum[u][cl] - dis);
                    if (dist[v] > nd)
                    {
                        dist[v] = nd;
                        pq.push({nd, v, -1});
                    }
                    nd = d + dis;
                    if ((special[v].find(eid) == special[v].end() || special[v][eid] > nd))
                    {
                        special[v][eid] = nd;
                        pq.push({nd, v, eid});
                    }
                }
            }
        }
    }
    ans = dist[N - 1];
    if (ans >= LLINF) ans = -1;
    cout << ans << '\n';
}
//21:50

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
   // read(FILENAME);
    int t;
    t = 1;
  //  cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 28492 KB Output is correct
2 Correct 17 ms 28484 KB Output is correct
3 Correct 18 ms 28492 KB Output is correct
4 Correct 17 ms 28540 KB Output is correct
5 Correct 17 ms 28524 KB Output is correct
6 Correct 17 ms 28544 KB Output is correct
7 Correct 20 ms 28708 KB Output is correct
8 Correct 18 ms 28620 KB Output is correct
9 Correct 22 ms 29260 KB Output is correct
10 Correct 24 ms 29176 KB Output is correct
11 Correct 19 ms 29076 KB Output is correct
12 Correct 22 ms 29004 KB Output is correct
13 Correct 21 ms 29012 KB Output is correct
14 Correct 21 ms 29024 KB Output is correct
15 Correct 18 ms 28876 KB Output is correct
16 Correct 21 ms 29004 KB Output is correct
17 Correct 18 ms 29016 KB Output is correct
18 Correct 16 ms 28744 KB Output is correct
19 Correct 20 ms 28928 KB Output is correct
20 Correct 18 ms 28936 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 309 ms 55408 KB Output is correct
2 Correct 181 ms 41296 KB Output is correct
3 Correct 523 ms 62564 KB Output is correct
4 Correct 205 ms 46052 KB Output is correct
5 Correct 1424 ms 110528 KB Output is correct
6 Correct 1392 ms 101036 KB Output is correct
7 Correct 769 ms 85696 KB Output is correct
8 Correct 570 ms 81196 KB Output is correct
9 Correct 635 ms 81016 KB Output is correct
10 Correct 520 ms 68716 KB Output is correct
11 Correct 244 ms 45852 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 28492 KB Output is correct
2 Correct 17 ms 28484 KB Output is correct
3 Correct 18 ms 28492 KB Output is correct
4 Correct 17 ms 28540 KB Output is correct
5 Correct 17 ms 28524 KB Output is correct
6 Correct 17 ms 28544 KB Output is correct
7 Correct 20 ms 28708 KB Output is correct
8 Correct 18 ms 28620 KB Output is correct
9 Correct 22 ms 29260 KB Output is correct
10 Correct 24 ms 29176 KB Output is correct
11 Correct 19 ms 29076 KB Output is correct
12 Correct 22 ms 29004 KB Output is correct
13 Correct 21 ms 29012 KB Output is correct
14 Correct 21 ms 29024 KB Output is correct
15 Correct 18 ms 28876 KB Output is correct
16 Correct 21 ms 29004 KB Output is correct
17 Correct 18 ms 29016 KB Output is correct
18 Correct 16 ms 28744 KB Output is correct
19 Correct 20 ms 28928 KB Output is correct
20 Correct 18 ms 28936 KB Output is correct
21 Correct 309 ms 55408 KB Output is correct
22 Correct 181 ms 41296 KB Output is correct
23 Correct 523 ms 62564 KB Output is correct
24 Correct 205 ms 46052 KB Output is correct
25 Correct 1424 ms 110528 KB Output is correct
26 Correct 1392 ms 101036 KB Output is correct
27 Correct 769 ms 85696 KB Output is correct
28 Correct 570 ms 81196 KB Output is correct
29 Correct 635 ms 81016 KB Output is correct
30 Correct 520 ms 68716 KB Output is correct
31 Correct 244 ms 45852 KB Output is correct
32 Correct 746 ms 67076 KB Output is correct
33 Correct 546 ms 56944 KB Output is correct
34 Correct 729 ms 76984 KB Output is correct
35 Correct 569 ms 65976 KB Output is correct
36 Correct 522 ms 71224 KB Output is correct
37 Correct 803 ms 78472 KB Output is correct
38 Correct 790 ms 85344 KB Output is correct
39 Correct 506 ms 64056 KB Output is correct
40 Correct 596 ms 82396 KB Output is correct
41 Correct 638 ms 82496 KB Output is correct
42 Correct 812 ms 85484 KB Output is correct
43 Correct 350 ms 56044 KB Output is correct
44 Correct 1103 ms 78528 KB Output is correct
45 Correct 484 ms 72416 KB Output is correct
46 Correct 378 ms 70340 KB Output is correct
47 Correct 690 ms 81004 KB Output is correct
48 Correct 1660 ms 114756 KB Output is correct