結果

問題 No.2642 Don't cut line!
ユーザー dyktr_06
提出日時 2024-02-19 22:44:56
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 114 ms / 4,000 ms
コード長 11,208 bytes
コンパイル時間 4,650 ms
コンパイル使用メモリ 269,868 KB
最終ジャッジ日時 2025-02-19 17:25:50
ジャッジサーバーID
(参考情報)
judge2 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 33
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define Sort(a) (sort((a).begin(), (a).end()))
#define RSort(a) (sort((a).rbegin(), (a).rend()))
#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))
typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;
template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }
const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return
    os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v
    .size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " ";
    } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr
    << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os <<
    *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os
    << pq.top() << " "; pq.pop(); } return os; }
template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b;
    cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }
template <typename X>
struct SegTree{
using FX = function<X(X, X)>; // X•X -> X
int n;
FX fx;
const X ex;
vector<X> dat;
SegTree(int n_, const FX &fx_, const X &ex_) : n(), fx(fx_), ex(ex_){
int x = 1;
while(n_ > x){
x *= 2;
}
n = x;
dat.assign(n * 2, ex);
}
X get(int i) const {
return dat[i + n];
}
void set(int i, const X &x){ dat[i + n] = x; }
void build(){
for(int k = n - 1; k >= 1; k--) dat[k] = fx(dat[k * 2], dat[k * 2 + 1]);
}
void update(int i, const X &x){
i += n;
dat[i] = x;
while(i > 0){
i >>= 1; // parent
dat[i] = fx(dat[i * 2], dat[i * 2 + 1]);
}
}
X query(int a, int b){
X vl = ex;
X vr = ex;
int l = a + n;
int r = b + n;
while(l < r){
if(l & 1) vl = fx(vl, dat[l++]);
if(r & 1) vr = fx(dat[--r], vr);
l >>= 1;
r >>= 1;
}
return fx(vl, vr);
}
X operator [](int i) const {
return dat[i + n];
}
};
struct UnionFind{
vector<int> par;
vector<int> edg;
UnionFind(int N) : par(N), edg(N){
for(int i = 0; i < N; ++i){
par[i] = -1;
edg[i] = 0;
}
}
int root(int x){
if(par[x] < 0) return x;
return par[x] = root(par[x]);
}
void unite(int x, int y){
int rx = root(x);
int ry = root(y);
if(rx == ry){
edg[rx]++;
return;
}
par[ry] = par[rx] + par[ry];
par[rx] = ry;
edg[ry] += edg[rx] + 1;
}
bool same(int x, int y){
int rx = root(x);
int ry = root(y);
return rx == ry;
}
long long size(int x){
return -par[root(x)];
}
long long edge(int x){
return edg[root(x)];
}
};
class HeavyLightDecomposition{
protected:
int V;
vector<vector<int>> G;
vector<int> stsize, parent, pathtop, depth, in, reverse_in, out;
int root;
private:
// Subtree Size
void buildStsize(int curr, int prev){
stsize[curr] = 1, parent[curr] = prev;
for(int &v : G[curr]){
if(v == prev){
if(v == G[curr].back()) break;
else swap(v, G[curr].back());
}
buildStsize(v, curr);
stsize[curr] += stsize[v];
if(stsize[v] > stsize[G[curr][0]]){
swap(v, G[curr][0]);
}
}
}
void buildPath(int curr, int prev, int &t){
in[curr] = t++;
reverse_in[in[curr]] = curr;
for(int v : G[curr]){
if(v == prev) continue;
if(v == G[curr][0]){
pathtop[v] = pathtop[curr];
}else{
pathtop[v] = v;
}
depth[v] = depth[curr] + 1;
buildPath(v, curr, t);
}
out[curr] = t;
}
public:
HeavyLightDecomposition(int node_size) : V(node_size), G(V), stsize(V, 0), parent(V, -1),
pathtop(V, -1), depth(V, 0), in(V, -1), reverse_in(V, -1), out(V, -1){}
void add_edge(int u, int v){
G[u].push_back(v);
G[v].push_back(u);
}
void build(int _root = 0){
root = _root;
int t = 0;
buildStsize(root, -1);
pathtop[root] = root;
buildPath(root, -1, t);
}
inline int get(int a){
return in[a];
}
int la(int a, int k) {
while(true){
int u = pathtop[a];
if(in[a] - k >= in[u]) return reverse_in[in[a] - k];
k -= in[a] - in[u] + 1;
a = parent[u];
}
}
int lca(int a, int b){
int pa = pathtop[a], pb = pathtop[b];
while(pathtop[a] != pathtop[b]){
if(in[pa] > in[pb]){
a = parent[pa], pa = pathtop[a];
}else{
b = parent[pb], pb = pathtop[b];
}
}
if(in[a] > in[b]) swap(a, b);
return a;
}
int dist(int a, int b){ return depth[a] + depth[b] - 2 * depth[lca(a, b)]; }
int jump(int from, int to, int k) {
if(!k) return from;
int l = lca(from, to);
int d = dist(from, to);
if(d < k) return -1;
if(depth[from] - depth[l] >= k) return la(from, k);
k -= depth[from] - depth[l];
return la(to, depth[to] - depth[l] - k);
}
void subtree_query(int a, const function<void(int, int)> &func){
func(in[a], out[a]);
}
void path_query(int a, int b, const function<void(int, int)> &func, bool include_root = true, bool reverse_path = false){
vector<pair<int, int>> path;
int pa = pathtop[a], pb = pathtop[b];
while(pathtop[a] != pathtop[b]){
if(in[pa] > in[pb]){
path.emplace_back(in[pa], in[a] + 1);
a = parent[pa], pa = pathtop[a];
}else{
path.emplace_back(in[pb], in[b] + 1);
b = parent[pb], pb = pathtop[b];
}
}
if(in[a] > in[b]) swap(a, b);
if(include_root) path.emplace_back(in[a], in[b] + 1);
else path.emplace_back(in[a] + 1, in[b] + 1);
if(!reverse_path) reverse(path.begin(), path.end());
else for(auto& p : path) p = make_pair(V - p.second, V - p.first);
for(auto [u, v] : path){
func(u, v);
}
}
void path_noncommutative_query(int a, int b, const function<void(int, int)> &func, const function<void(int, int)> &func2){
int l = lca(a, b);
path_query(a, l, func2, false, true);
path_query(l, b, func, true, false);
}
};
ll n, k, c;
vll u, v, w, p;
void input(){
in(n, k, c);
u.resize(k);
v.resize(k);
w.resize(k);
p.resize(k);
rep(i, k){
in(u[i], v[i], w[i], p[i]);
}
}
void solve(){
rep(i, k) u[i]--, v[i]--;
vector<P> e(k);
rep(i, k){
e[i] = {w[i], i};
}
Sort(e);
UnionFind uf(n);
vll a;
ll wsum = 0;
rep(i, k){
auto [weight, idx] = e[i];
if(uf.same(u[idx], v[idx])){
continue;
}
uf.unite(u[idx], v[idx]);
wsum += w[idx];
a.push_back(idx);
}
HeavyLightDecomposition hld(n);
rep(i, n - 1){
hld.add_edge(u[a[i]], v[a[i]]);
}
hld.build();
auto fx = [](ll a, ll b){
return max(a, b);
};
SegTree<ll> seg(n, fx, 0);
rep(i, n - 1){
ll idx = max(hld.get(u[a[i]]), hld.get(v[a[i]]));
seg.update(idx, w[a[i]]);
}
ll mx = 0;
auto query = [&](ll l, ll r){
chmax(mx, seg.query(l, r));
};
ll ans = -1;
rep(i, k){
mx = 0;
hld.path_query(u[i], v[i], query, false, false);
// out(mx);
if(wsum - mx + w[i] <= c){
chmax(ans, p[i]);
}
}
out(ans);
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(20);
input();
solve();
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0