結果

問題 No.2642 Don't cut line!
ユーザー だれだれ
提出日時 2024-02-19 23:08:24
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 294 ms / 4,000 ms
コード長 9,541 bytes
コンパイル時間 4,988 ms
コンパイル使用メモリ 259,696 KB
実行使用メモリ 46,352 KB
最終ジャッジ日時 2024-09-29 03:38:50
合計ジャッジ時間 11,551 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 33
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_set>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
#endif
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i, n) _rep2(i, 0, n)
#define _rep2(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define UNIQUE(x)                      \
    std::sort((x).begin(), (x).end()); \
    (x).erase(std::unique((x).begin(), (x).end()), (x).end())
using i64 = long long;
template <class T, class U>
bool chmin(T& a, const U& b) {
    return (b < a) ? (a = b, true) : false;
}
template <class T, class U>
bool chmax(T& a, const U& b) {
    return (b > a) ? (a = b, true) : false;
}
inline void YesNo(bool f = 0, string yes = "Yes", string no = "No") {
    std::cout << (f ? yes : no) << "\n";
}
namespace io {
template <typename T>
istream& operator>>(istream& i, vector<T>& v) {
    rep(j, v.size()) i >> v[j];
    return i;
}
template <typename T>
string join(vector<T>& v) {
    stringstream s;
    rep(i, v.size()) s << ' ' << v[i];
    return s.str().substr(1);
}
template <typename T>
ostream& operator<<(ostream& o, vector<T>& v) {
    if (v.size()) o << join(v);
    return o;
}
template <typename T>
string join(vector<vector<T>>& vv) {
    string s = "\n";
    rep(i, vv.size()) s += join(vv[i]) + "\n";
    return s;
}
template <typename T>
ostream& operator<<(ostream& o, vector<vector<T>>& vv) {
    if (vv.size()) o << join(vv);
    return o;
}

template <class T, class U>
istream& operator>>(istream& i, pair<T, U>& p) {
    i >> p.first >> p.second;
    return i;
}

template <class T, class U>
ostream& operator<<(ostream& o, pair<T, U>& p) {
    o << p.first << " " << p.second;
    return o;
}

void print() { cout << "\n"; }

template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
    cout << head;
    if (sizeof...(tail)) cout << ' ';
    print(std::forward<Tail>(tail)...);
}

void in() {}

template <class Head, class... Tail>
void in(Head&& head, Tail&&... tail) {
    cin >> head;
    in(std::forward<Tail>(tail)...);
}

}  // namespace io
using namespace io;

namespace useful {
long long modpow(long long a, long long b, long long mod) {
    long long res = 1;
    while (b) {
        if (b & 1) res *= a, res %= mod;
        a *= a;
        a %= mod;
        b >>= 1;
    }
    return res;
}

bool is_pow2(long long x) { return x > 0 && (x & (x - 1)) == 0; }

template <class T>
void rearrange(vector<T>& a, vector<int>& p) {
    vector<T> b = a;
    for (int i = 0; i < int(a.size()); i++) {
        a[i] = b[p[i]];
    }
    return;
}

template <class T>
vector<pair<int, int>> rle_sequence(T& a) {
    vector<pair<int, int>> res;
    int n = a.size();
    if (n == 1) return vector<pair<int, int>>{{a[0], 1}};
    int l = 1;
    rep(i, n - 1) {
        if (a[i] == a[i + 1])
            l++;
        else {
            res.emplace_back(a[i], l);
            l = 1;
        }
    }
    res.emplace_back(a.back(), l);
    return res;
}

vector<pair<char, int>> rle_string(string a) {
    vector<pair<char, int>> res;
    int n = a.size();
    if (n == 1) return vector<pair<char, int>>{{a[0], 1}};
    int l = 1;
    rep(i, n - 1) {
        if (a[i] == a[i + 1])
            l++;
        else {
            res.emplace_back(a[i], l);
            l = 1;
        }
    }
    res.emplace_back(a.back(), l);
    return res;
}

vector<int> linear_sieve(int n) {
    vector<int> primes;
    vector<int> res(n + 1);
    iota(all(res), 0);
    for (int i = 2; i <= n; i++) {
        if (res[i] == i) primes.emplace_back(i);
        for (auto j : primes) {
            if (j * i > n) break;
            res[j * i] = j;
        }
    }
    return res;
    // return primes;
}

template <class T>
vector<long long> dijkstra(vector<vector<pair<int, T>>>& graph, int start) {
    int n = graph.size();
    vector<long long> res(n, 2e18);
    res[start] = 0;
    priority_queue<pair<long long, int>, vector<pair<long long, int>>,
                   greater<pair<long long, int>>>
        que;
    que.push({0, start});
    while (!que.empty()) {
        auto [c, v] = que.top();
        que.pop();
        if (res[v] < c) continue;
        for (auto [nxt, cost] : graph[v]) {
            auto x = c + cost;
            if (x < res[nxt]) {
                res[nxt] = x;
                que.push({x, nxt});
            }
        }
    }
    return res;
}

}  // namespace useful
using namespace useful;

