제출 #1208219

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1208219		Triseedot	Robot (JOI21_ho_t4)	C++20	0 / 100	3095 ms	9488 KiB

Main

// Made by ordinary newbie

#pragma region setup
#include <bits/stdc++.h>
#include <random>
#include <chrono>
using namespace std;

// variables
#define int long long
using ld = long double;
using ll = long long;
using ull = unsigned long long;
template<typename T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;
// bitwise operations
#define cnt_bit(n) __builtin_popcountll(n)
#define low_bit(n) ((n) & (-(n)))
#define bit(n, i) (((n) >> (i)) & 1)
#define set_bit(n, i) ((n) | (1ll << (i)))
#define reset_bit(n, i) ((n) & ~(1ll << (i)))
#define flip_bit(n, i) ((n) ^ (1ll << (i)))
// math
#define sqr(n) ((n) * (n))
int log2_floor(ull n) {
    return n ? __builtin_clzll(1) - __builtin_clzll(n) : -1;
}
const ll INF = 1e18;
// utils
#define len(x) (int) x.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
template <typename T>
istream& operator>>(istream& is, vector<T>& v) {
    for(auto& el : v) {
        is >> el;
    }
    return is;
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < len(v); i++) {
        if (i) os << ' ';
        os << v[i];
    }
    return os;
}
template<class... Args>
auto create(size_t n, Args&&... args) {
    if constexpr(sizeof...(args) == 1) {
        return vector(n, args...);
    }
    else {
        return vector(n, create(args...));
    }
}
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
    size_t operator()(pair<int, int> x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x.first + FIXED_RANDOM) ^ splitmix64(x.second + FIXED_RANDOM);
    }
};
template<typename T, typename U>
bool chmin(T& a, const U b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U>
bool chmax(T& a, const U b) {
    if (b > a) {
        a = b;
        return true;
    }
    return false;
}
template<typename T>
void compress(vector<T>& v) {
    int n = len(v);
    vector<pair<T, int>> u(n);
    for (int i = 0; i < n; i++) {
        u[i] = {v[i], i};
    }
    sort(all(u));
    int curr = 0;
    for (int i = 0; i < n; i++) {
        if (i != 0 && u[i].first != u[i - 1].first) curr++;
        v[u[i].second] = curr;
    }
}
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
#pragma endregion

void solve() {
    int n, m;
    cin >> n >> m;
    vector<vector<tuple<int, int, int>>> g(n);
    for (int i = 0; i < m; i++) {
        int v, u, c, p;
        cin >> v >> u >> c >> p;
        v--, u--, c--;
        g[v].push_back({c, u, p});
        g[u].push_back({c, v, p});
    }

    vector<vector<pair<int, int>>> sm(n);
    for (int v = 0; v < n; v++) {
        sort(all(g[v]));
        int curr = 0;
        for (int i = 0; i <= len(g[v]); i++) {
            if ((i != 0) && (i == len(g[v]) || get<0>(g[v][i]) != get<0>(g[v][i - 1]))) {
                sm[v].push_back({get<0>(g[v][i - 1]), curr});
                curr = 0;
            }
            if (i != len(g[v])) {
                curr += get<2>(g[v][i]);
            }
        }
    }

    priority_queue<pair<int, int>> pq;
    vector<int> dist(n, INF);
    dist[0] = 0;
    pq.push({0, 0});
    while (!pq.empty()) {
        auto [dist_v, v] = pq.top();
        pq.pop();
        if (dist_v != dist[v]) continue;

        for (int i = 0; i < len(g[v]); i++) {
            auto [c, u, p] = g[v][i];
            if (chmin(dist[u], dist[v] + (lower_bound(all(sm[v]), make_pair(c, 0ll))->second - p))) {
                pq.push({dist[u], u});
            }
            if (chmin(dist[u], dist[v] + p)) {
                pq.push({dist[u], u});
            }
            int j = lower_bound(all(g[u]), make_tuple(c, 0ll, 0ll)) - g[u].begin();
            if (j + 1 == len(g[u]) || get<0>(g[u][j + 1]) != c) continue;
            int j1 = j + 1;
            if (j1 + 1 == len(g[u]) || get<0>(g[u][j1 + 1]) != c) {
                if (get<1>(g[u][j]) == v) {
                    swap(j, j1);
                }
                int w = get<1>(g[u][j]);
                if (chmin(dist[w], dist[v] + p)) {
                    pq.push({dist[w], w});
                }
            }
        }
    }

    if (dist[n - 1] == INF) {
        cout << -1 << '\n';
    }
    else {
        cout << dist[n - 1] << '\n';
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int tt = 1;
    //cin >> tt;
    for (int i = 1; i <= tt; i++) {
        solve();
    }
}

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