제출 #967435

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
967435		angella	Robot (JOI21_ho_t4)	C++17	100 / 100	361 ms	49912 KiB

Main

/*
    IN THE NAME OF GOD
*/
#include <bits/stdc++.h>

// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef long double ld;

#define F                                      first
#define S                                      second
#define Mp                                     make_pair
#define pb                                     push_back
#define pf                                     push_front
#define size(x)                                ((ll)x.size())
#define all(x)                                 (x).begin(),(x).end()
#define kill(x)		                           cout << x << '\n', exit(0);
#define fuck(x)                                cout << "(" << #x << " , " << x << ")" << endl
#define endl                                   '\n'

const int N = 3e5+23, lg = 18;
ll Mod = 1e9+7; //998244353;

inline ll MOD(ll a, ll mod=Mod) {a%=mod; (a<0)&&(a+=mod); return a;}
inline ll poww(ll a, ll b, ll mod=Mod) {
    ll ans = 1;
    a=MOD(a, mod);
    while (b) {
        if (b & 1) ans = MOD(ans*a, mod);
        b >>= 1;
        a = MOD(a*a, mod);
    }
    return ans;
}

ll n, m, vis[N], d[N];
vector<vector<ll>> adj[N];
int main () {
	ios_base::sync_with_stdio(false), cin.tie(0);

	cin>>n>>m;
    for(ll v,u,c,p,i=1; i<=m; i++) {
        cin>>v>>u>>c>>p;
        adj[v].pb({u, c, p});
        adj[u].pb({v, c, p});
    }
    priority_queue<pll, vector<pll>, greater<pll>> pq;
    pq.push({0, 1});
    while(size(pq) > 0) {
        pll v = pq.top(); pq.pop();
        if(vis[v.S] == 1) continue;
        vis[v.S]=1, d[v.S] = v.F;
        map<int,ll> mp, mp2;
        for(auto it : adj[v.S]) {
            mp[it[1]] += it[2];
            if(vis[it[0]] == 1) {
                if(mp2.find(it[1]) == mp2.end()) mp2[it[1]]=d[it[0]];
                else mp2[it[1]]=min(mp2[it[1]], d[it[0]]);
            }
        }
        for(auto it : adj[v.S]) {
            if(vis[it[0]]==0) {
                pq.push({v.F+min(it[2],mp[it[1]]-it[2]), it[0]});
                if(mp2.find(it[1]) != mp2.end()) {
                    pq.push({mp2[it[1]]+mp[it[1]]-it[2], it[0]});
                }
            }
        }
    }

    cout<<(vis[n]==0 ? -1 : d[n])<<endl;

	return 0;
}

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