struct HLD {
    int n;
    vector<vector<int>> g;
    vector<int> sz;
    vector<int> head;
    vector<int> in;
    vector<int> rev;
    vector<int> out;
    vector<int> par;
    HLD(vector<vector<int>> edge) : n(edge.size()), g(edge) {
        sz = vector<int>(n);
        head = vector<int>(n);
        in = vector<int>(n);
        rev = vector<int>(n);
        par = vector<int>(n);
        out = vector<int>(n);
    }
    void dfs_sz(int v, int p) {
        if (g[v].size() && g[v][0] == p) swap(g[v][0], g[v].back());
        sz[v] = 1;
        for (auto& u : g[v]) {
            if (u == p) continue;
            dfs_sz(u, v);
            sz[v] += sz[u];
            if (sz[u] > sz[g[v][0]]) swap(u, g[v][0]);
        }
    }
    void dfs_hld(int v, int p, int& t) {
        in[v] = t++;
        rev[in[v]] = v;
        par[v] = p;
        for (auto u : g[v]) {
            if (u == p) continue;
            head[u] = (u == g[v][0] ? head[v] : u);
            dfs_hld(u, v, t);
        }
        out[v] = t;
    }

    void build() {
        dfs_sz(0, -1);
        int t = 0;
        dfs_hld(0, -1, t);
    }

    int lca(int u, int v) {
        while (true) {
            if (in[u] > in[v]) swap(u, v);
            if (head[u] == head[v]) return u;
            v = par[head[v]];
        }
    }

    vector<int> renum() { return in; }

    pair<vector<pair<int, int>>, vector<pair<int, int>>> query(int u, int v,
                                                               bool f = false) {
        // 返り値は閉区間, 辺属性未verify, 非可換対応
        vector<pair<int, int>> l, r;
        while (true) {
            if (head[u] == head[v]) break;
            if (in[u] > in[v]) {
                l.emplace_back(in[head[u]], in[u]);
                u = par[head[u]];
            } else {
                r.emplace_back(in[head[v]], in[v]);
                v = par[head[v]];
            }
        }
        if (in[u] > in[v]) {
            l.emplace_back(in[v] + f, in[u]);
        } else {
            r.emplace_back(in[u] + f, in[v]);
        }
        reverse(all(r));
        return {l, r};
    }

    pair<int, int> subtree(int u) { return {in[u], out[u]}; }
};

template <class T, T op(T, T)>
struct SparseTable {
    int n;
    int log;
    std::vector<std::vector<T>> table;
    std::vector<int> bitlength;
    SparseTable(std::vector<T>& v) : n(v.size()) {
        bitlength = std::vector<int>(n + 1);
        for (int i = 2; i <= n; i++) {
            bitlength[i] = bitlength[i >> 1] + 1;
        }
        log = bitlength.back();
        table = std::vector(log + 1, std::vector<T>(n));
        for (int i = 0; i < n; i++) table[0][i] = v[i];
        for (int j = 0; j < log; j++) {
            for (int i = 0; i < n; i++) {
                table[j + 1][i] =
                    op(table[j][i], table[j][min(n - 1, i + (1 << j))]);
            }
        }
    }

    T query(int l, int r) {  // query [l, r)
        assert(0 <= l && l <= r && r <= n);
        int len = r - l;
        return op(table[bitlength[len]][l],
                  table[bitlength[len]][r - (1 << bitlength[len])]);
    }
};

i64 op(i64 a, i64 b) { return max(a, b); }

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    i64 n, m, c;
    in(n, m, c);
    vector<array<i64, 4>> edge(m);
    rep(i, m) {
        i64 u, v, w, p;
        in(u, v, w, p);
        u--, v--;
        edge[i][0] = u;
        edge[i][1] = v;
        edge[i][2] = w;
        edge[i][3] = p;
    }
    sort(all(edge), [&](auto a, auto b) { return a[2] < b[2]; });
    atcoder::dsu uf(n);
    vector<vector<int>> tree(n);
    i64 icost = 0;
    i64 ans = 0;
    set<pair<int, int>> S;
    for (auto& [u, v, w, p] : edge) {
        if (uf.same(u, v)) continue;
        tree[u].emplace_back(v);
        tree[v].emplace_back(u);
        S.emplace(u, v);
        uf.merge(u, v);
        icost += w;
        chmax(ans, p);
    }
    if (icost > c) {
        print(-1);
        return 0;
    }
    HLD hld(tree);
    hld.build();
    auto re = hld.renum();
    auto par = hld.par;
    vector<i64> table(n);
    for (auto& [u, v, w, p] : edge) {
        if (!S.count(make_pair(u, v))) continue;
        if (par[u] == v)
            table[re[u]] = w;
        else
            table[re[v]] = w;
    }
    SparseTable<i64, op> ST(table);
    for (auto& [u, v, w, p] : edge) {
        if (S.count(make_pair(u, v))) continue;
        auto&& [L, R] = hld.query(u, v);
        i64 tm = 0;
        for (auto [l, r] : L) chmax(tm, ST.query(l, r + 1));
        for (auto [l, r] : R) chmax(tm, ST.query(l, r + 1));
        if (icost - tm + w <= c) chmax(ans, p);
    }
    print(ans);
}
0