Submission #1278286

#	Time	Username	Problem	Language	Result	Execution time	Memory
1278286		wonderful	Robot (JOI21_ho_t4)	C++20	100 / 100	186 ms	15236 KiB

Main

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()

ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(abs(a), abs(b));}
ll lcm(ll a, ll b){return abs(a) / gcd(a, b) * abs(b);}

ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ull mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}

mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}

template <class T1, class T2>
bool maximize(T1 &a, T2 b){
    if (a < b) {a = b; return true;}
    return false;
}

template <class T1, class T2>
bool minimize(T1 &a, T2 b){
    if (a > b) {a = b; return true;}
    return false;
}

template <class T>
void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
    for(auto item: container) out << item << separator;
    out << finish;
}

template <class T>
void remove_dup(vector<T> &a){
    sort(ALL(a));
    a.resize(unique(ALL(a)) - a.begin());
}


struct node {
    int x, c, val;
};

const ll INF = 1e16;
int n, m;
vector<node> adj[1000005];
ll dista[1000005];
ll col[1000005];
ll mincol[1000005];

void dijkstra(){
    for (int i = 1; i <= n; i++) dista[i] = INF;
    priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<>> pq;
    pq.push({0, 1});
    dista[1] = 0;

    while (!pq.empty()){
        auto [val, u] = pq.top(); pq.pop();
        if (val > dista[u]) continue;

        for (auto e : adj[u]){
            col[e.c] += e.val;
            mincol[e.c] = min(mincol[e.c], dista[e.x]);
        }

        for (auto e : adj[u]){
            ll d = min(dista[u] + min(e.val, col[e.c] - e.val), mincol[e.c] + col[e.c] - e.val);
            if (dista[e.x] > d){
                dista[e.x] = d;
                pq.push({dista[e.x], e.x});
            }
        }

        for (auto e : adj[u]){
            col[e.c] = 0;
            mincol[e.c] = INF;
        }
    }
}

void solve(){
    cin >> n >> m;
    for (int i = 1; i <= m; i++){
        int x, y, c, t;
        cin >> x >> y >> c >> t;
        adj[x].push_back({y, c, t});
        adj[y].push_back({x, c, t});
        col[i] = 0;
        mincol[i] = INF;
    }
    dijkstra();
    if (dista[n] != INF) cout << dista[n] << "\n";
    else cout << -1 << "\n";
}

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

    clock_t start = clock();
    solve();
    cerr << "Time elapsed: " << clock() - start << "ms!\n";
    return 0;
}

• Subtask 1: 34 / 34
• Subtask 2: 24 / 24
• Subtask 3: 42 / 42