結果
問題 | No.2642 Don't cut line! |
ユーザー |
👑 ![]() |
提出日時 | 2024-02-19 23:07:41 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 77 ms / 4,000 ms |
コード長 | 22,169 bytes |
コンパイル時間 | 1,923 ms |
コンパイル使用メモリ | 137,404 KB |
最終ジャッジ日時 | 2025-02-19 17:35:39 |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 33 |
ソースコード
#ifdef NACHIA#define _GLIBCXX_DEBUG#else#define NDEBUG#endif#include <iostream>#include <string>#include <vector>#include <algorithm>#include <utility>#include <queue>#include <array>#include <cmath>#include <atcoder/modint>using i64 = long long;using u64 = unsigned long long;#define rep(i,n) for(i64 i=0; i<(i64)(n); i++)#define repr(i,n) for(i64 i=(i64)(n)-1; i>=0; i--)const i64 INF = 1001001001001001001;const char* yn(bool x){ return x ? "Yes" : "No"; }template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }template<typename A> using nega_queue = std::priority_queue<A,std::vector<A>,std::greater<A>>;using Modint = atcoder::static_modint<998244353>;#include <iterator>#include <functional>template<class Elem> struct vec;template<class Iter>struct seq_view{using Ref = typename std::iterator_traits<Iter>::reference;using Elem = typename std::iterator_traits<Iter>::value_type;Iter a, b;Iter begin() const { return a; }Iter end() const { return b; }int size() const { return (int)(b-a); }seq_view(Iter first, Iter last) : a(first), b(last) {}seq_view sort() const { std::sort(a, b); return *this; }Ref& operator[](int x){ return *(a+x); }template<class F = std::less<Elem>, class ret = vec<int>> ret sorti(F f = F()) const {ret x(size()); for(int i=0; i<size(); i++) x[i] = i;x().sort([&](int l, int r){ return f(a[l],a[r]); });return x;}template<class ret = vec<Elem>> ret col() const { return ret(begin(), end()); }template<class F = std::equal_to<Elem>, class ret = vec<std::pair<Elem, int>>>ret rle(F eq = F()) const {auto x = ret();for(auto& a : (*this)){if(x.size() == 0 || !eq(x[x.size()-1].first, a)) x.emp(a, 1); else x[x.size()-1].second++;} return x;}template<class F> seq_view sort(F f) const { std::sort(a, b, f); return *this; }Iter uni() const { return std::unique(a, b); }Iter lb(const Elem& x) const { return std::lower_bound(a, b, x); }Iter ub(const Elem& x) const { return std::upper_bound(a, b, x); }int lbi(const Elem& x) const { return lb(x) - a; }int ubi(const Elem& x) const { return ub(x) - a; }seq_view bound(const Elem& l, const Elem& r) const { return { lb(l), lb(r) }; }template<class F> Iter lb(const Elem& x, F f) const { return std::lower_bound(a, b, x, f); }template<class F> Iter ub(const Elem& x, F f) const { return std::upper_bound(a, b, x, f); }template<class F> Iter when_true_to_false(F f) const {if(a == b) return a;return std::lower_bound(a, b, *a,[&](const Elem& x, const Elem&){ return f(x); });}seq_view same(Elem x) const { return { lb(x), ub(x) }; }template<class F> auto map(F f) const {vec<typename Iter::value_type> r;for(auto& x : *this) r.emp(f(x));return r;}Iter max() const { return std::max_element(a, b); }Iter min() const { return std::min_element(a, b); }template<class F = std::less<Elem>>Iter min(F f) const { return std::min_element(a, b, f); }seq_view rev() const { std::reverse(a, b); return *this; }};template<class Elem>struct vec {using Base = typename std::vector<Elem>;using Iter = typename Base::iterator;using CIter = typename Base::const_iterator;using View = seq_view<Iter>;using CView = seq_view<CIter>;vec(){}explicit vec(int n, const Elem& value = Elem()) : a(0<n?n:0, value) {}template <class I2> vec(I2 first, I2 last) : a(first, last) {}vec(std::initializer_list<Elem> il) : a(std::move(il)) {}vec(Base b) : a(std::move(b)) {}operator Base() const { return a; }Iter begin(){ return a.begin(); }CIter begin() const { return a.begin(); }Iter end(){ return a.end(); }CIter end() const { return a.end(); }int size() const { return a.size(); }bool empty() const { return a.empty(); }Elem& back(){ return a.back(); }const Elem& back() const { return a.back(); }vec sortunied(){ vec x = *this; x().sort(); x.a.erase(x().uni(), x.end()); return x; }Iter operator()(int x){ return a.begin() + x; }CIter operator()(int x) const { return a.begin() + x; }View operator()(int l, int r){ return { (*this)(l), (*this)(r) }; }CView operator()(int l, int r) const { return { (*this)(l), (*this)(r) }; }View operator()(){ return (*this)(0,size()); }CView operator()() const { return (*this)(0,size()); }Elem& operator[](int x){ return a[x]; }const Elem& operator[](int x) const { return a[x]; }Base& operator*(){ return a; }const Base& operator*() const { return a; }vec& push(Elem args){a.push_back(std::move(args));return *this;}template<class... Args>vec& emp(Args &&... args){a.emplace_back(std::forward<Args>(args) ...);return *this;}template<class Range>vec& app(Range& x){ for(auto& v : a) emp(v); }Elem pop(){Elem x = std::move(a.back());a.pop_back(); return x;}bool operator==(const vec& r) const { return a == r.a; }bool operator!=(const vec& r) const { return a != r.a; }bool operator<(const vec& r) const { return a < r.a; }bool operator<=(const vec& r) const { return a <= r.a; }bool operator>(const vec& r) const { return a > r.a; }bool operator>=(const vec& r) const { return a >= r.a; }vec<vec<Elem>> pile(int n) const { return vec<vec<Elem>>(n, *this); }template<class F> vec& filter(F f){int p = 0;for(int q=0; q<size(); q++) if(f(a[q])) std::swap(a[p++],a[q]);a.resize(p); return *this;}private: Base a;};template<class IStr, class U, class T>IStr& operator>>(IStr& is, vec<std::pair<U,T>>& v){ for(auto& x:v){ is >> x.first >> x.second; } return is; }template<class IStr, class T>IStr& operator>>(IStr& is, vec<T>& v){ for(auto& x:v){ is >> x; } return is; }template<class OStr, class T>OStr& operator<<(OStr& os, const vec<T>& v){for(int i=0; i<v.size(); i++){if(i){ os << ' '; } os << v[i];} return os;}template<class OStr, class U, class T>OStr& operator<<(OStr& os, const vec<std::pair<U,T>>& v){for(int i=0; i<v.size(); i++){if(i){ os << ' '; } os << '(' << v[i].first << ',' << v[i].second << ')';} return os;}#include <atcoder/dsu>#include <cassert>namespace nachia{template<class Elem>class CsrArray{public:struct ListRange{using iterator = typename std::vector<Elem>::iterator;iterator begi, endi;iterator begin() const { return begi; }iterator end() const { return endi; }int size() const { return (int)std::distance(begi, endi); }Elem& operator[](int i) const { return begi[i]; }};struct ConstListRange{using iterator = typename std::vector<Elem>::const_iterator;iterator begi, endi;iterator begin() const { return begi; }iterator end() const { return endi; }int size() const { return (int)std::distance(begi, endi); }const Elem& operator[](int i) const { return begi[i]; }};private:int m_n;std::vector<Elem> m_list;std::vector<int> m_pos;public:CsrArray() : m_n(0), m_list(), m_pos() {}static CsrArray Construct(int n, std::vector<std::pair<int, Elem>> items){CsrArray res;res.m_n = n;std::vector<int> buf(n+1, 0);for(auto& [u,v] : items){ ++buf[u]; }for(int i=1; i<=n; i++) buf[i] += buf[i-1];res.m_list.resize(buf[n]);for(int i=(int)items.size()-1; i>=0; i--){res.m_list[--buf[items[i].first]] = std::move(items[i].second);}res.m_pos = std::move(buf);return res;}static CsrArray FromRaw(std::vector<Elem> list, std::vector<int> pos){CsrArray res;res.m_n = pos.size() - 1;res.m_list = std::move(list);res.m_pos = std::move(pos);return res;}ListRange operator[](int u) { return ListRange{ m_list.begin() + m_pos[u], m_list.begin() + m_pos[u+1] }; }ConstListRange operator[](int u) const { return ConstListRange{ m_list.begin() + m_pos[u], m_list.begin() + m_pos[u+1] }; }int size() const { return m_n; }int fullSize() const { return (int)m_list.size(); }};} // namespace nachianamespace nachia{struct Graph {public:struct Edge{int from, to;void reverse(){ std::swap(from, to); }int xorval() const { return from ^ to; }};Graph(int n = 0, bool undirected = false, int m = 0) : m_n(n), m_e(m), m_isUndir(undirected) {}Graph(int n, const std::vector<std::pair<int, int>>& edges, bool undirected = false) : m_n(n), m_isUndir(undirected){m_e.resize(edges.size());for(std::size_t i=0; i<edges.size(); i++) m_e[i] = { edges[i].first, edges[i].second };}template<class Cin>static Graph Input(Cin& cin, int n, bool undirected, int m, bool offset = 0){Graph res(n, undirected, m);for(int i=0; i<m; i++){int u, v; cin >> u >> v;res[i].from = u - offset;res[i].to = v - offset;}return res;}int numVertices() const noexcept { return m_n; }int numEdges() const noexcept { return int(m_e.size()); }int addNode() noexcept { return m_n++; }int addEdge(int from, int to){ m_e.push_back({ from, to }); return numEdges() - 1; }Edge& operator[](int ei) noexcept { return m_e[ei]; }const Edge& operator[](int ei) const noexcept { return m_e[ei]; }Edge& at(int ei) { return m_e.at(ei); }const Edge& at(int ei) const { return m_e.at(ei); }auto begin(){ return m_e.begin(); }auto end(){ return m_e.end(); }auto begin() const { return m_e.begin(); }auto end() const { return m_e.end(); }bool isUndirected() const noexcept { return m_isUndir; }void reverseEdges() noexcept { for(auto& e : m_e) e.reverse(); }void contract(int newV, const std::vector<int>& mapping){assert(numVertices() == int(mapping.size()));for(int i=0; i<numVertices(); i++) assert(0 <= mapping[i] && mapping[i] < newV);for(auto& e : m_e){ e.from = mapping[e.from]; e.to = mapping[e.to]; }m_n = newV;}std::vector<Graph> induce(int num, const std::vector<int>& mapping) const {int n = numVertices();assert(n == int(mapping.size()));for(int i=0; i<n; i++) assert(-1 <= mapping[i] && mapping[i] < num);std::vector<int> indexV(n), newV(num);for(int i=0; i<n; i++) if(mapping[i] >= 0) indexV[i] = newV[mapping[i]]++;std::vector<Graph> res; res.reserve(num);for(int i=0; i<num; i++) res.emplace_back(newV[i], isUndirected());for(auto e : m_e) if(mapping[e.from] == mapping[e.to] && mapping[e.to] >= 0) res[mapping[e.to]].addEdge(indexV[e.from], indexV[e.to]);return res;}CsrArray<int> getEdgeIndexArray(bool undirected) const {std::vector<std::pair<int, int>> src;src.reserve(numEdges() * (undirected ? 2 : 1));for(int i=0; i<numEdges(); i++){auto e = operator[](i);src.emplace_back(e.from, i);if(undirected) src.emplace_back(e.to, i);}return CsrArray<int>::Construct(numVertices(), src);}CsrArray<int> getEdgeIndexArray() const { return getEdgeIndexArray(isUndirected()); }CsrArray<int> getAdjacencyArray(bool undirected) const {std::vector<std::pair<int, int>> src;src.reserve(numEdges() * (undirected ? 2 : 1));for(auto e : m_e){src.emplace_back(e.from, e.to);if(undirected) src.emplace_back(e.to, e.from);}return CsrArray<int>::Construct(numVertices(), src);}CsrArray<int> getAdjacencyArray() const { return getAdjacencyArray(isUndirected()); }private:int m_n;std::vector<Edge> m_e;bool m_isUndir;};} // namespace nachianamespace nachia {struct DsuFast{private:std::vector<int> w;public:DsuFast(int n = 0) : w(n, -1) {}int leader(int u){if(w[u] < 0) return u;return w[u] = leader(w[u]);}int operator[](int u){ return leader(u); }int merge(int u, int v){u = leader(u);v = leader(v);if(u == v) return u;if(-w[u] < -w[v]) std::swap(u, v);w[u] += w[v];w[v] = u;return u;}int size(int u){ return -w[leader(u)]; }bool same(int u, int v){ return leader(u) == leader(v); }};} // namespace nachianamespace nachia{std::vector<int> MinimumSpanningForestKnownPriority(const nachia::Graph& graph,const std::vector<int>& edgePriorityOrdered){int m = graph.numEdges();auto dsu = nachia::DsuFast(graph.numVertices());std::vector<int> ans;for(int i=0; i<m; i++){int e = edgePriorityOrdered[i];int v = graph[e].from;int w = graph[e].to;if(dsu.same(v,w)) continue;ans.push_back(e);dsu.merge(v,w);}return ans;}template<class Weight>std::vector<int> MinimumSpanningForest(const nachia::Graph& graph,const std::vector<Weight>& weight){int m = graph.numEdges();std::vector<int> P(m);for(int i=0; i<m; i++) P[i] = i;std::sort(P.begin(), P.end(), [&](int l, int r){ return weight[l] < weight[r]; });return MinimumSpanningForestKnownPriority(graph, P);}} // namespace nachianamespace nachia{struct HeavyLightDecomposition{private:int N;std::vector<int> P;std::vector<int> PP;std::vector<int> PD;std::vector<int> D;std::vector<int> I;std::vector<int> rangeL;std::vector<int> rangeR;public:HeavyLightDecomposition(const CsrArray<int>& E = CsrArray<int>::Construct(1, {}), int root = 0){N = E.size();P.assign(N, -1);I.assign(N, 0); I[0] = root;int iI = 1;for(int i=0; i<iI; i++){int p = I[i];for(int e : E[p]) if(P[p] != e){I[iI++] = e;P[e] = p;}}std::vector<int> Z(N, 1);std::vector<int> nx(N, -1);PP.resize(N);for(int i=0; i<N; i++) PP[i] = i;for(int i=N-1; i>=1; i--){int p = I[i];Z[P[p]] += Z[p];if(nx[P[p]] == -1) nx[P[p]] = p;if(Z[nx[P[p]]] < Z[p]) nx[P[p]] = p;}for(int p : I) if(nx[p] != -1) PP[nx[p]] = p;PD.assign(N,N);PD[root] = 0;D.assign(N,0);for(int p : I) if(p != root){PP[p] = PP[PP[p]];PD[p] = std::min(PD[PP[p]], PD[P[p]]+1);D[p] = D[P[p]]+1;}rangeL.assign(N,0);rangeR.assign(N,0);for(int p : I){rangeR[p] = rangeL[p] + Z[p];int ir = rangeR[p];for(int e : E[p]) if(P[p] != e) if(e != nx[p]){rangeL[e] = (ir -= Z[e]);}if(nx[p] != -1){rangeL[nx[p]] = rangeL[p] + 1;}}for(int i=0; i<N; i++) I[rangeL[i]] = i;}HeavyLightDecomposition(const Graph& tree, int root = 0): HeavyLightDecomposition(tree.getAdjacencyArray(true), root) {}int numVertices() const { return N; }int depth(int p) const { return D[p]; }int toSeq(int vtx) const { return rangeL[vtx]; }int toVtx(int seqidx) const { return I[seqidx]; }int toSeq2In(int vtx) const { return rangeL[vtx] * 2 - D[vtx]; }int toSeq2Out(int vtx) const { return rangeR[vtx] * 2 - D[vtx] - 1; }int parentOf(int v) const { return P[v]; }int heavyRootOf(int v) const { return PP[v]; }int heavyChildOf(int v) const {if(toSeq(v) == N-1) return -1;int cand = toVtx(toSeq(v) + 1);if(PP[v] == PP[cand]) return cand;return -1;}int lca(int u, int v) const {if(PD[u] < PD[v]) std::swap(u, v);while(PD[u] > PD[v]) u = P[PP[u]];while(PP[u] != PP[v]){ u = P[PP[u]]; v = P[PP[v]]; }return (D[u] > D[v]) ? v : u;}int dist(int u, int v) const {return depth(u) + depth(v) - depth(lca(u,v)) * 2;}struct Range{int l; int r;int size() const { return r-l; }bool includes(int x) const { return l <= x && x < r; }};std::vector<Range> path(int r, int c, bool include_root = true, bool reverse_path = false) const {if(PD[c] < PD[r]) return {};std::vector<Range> res(PD[c]-PD[r]+1);for(int i=0; i<(int)res.size()-1; i++){res[i] = { rangeL[PP[c]], rangeL[c]+1 };c = P[PP[c]];}if(PP[r] != PP[c] || D[r] > D[c]) return {};res.back() = { rangeL[r]+(include_root?0:1), rangeL[c]+1 };if(res.back().l == res.back().r) res.pop_back();if(!reverse_path) std::reverse(res.begin(),res.end());else for(auto& a : res) a = { N - a.r, N - a.l };return res;}Range subtree(int p) const { return { rangeL[p], rangeR[p] }; }int median(int x, int y, int z) const {return lca(x,y) ^ lca(y,z) ^ lca(x,z);}int la(int from, int to, int d) const {if(d < 0) return -1;int g = lca(from,to);int dist0 = D[from] - D[g] * 2 + D[to];if(dist0 < d) return -1;int p = from;if(D[from] - D[g] < d){ p = to; d = dist0 - d; }while(D[p] - D[PP[p]] < d){d -= D[p] - D[PP[p]] + 1;p = P[PP[p]];}return I[rangeL[p] - d];}struct ChildrenIterRange {struct Iter {const HeavyLightDecomposition& hld; int s;int operator*() const { return hld.toVtx(s); }Iter& operator++(){s += hld.subtree(hld.I[s]).size();return *this;}Iter operator++(int) const { auto a = *this; return ++a; }bool operator==(Iter& r) const { return s == r.s; }bool operator!=(Iter& r) const { return s != r.s; }};const HeavyLightDecomposition& hld; int v;Iter begin() const { return { hld, hld.rangeL[v] + 1 }; }Iter end() const { return { hld, hld.rangeR[v] }; }};ChildrenIterRange children(int v) const {return ChildrenIterRange{ *this, v };}};} // namespace nachianamespace nachia{int Popcount(unsigned long long c) noexcept {#ifdef __GNUC__return __builtin_popcountll(c);#elsec = (c & (~0ull/3)) + ((c >> 1) & (~0ull/3));c = (c & (~0ull/5)) + ((c >> 2) & (~0ull/5));c = (c & (~0ull/17)) + ((c >> 4) & (~0ull/17));c = (c * (~0ull/257)) >> 56;return c;#endif}// please ensure x != 0int MsbIndex(unsigned long long x) noexcept {#ifdef __GNUC__return 63 - __builtin_clzll(x);#elseusing u64 = unsigned long long;int q = (x >> 32) ? 32 : 0;auto m = x >> q;constexpr u64 hi = 0x8888'8888;constexpr u64 mi = 0x1111'1111;m = (((m | ~(hi - (m & ~hi))) & hi) * mi) >> 35;m = (((m | ~(hi - (x & ~hi))) & hi) * mi) >> 31;q += (m & 0xf) << 2;q += 0x3333'3333'2222'1100 >> (((x >> q) & 0xf) << 2) & 0xf;return q;#endif}// please ensure x != 0int LsbIndex(unsigned long long x) noexcept {#ifdef __GNUC__return __builtin_ctzll(x);#elsereturn MsbIndex(x & -x);#endif}}namespace nachia{template<class T, class CompT = std::less<T>>struct RangeMin{private:std::vector<T> A;std::vector<std::vector<int>> spa;CompT comp;int aminf(int a, int b) const { return comp(A[a], A[b]) ? a : b; }public:RangeMin() : comp() {}RangeMin(std::vector<T> a, CompT compt): A(std::move(a)), comp(std::move(compt)){int n = (int)A.size();int logn = MsbIndex(n) + 1;spa.resize(logn);for(int d=0; d<logn; d++) spa[d].resize(n-(1<<d)+1);for(int i=0; i<n; i++) spa[0][i] = i;for(int d=0; d+1<logn; d++) for(int i=0; i<(int)spa[d+1].size(); i++){spa[d+1][i] = aminf(spa[d][i], spa[d][i+(1<<d)]);}}RangeMin(std::vector<T> a) : RangeMin(std::move(a), CompT()){}int argmin(int l, int r) const {assert(l < r);int q = MsbIndex(r-l);return aminf(spa[q][l], spa[q][r-(1<<q)]);}const T& min(int l, int r) const { return A[argmin(l,r)]; }const T& get(int p) const { return A[p]; }};} // namespace nachiausing namespace std;void testcase(){i64 N, K, C; cin >> N >> K >> C;vec<i64> W(K), P(K);auto graph = nachia::Graph(N, true, K);rep(i,K){int u,v,w,p; cin >> u >> v >> w >> p; u--; v--;graph[i] = {u,v}; W[i] = w; P[i] = p;}auto mst = nachia::MinimumSpanningForest(graph, *W);if(int(mst.size()) != N-1) exit(1);i64 mstcost = 0;for(auto e : mst) mstcost += W[e];if(mstcost > C){ cout << "-1\n"; return; }auto tree = nachia::Graph(N, true);for(auto e : mst) tree.addEdge(graph[e].from, graph[e].to);auto hld = nachia::HeavyLightDecomposition(tree);for(auto& e : tree) if(e.from != hld.parentOf(e.to)) e.reverse();vec<i64> ew(N);rep(i,N-1) ew[hld.toSeq(tree[i].to)] = -W[mst[i]];auto rq = nachia::RangeMin<i64>(ew);i64 ans = 0;for(auto e : mst) chmax(ans, P[e]);rep(k,K) if(ans < P[k]){i64 mincost = INF;auto [u,v] = graph[k];auto g = hld.lca(u,v);for(auto [l,r] : hld.path(g, u, false)) chmin(mincost, rq.min(l,r));for(auto [l,r] : hld.path(g, v, false)) chmin(mincost, rq.min(l,r));mincost += W[k] + mstcost;if(mincost <= C) chmax(ans, P[k]);}cout << ans << '\n';}int main(){ios::sync_with_stdio(false); cin.tie(nullptr);#ifdef NACHIAint T; cin >> T; for(int t=0; t<T; T!=++t?(cout<<'\n'),0:0)#endiftestcase();return 0;}