結果
問題 | No.2642 Don't cut line! |
ユーザー |
![]() |
提出日時 | 2024-02-19 22:15:14 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 143 ms / 4,000 ms |
コード長 | 3,037 bytes |
コンパイル時間 | 5,759 ms |
コンパイル使用メモリ | 320,612 KB |
実行使用メモリ | 35,308 KB |
最終ジャッジ日時 | 2024-09-29 03:34:05 |
合計ジャッジ時間 | 9,484 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 33 |
ソースコード
#include <atcoder/all>#include <bits/stdc++.h>using ll = long long;using ull = unsigned long long;#define rep(i, n) for(int i = 0; i < (int)(n); i++)#define REP(i, m, n) for(int i = (int)(m); i < (int)(n); i++)using namespace std;using namespace atcoder;using mint = modint998244353;const int inf = 1000000007;const ll longinf = 1ll << 60;int main() {ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);int n, m;cin >> n >> m;ll c;cin >> c;vector<int> l(m), r(m), w(m), p(m);rep(i, m) {cin >> l[i] >> r[i] >> w[i] >> p[i];--l[i];--r[i];}vector<int> ord(m);rep(i, m) ord[i] = i;sort(ord.begin(), ord.end(), [&](int x, int y) {return w[x] < w[y];});dsu uf(n);vector<vector<pair<int, int>>> g(n);vector<int> used(m);ll cost = 0;for(auto i : ord) {if(uf.same(l[i], r[i])) {continue;}used[i] = 1;uf.merge(l[i], r[i]);g[l[i]].push_back({r[i], w[i]});g[r[i]].push_back({l[i], w[i]});cost += w[i];}if(cost > c) {cout << -1 << endl;return 0;}vector<int> parent(n), rank(n);auto dfs = [&](auto &&self, int x, int p) -> void {parent[x] = p;for(auto to : g[x]) {if(to.first == p)continue;rank[to.first] = rank[x] + 1;self(self, to.first, x);}};dfs(dfs, 0, -1);vector nxt(n, vector<pair<int, int>>(20));rep(i, n) {nxt[i][0] = {-1, -1};for(auto to : g[i]) {if(to.first == parent[i]) {nxt[i][0] = to;}}}rep(b, 19) {rep(i, n) {if(nxt[i][b].first == -1) {nxt[i][b + 1] = nxt[i][b];} else {auto nnxt = nxt[nxt[i][b].first][b];nxt[i][b + 1] = {nnxt.first, max(nnxt.second, nxt[i][b].second)};}}}auto query = [&](int l, int r) -> int {int ma = 0;if(rank[l] < rank[r])swap(l, r);for(int b = 19; b >= 0; --b) {if(rank[l] - (1 << b) < rank[r])continue;ma = max(ma, nxt[l][b].second);l = nxt[l][b].first;}if(l == r) {return ma;}for(int b = 19; b >= 0; --b) {if(nxt[l][b].first == nxt[r][b].first)continue;ma = max(ma, nxt[l][b].second);ma = max(ma, nxt[r][b].second);l = nxt[l][b].first;r = nxt[r][b].first;}return max({ma, nxt[l][0].second, nxt[r][0].second});};int ans = 0;rep(i, m) {if(used[i]) {ans = max(ans, p[i]);continue;}int ret = query(l[i], r[i]);if(cost - ret + w[i] <= c) {ans = max(ans, p[i]);}}cout << ans << endl;return 0;}