結果
問題 | No.2642 Don't cut line! |
ユーザー |
|
提出日時 | 2024-02-23 20:24:06 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 111 ms / 4,000 ms |
コード長 | 9,394 bytes |
コンパイル時間 | 3,834 ms |
コンパイル使用メモリ | 251,580 KB |
実行使用メモリ | 30,136 KB |
最終ジャッジ日時 | 2024-09-29 05:15:28 |
合計ジャッジ時間 | 7,739 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 33 |
コンパイルメッセージ
main.cpp: In member function 'void HeavyLightDecomposition::path_query(int, int, bool, const F&)': main.cpp:169:21: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions] 169 | for (auto &&[a, b] : ascend(u, l)){ | ^ main.cpp:174:21: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions] 174 | for (auto &&[a, b] : descend(l, v)){ | ^
ソースコード
#include<bits/stdc++.h>#include<atcoder/all>#define rep(i,b) for(int i=0;i<b;i++)#define rrep(i,b) for(int i=b-1;i>=0;i--)#define rep1(i,b) for(int i=1;i<b;i++)#define repx(i,x,b) for(int i=x;i<b;i++)#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)#define fore(i,a) for(auto& i:a)#define rng(x) (x).begin(), (x).end()#define rrng(x) (x).rbegin(), (x).rend()#define sz(x) ((int)(x).size())#define pb push_back#define fi first#define se second#define pcnt __builtin_popcountllusing namespace std;using namespace atcoder;using ll = long long;using ld = long double;template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}#define retval(x) {cout << #x << endl; return;}#define cout2(x,y) cout << x << " " << y << endl;#define coutp(p) cout << p.fi << " " << p.se << endl;#define out cout << ans << endl;#define outd cout << fixed << setprecision(20) << ans << endl;#define outm cout << ans.val() << endl;#define outv fore(yans , ans) cout << yans << "\n";#define outdv fore(yans , ans) cout << yans.val() << "\n";#define assertmle(x) if (!(x)) {vi v(3e8);}#define asserttle(x) if (!(x)) {while(1){}}#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}#define coutv2(v) fore(vy , v) cout << vy << "\n";#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;using mint = modint998244353;//using mint = modint1000000007;//using mint = dynamic_modint<0>;using vm = vector<mint>;using vvm = vector<vector<mint>>;vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}#define yes {cout <<"Yes"<<endl;}#define no {cout <<"No"<<endl;}const double eps = 1e-10;const ll LINF = 1001002003004005006ll;const int INF = 1001001001;#ifdef MY_LOCAL_DEBUG#include "./debug/localDebug.cpp"#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl#define show1(a) cerr<<#a<<" = "<<a<<endl#define show2(a,b) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<endl#define show3(a,b,c) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<endl#define show4(a,b,c,d) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<endl#define show5(a,b,c,d,e) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<" : "<<#e<<" = "<<e<<endl#define DEBUG_LINE cout << "DEBUG_LINE : " << __LINE__ << endl#define showv(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy << " ";} cout << endl;}#define showv2(v) {cout<<#v<<endl; fore(vy , v) cout << vy << "\n";}#define showvm(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy.val() << " ";} cout << endl;}#define showvm2(v) {cout<<#v<<endl; fore(vy , v) cout << vy.val() << "\n";}#define showmat(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg << " "; cout << endl;}}#define showmatm(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg.val() << " "; cout << endl;}}#else#define showp(p)#define show1(a)#define show2(a,b)#define show3(a,b,c)#define show4(a,b,c,d)#define show5(a,b,c,d,e)#define DEBUG_LINE#define showv(v)#define showv2(v)#define showvm(v)#define showvm2(v)#define showmat(v)#define showmatm(v)#endif#define overload5(a,b,c,d,e,f, ...) f#define show(...) overload5(__VA_ARGS__, show5, show4, show3, show2, show1)(__VA_ARGS__)struct HeavyLightDecomposition{private:int _id;void _dfs_sz(int x){size[x] = 1;for(int& y : e[x]){if (y == par[x]){if (sz(e[x])>=2 && y==e[x][0]){swap(e[x][0], e[x][1]);}else{continue;}}depth[y] = depth[x] + 1;par[y] = x;_dfs_sz(y);size[x] += size[y];if (size[y] > size[e[x][0]]) swap(y, e[x][0]);}}void _dfs_hld(int x){down[x] = _id++;for (int& y : e[x]){if (y == par[x]) continue;nxt[y] = (y == e[x][0]) ? nxt[x] : y;_dfs_hld(y);}up[x] = _id;}// [u, v)vpii ascend(int a, int b) const {vpii res;while (nxt[a]!=nxt[b]){res.emplace_back(down[a], down[nxt[a]]);a = par[nxt[a]];}if (a != b) res.emplace_back(down[a], down[b] + 1);return res;}// (u, v]vpii descend(int a, int b) const {if (a == b) return {};if (nxt[a] == nxt[b]) return {{down[a] + 1, down[b]}};vpii res = descend(a, par[nxt[b]]);res.emplace_back(down[nxt[b]], down[b]);return res;}public:int n;vvi e;vi size, depth, down, up, nxt, par;HeavyLightDecomposition(const vvi& _e, int root = 0) : e(_e){n = sz(e);_id = 0;size = vi(n);depth = vi(n);down = vi(n,-1);up = vi(n,-1);nxt = vi(n,root);par = vi(n,root);_dfs_sz(root);_dfs_hld(root);}pii idx(int i) const { return make_pair(down[i], up[i]); }template <typename F>void path_query(int u, int v, bool vertex, const F &f){int l = lca(u, v);for (auto &&[a, b] : ascend(u, l)){int s = a + 1, t = b;s > t ? f(t, s) : f(s, t);}if (vertex) f(down[l], down[l] + 1);for (auto &&[a, b] : descend(l, v)){int s = a, t = b + 1;s > t ? f(t, s) : f(s, t);}}template <typename F>void subtree_query(int u, bool vertex, const F &f){f(down[u] + int(!vertex), up[u]);}int lca(int a, int b){while (nxt[a] != nxt[b]){if (down[a] < down[b]) swap(a, b);a = par[nxt[a]];}return depth[a] < depth[b] ? a : b;}int dist(int a, int b) { return depth[a] + depth[b] - depth[lca(a, b)] * 2; }};// HeavyLightDecomposition//// pravate (コンストラクタの中のみで実行される)// _dfs_sz : 部分木のサイズを計算// _dfs_hld : 親,オイラーツアーのidxを計算// public// メンバ変数// int n : 頂点数// vvi e : 木の隣接頂点リスト// vi size[x] : xを根とする部分木のサイズ , depth[x] : xの深さ , down[x] up[x] : xの行きがけ(戻りがけ)順番号// nxt[x] : xが属するheavyPathの最祖先の親(最祖先がrootの場合はroot) , par[x] : xの親// メンバ関数// HeavyLightDecomposition(const vvi& _e, int root = 0)// : eは木の隣接頂点リスト,rootは根// vpii idx(int x) : return {down[x], up[x]}// void path_query(int u, int v, bool vertex, const F &f)// : u-vパス上でクエリfを実行,クエリ要素が頂点であるならvertex=trueとする// void subtree_query(int u, bool vertex, const F &f)// : uの部分木全体にクエリを実行// int lca(a,b) : a,bのlca// int dist(int a, int b) : a-bパスの長さll op(ll a,ll b) {return max(a,b);}ll ee(){return 0;}void solve(){ll n,k,c; cin>>n>>k>>c;vl u(k),v(k),w(k),p(k);vpli ed(k);rep(i,k){cin>>u[i]>>v[i]>>w[i]>>p[i];u[i]--;v[i]--;ed[i] = {w[i], i};}dsu d(n);sort(rng(ed));ll sum = 0;ll mx = 0;vvi e(n);vi idx;fore(y, ed){int a = u[y.se];int b = v[y.se];if (d.same(a,b)) continue;d.merge(a,b);sum += w[y.se];e[a].pb(b);e[b].pb(a);idx.pb(y.se);chmax(mx, p[y.se]);}if (sum > c) retval(-1);HeavyLightDecomposition hld(e);segtree<ll,op,ee> sg(n);fore(y , idx){int id = max(hld.down[u[y]], hld.down[v[y]]) - 1;sg.set(id, w[y]);}ll ans = mx;rep(i,k){ll pro = 0;auto f = [&](ll a,ll b)->void{chmax(pro, sg.prod(a-1,b-1));};int a = u[i];int b = v[i];hld.path_query(a,b,false,f);if (sum + (w[i] - pro) > c) continue;chmax(ans, p[i]);}out;return;}int main(){ios::sync_with_stdio(false);cin.tie(0);int t = 1;//cin>>t;rep(i,t){solve();}return 0;}