結果

問題 No.2642 Don't cut line!
ユーザー akiaa11akiaa11
提出日時 2024-02-21 18:54:45
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 98 ms / 4,000 ms
コード長 6,561 bytes
コンパイル時間 4,803 ms
コンパイル使用メモリ 279,840 KB
実行使用メモリ 19,324 KB
最終ジャッジ日時 2024-09-29 04:19:16
合計ジャッジ時間 7,840 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 33
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#include <atcoder/all>
#define SELECTER(_1,_2,_3,SELECT,...) SELECT
#define rep1(i,n) for(int i=0;i<(int)n;++i)
#define rep2(i,a,n) for(int i=(int)a;i<(int)n;++i)
#define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)
#define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT
#define rrep1(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define rrep2(i,a,n) for(int i=(int)(n)-1;i>=(int)a;--i)
#define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define PrintR LogOutput
#ifdef _DEBUG
#define Log(...) LogOutput(__VA_ARGS__)
#else
#define Log(...)
#endif
#define M_PI 3.14159265358979323846
using namespace std;
using namespace atcoder;
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
using pll=pair<long long,long long>;
using pdd=pair<long double,long double>;
using tp=tuple<int,int,int>;
using tpll=tuple<ll,ll,ll>;
using veci=vector<int>;
using vecpii=vector<pair<int,int>>;
using vecll=vector<long long>;
using vecpll=vector<pair<long long,long long>>;
using vecpdd=vector<pair<long double,long double>>;
using vecs=vector<string>;
using vecb=vector<bool>;
using vecd=vector<long double>;
using vectp=vector<tp>;
using vectpll=vector<tpll>;
using mint=modint998244353;
using mint10=modint1000000007;
template<typename T, typename S>
istream& operator>>(istream& in, pair<T, S>& a){return in >> a.first >> a.second;}
template<typename T, typename S>
ostream& operator<<(ostream& out, const pair<T, S>& a){return out << a.first << ' ' << a.second;}
ostream& operator<<(ostream& out, const mint& a){return out << a.val();}
ostream& operator<<(ostream& out, const mint10& a){return out << a.val();}
ostream& operator<<(ostream& out, const modint& a){return out << a.val();}
template<typename T>
ostream& operator<<(ostream& out, const vector<T>& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << (i == d.size() - 1 ? "" : " "); return out;}
template<typename T, typename S>
pair<T, S> operator+(const pair<T, S>& a, const pair<T, S>& b){return {a.fi + b.fi, a.se + b.se};}
template<typename T, typename S>
pair<T, S> operator-(const pair<T, S>& a, const pair<T, S>& b){return {a.fi - b.fi, a.se - b.se};}
template<class T> inline bool chmax(T& a,T b){if(a<b) {a=b;return true;} return false;}
template<class T> inline bool chmin(T& a,T b){if(a>b) {a=b;return true;} return false;}
bool Judge(int i, int j, int h, int w){return i < 0 || j < 0 || i >= h || j >= w;}
bool PrintA(int i){cout<<(i ? "Yes" : "No")<<endl;return i;}

constexpr ll INF=numeric_limits<ll>::max() >> 2;
constexpr int inf=numeric_limits<int>::max() >> 1;
constexpr ll MOD=998244353;
const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0};

template<typename... Args>
void LogOutput(Args&&... args){
	stringstream ss;
	((ss << args << ' '), ...);
	cout << ss.str().substr(0, ss.str().length() - 1) << endl;
}
template<typename T>
void LogOutput(vector<vector<T>>& data){for(auto d : data) LogOutput(d);}

class HLD{
	public:
		using P = std::pair<int, int>;
		HLD(int n) : _n(n), _g(_n), _in(_n), _out(_n), _par(_n), _head(_n){}
		void add_edge(int a, int b){
			assert(0 <= a && a < _n);
			assert(0 <= b && b < _n);
			_g[a].push_back(b);
			_g[b].push_back(a);
		}
		void init(int s = 0){
			assert(0 <= s && s < _n);
			{
				std::vector<int> sz(_n);
				dfs_sz(sz, s, -1);
			}
			int k = 0;
			dfs_hld(s, k);
		}

