oj.uz

Submission #759257

# Submission time Handle Problem Language Result Execution time Memory
759257 2023-06-16T01:19:45 Z GrindMachine Robot (JOI21_ho_t4) C++17
100 / 100
 1638 ms 156540 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
https://usaco.guide/problems/joi-2021robot/solution

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

vector<array<ll,4>> adj1[N];
map<ll,vector<array<ll,3>>> adj2[N];
map<ll,ll> adj_sum[N];

void solve(int test_case)
{
    ll n,m; cin >> n >> m;
    vector<array<ll,4>> edges(m+5);

    rep1(i,m){
        ll u,v,c,w; cin >> u >> v >> c >> w;
        edges[i] = {u,v,c,w};
        adj1[u].pb({v,c,w,i});
        adj1[v].pb({u,c,w,i});
        adj2[u][c].pb({v,w,i});
        adj2[v][c].pb({u,w,i});
        adj_sum[u][c] += w;
        adj_sum[v][c] += w;
    }

    priority_queue<array<ll,3>,vector<array<ll,3>>,greater<array<ll,3>>> pq;
    pq.push({0,1,-1});
    set<pll> st;

    while(!pq.empty()){
        auto [cost,u,prevc] = pq.top();
        pq.pop();

        pll px = {u,prevc};
        if(st.count(px)) conts;
        st.insert(px);

        if(u == n and prevc == -1){
            cout << cost << endl;
            return;
        }

        if(prevc == -1){
            for(auto [v,c,w,id] : adj1[u]){
                // recolor edge and put ?

                // next edge is ?
                pq.push({cost+w,v,-1});

                // next edge is not '?' and has col c
                pq.push({cost,v,c});

                // retain color
                ll add = adj_sum[u][c];
                add -= w;
                pq.push({cost+add,v,-1});
            }
        }
        else{
            ll c = prevc;
            for(auto [v,w,id] : adj2[u][c]){
                // recolor all adj guys
                ll add = adj_sum[u][c];
                add -= w;
                pq.push({cost+add,v,-1});
            }
        }
    }

    cout << -1 << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11988 KB Output is correct
2 Correct 6 ms 12048 KB Output is correct
3 Correct 5 ms 12000 KB Output is correct
4 Correct 5 ms 12056 KB Output is correct
5 Correct 6 ms 12048 KB Output is correct
6 Correct 8 ms 12104 KB Output is correct
7 Correct 7 ms 12500 KB Output is correct
8 Correct 6 ms 12244 KB Output is correct
9 Correct 11 ms 13140 KB Output is correct
10 Correct 11 ms 13096 KB Output is correct
11 Correct 10 ms 13140 KB Output is correct
12 Correct 11 ms 12848 KB Output is correct
13 Correct 9 ms 13044 KB Output is correct
14 Correct 9 ms 13112 KB Output is correct
15 Correct 8 ms 12500 KB Output is correct
16 Correct 9 ms 12716 KB Output is correct
17 Correct 9 ms 12844 KB Output is correct
18 Correct 9 ms 12204 KB Output is correct
19 Correct 10 ms 12908 KB Output is correct
20 Correct 9 ms 12628 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 365 ms 52348 KB Output is correct
2 Correct 137 ms 30308 KB Output is correct
3 Correct 177 ms 54336 KB Output is correct
4 Correct 180 ms 37240 KB Output is correct
5 Correct 1338 ms 129272 KB Output is correct
6 Correct 1235 ms 119344 KB Output is correct
7 Correct 690 ms 98952 KB Output is correct
8 Correct 845 ms 82164 KB Output is correct
9 Correct 963 ms 82212 KB Output is correct
10 Correct 583 ms 71568 KB Output is correct
11 Correct 137 ms 42932 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11988 KB Output is correct
2 Correct 6 ms 12048 KB Output is correct
3 Correct 5 ms 12000 KB Output is correct
4 Correct 5 ms 12056 KB Output is correct
5 Correct 6 ms 12048 KB Output is correct
6 Correct 8 ms 12104 KB Output is correct
7 Correct 7 ms 12500 KB Output is correct
8 Correct 6 ms 12244 KB Output is correct
9 Correct 11 ms 13140 KB Output is correct
10 Correct 11 ms 13096 KB Output is correct
11 Correct 10 ms 13140 KB Output is correct
12 Correct 11 ms 12848 KB Output is correct
13 Correct 9 ms 13044 KB Output is correct
14 Correct 9 ms 13112 KB Output is correct
15 Correct 8 ms 12500 KB Output is correct
16 Correct 9 ms 12716 KB Output is correct
17 Correct 9 ms 12844 KB Output is correct
18 Correct 9 ms 12204 KB Output is correct
19 Correct 10 ms 12908 KB Output is correct
20 Correct 9 ms 12628 KB Output is correct
21 Correct 365 ms 52348 KB Output is correct
22 Correct 137 ms 30308 KB Output is correct
23 Correct 177 ms 54336 KB Output is correct
24 Correct 180 ms 37240 KB Output is correct
25 Correct 1338 ms 129272 KB Output is correct
26 Correct 1235 ms 119344 KB Output is correct
27 Correct 690 ms 98952 KB Output is correct
28 Correct 845 ms 82164 KB Output is correct
29 Correct 963 ms 82212 KB Output is correct
30 Correct 583 ms 71568 KB Output is correct
31 Correct 137 ms 42932 KB Output is correct
32 Correct 239 ms 71692 KB Output is correct
33 Correct 253 ms 66428 KB Output is correct
34 Correct 407 ms 76396 KB Output is correct
35 Correct 344 ms 64196 KB Output is correct
36 Correct 596 ms 89560 KB Output is correct
37 Correct 781 ms 93088 KB Output is correct
38 Correct 604 ms 98644 KB Output is correct
39 Correct 397 ms 81540 KB Output is correct
40 Correct 922 ms 83576 KB Output is correct
41 Correct 1206 ms 83836 KB Output is correct
42 Correct 1188 ms 96744 KB Output is correct
43 Correct 469 ms 59864 KB Output is correct
44 Correct 348 ms 80024 KB Output is correct
45 Correct 749 ms 71772 KB Output is correct
46 Correct 537 ms 70348 KB Output is correct
47 Correct 818 ms 91256 KB Output is correct
48 Correct 1638 ms 156540 KB Output is correct