Submission #634573

#	Time	Username	Problem	Language	Result	Execution time	Memory
634573		urosk	Robot (JOI21_ho_t4)	C++14	0 / 100	389 ms	42020 KiB

Main

#define here cerr<<"===========================================\n"
#define dbg(x) cerr<<#x<<": "<<x<<endl;
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define ld double
#define ll long long
#define llinf 100000000000000000LL // 10^17
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define sz(a) (ll)(a.size())
#define all(a) a.begin(),a.end()
#define ceri(a,l,r) {cerr<<#a<<": ";for(ll i_ = l;i_<=r;i_++) cerr<<a[i_]<< " ";cerr<<endl;}
#define daj_mi_malo_vremena ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);

using namespace std;
using namespace __gnu_pbds;
/*
ll add(ll x,ll y){
    x+=y;
    if(x<0){
        x%=mod;
        x+=mod;
    }else{
        if(x>=mod) x%=mod;
    }
    return x;
}
ll mul(ll a,ll b){
	ll ans = (a*b)%mod;
	if(ans<0) ans+=mod;
	return ans;
}
typedef tree<int,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef tree<int,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_multiset;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll rnd(ll l,ll r){
    return uniform_int_distribution<ll>(l,r)(rng);
}
*/
#define maxn 100005
ll n,m;
vector<array<ll,3> > g[maxn];
map<ll,ll> v[maxn];
ll d[maxn];
bool vis[maxn];
int main(){
	daj_mi_malo_vremena
    cin >> n >> m;
    for(ll i = 1;i<=m;i++){
        ll x,y,c,p;
        cin >> x >> y >> c >> p;
        v[x][c]+=p; v[y][c]+=p;
        g[x].pb({y,c,p});
        g[y].pb({x,c,p});
    }
    fill(d,d+maxn,llinf);
    d[1] = 0;
    priority_queue<pll> pq; pq.push({0,1});
    while(sz(pq)){
        ll u = pq.top().sc; pq.pop();
        if(vis[u]) continue;
        vis[u] = 1;
        for(array<ll,3> a : g[u]){
            ll s = a[0]; ll c = a[1]; ll p = a[2];
            if(vis[s]) continue;
            ll w = min(p,v[u][c]-p);
            if(d[u]+w<d[s]){
                d[s] = d[u] + w;
                pq.push({-d[s],s});
            }
        }
    }
    ll ans = d[n];
    if(ans==llinf) ans = -1;
    cout<<ans<<endl;
	return 0;
}

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