		template<typename T, typename F>
		void set_v(int v, T value, const F& f){
			assert(0 <= v && v < _n);
			f(_in[v], value);
		}
		template<typename T, typename F>
		void set_e(int u, int v, T value, const F& f){
			assert(0 <= u && u < _n);
			assert(0 <= v && v < _n);
			if(_in[u] > _in[v]) std::swap(u, v);
			f(_in[v], value);
		}
		template<typename T, typename F>
		void set_sub_v(int v, T value, const F &f, int E = 0){
			assert(0 <= v && v < _n);
			f(_in[v] + E, _out[v], value);
		}
		template<typename T, typename F>
		void set_sub_e(int v,  T value, const F& f){
			assert(0 <= v && v < _n);
			set_sub_v(v, f, value, 1);
		}

		template<typename F>
		void query_v(int u, int v, const F &f, int E = 0){
			assert(0 <= u && u < _n);
			assert(0 <= v && v < _n);
			while(1){
				if(_in[u] > _in[v]) std::swap(u, v);
				f(std::max(_in[u] + E, _in[_head[v]]), _in[v] + 1);
				if(_head[u] != _head[v]) v = _par[_head[v]];
				else break;
			}
		}
		template<typename F>
		void query_e(int u, int v, const F &f){
			query_v(u, v, f, 1);
		}
		template<typename F>
		void query_sub_v(int v, const F &f, int E = 0){
			assert(0 <= v && v < _n);
			f(_in[v] + E, _out[v]);
		}
		template<typename F>
		void query_sub_e(int v, const F& f){
			query_sub_v(v, f, 1);
		}

		int lca(int u, int v){
			assert(0 <= u && u < _n);
			assert(0 <= v && v < _n);
			while(1){
				if(_in[u] > _in[v]) std::swap(u, v);
				if(_head[u] == _head[v]) return u;
				v = _par[_head[v]];
			}
		}
		int In_v(int v){return _in[v];}

	private:
		int _n;
		std::vector<std::vector<int>> _g;
		std::vector<int> _in, _out;
		std::vector<int> _par;
		std::vector<int> _head;

		void dfs_sz(std::vector<int>& sz, int v, int p){
			sz[v] = 1; _par[v] = p;
			for(int& nv : _g[v]) if(nv != p){
				dfs_sz(sz, nv, v);
				sz[v] += sz[nv];
				if(sz[nv] > sz[_g[v][0]]){
					std::swap(nv, _g[v][0]);
				}
			}
		}
		void dfs_hld(int v, int& k){
			_in[v] = k++;
			for(int nv : _g[v]) if(nv != _par[v]){
				_head[nv] = (nv == _g[v][0] ? _head[v] : nv);
				dfs_hld(nv, k);
			}
			_out[v] = k;
		}
};

int op(int a, int b){return max(a, b);}
int ef(){return 0;}

int main(){
	ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n, m;
	ll c;cin>>n>>m>>c;
	vector<tuple<int, int, int, int>> e(m);
	priority_queue<pii, vecpii, greater<pii>> q;
	rep(i, m){
		auto& [a, b, c, d] = e[i];
		cin>>a>>b>>c>>d;
		a--, b--;
		q.emplace(c, i);
	}
	HLD hld(n);
	dsu t(n);
	ll cs = 0;
	veci used;
	while(q.size()){
		auto [p, i] = q.top(); q.pop();
		auto [u, v, ct, d] = e[i];
		if(t.same(u, v)) continue;
		used.push_back(i);
		t.merge(u, v);
		hld.add_edge(u, v);
		cs += p;
	}
	if(cs > c){
		cout<<-1<<endl;
		return 0;
	}
	hld.init();
	segtree<int, op, ef> sg(n);
	auto Set = [&](int i, int k){
		sg.set(i, k);
	};
	int res = 0;
	auto Query = [&](int l, int r){
		chmax(res, sg.prod(l, r));
	};
	for(int i : used) hld.set_e(get<0>(e[i]), get<1>(e[i]), get<2>(e[i]), Set);
	int ans = 0;
	rep(i, m){
		auto& [u, v, ct, p] = e[i];
		res = 0;
		hld.query_e(u, v, Query);
		if(cs - res + ct <= c)
			chmax(ans, p);
	}
	cout<<ans<<endl;
}
0