제출 #706171

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
706171		becaido	Robot (JOI21_ho_t4)	C++17	24 / 100	921 ms	115904 KiB

Main

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#include <bits/stdc++.h>
using namespace std;

#ifdef WAIMAI
#define debug(HEHE...) cout << "[" << #HEHE << "] : ", dout(HEHE)
void dout() {cout << '\n';}
template<typename T, typename...U>
void dout(T t, U...u) {cout << t << (sizeof...(u) ? ", " : ""), dout(u...);}
#else
#define debug(...) 7122
#endif

#define ll long long
#define Waimai ios::sync_with_stdio(false), cin.tie(0)
#define FOR(x,a,b) for (int x = a, I = b; x <= I; x++)
#define pb emplace_back
#define F first
#define S second

const ll INF = 1e18;
const int SIZE = 1e5 + 5;

int n, m;
unordered_map<int, vector<pair<int, int>>> adj[SIZE];
unordered_map<int, ll> sum[SIZE];
unordered_set<int> us[SIZE];
ll dis[SIZE];
priority_queue<tuple<ll, int, int, int>, vector<tuple<ll, int, int, int>>, greater<tuple<ll, int, int, int>>> pq;

void solve() {
    cin >> n >> m;
    while (m--) {
        int a, b, c, w;
        cin >> a >> b >> c >> w;
        adj[a][c].pb(b, w);
        adj[b][c].pb(a, w);
    }
    FOR (i, 1, n) {
        for (auto [c, v] : adj[i]) for (auto [np, w] : v) sum[i][c] += w;
        dis[i] = INF;
    }
    pq.emplace(0, 1, 0, 0);
    while (pq.size()) {
        auto [d, pos, color, val] = pq.top();
        pq.pop();
        if (us[pos].count(color)) continue;
        dis[pos] = min(dis[pos], d);

        if (!us[pos].count(0)) {
            for (auto [c, v] : adj[pos]) {
                if (v.size() == 1) pq.emplace(d, v[0].F, 0, 0);
                else {
                    ll tot = sum[pos][c];
                    for (auto [np, w] : v) {
                        pq.emplace(d + w, np, c, w);
                        pq.emplace(d + tot - w, np, 0, 0);
                    }
                }
            }
        }
        if (color) {
            ll tot = sum[pos][color];
            for (auto [np, w] : adj[pos][color]) {
                pq.emplace(d + tot - w - val, np, 0, 0);
                pq.emplace(d + w, np, color, w);
            }
        }
        us[pos].insert(color);
        us[pos].insert(0);
    }
    cout << (dis[n] == INF ? -1 : dis[n]) << '\n';
}

int main() {
    Waimai;
    solve();
}

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