結果

問題 No.2642 Don't cut line!
ユーザー miscalcmiscalc
提出日時 2024-02-19 23:22:37
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 3,936 ms / 4,000 ms
コード長 3,475 bytes
コンパイル時間 5,572 ms
コンパイル使用メモリ 330,864 KB
実行使用メモリ 10,368 KB
最終ジャッジ日時 2024-09-29 03:09:28
合計ジャッジ時間 121,376 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 3,922 ms
10,244 KB
testcase_02 AC 3,919 ms
10,368 KB
testcase_03 AC 3,919 ms
10,240 KB
testcase_04 AC 3,917 ms
10,236 KB
testcase_05 AC 3,918 ms
10,364 KB
testcase_06 AC 3,923 ms
9,540 KB
testcase_07 AC 3,934 ms
9,672 KB
testcase_08 AC 3,925 ms
9,424 KB
testcase_09 AC 3,924 ms
9,636 KB
testcase_10 AC 3,925 ms
9,664 KB
testcase_11 AC 3,923 ms
9,632 KB
testcase_12 AC 3,923 ms
9,876 KB
testcase_13 AC 3,926 ms
9,596 KB
testcase_14 AC 3,936 ms
9,604 KB
testcase_15 AC 3,922 ms
9,888 KB
testcase_16 AC 119 ms
7,152 KB
testcase_17 AC 3,919 ms
9,308 KB
testcase_18 AC 3,919 ms
9,872 KB
testcase_19 AC 3,918 ms
8,260 KB
testcase_20 AC 3,918 ms
8,064 KB
testcase_21 AC 99 ms
6,816 KB
testcase_22 AC 89 ms
6,816 KB
testcase_23 AC 3,918 ms
10,324 KB
testcase_24 AC 3,917 ms
7,168 KB
testcase_25 AC 3,928 ms
7,424 KB
testcase_26 AC 3,919 ms
8,932 KB
testcase_27 AC 3,918 ms
7,848 KB
testcase_28 AC 3,920 ms
9,580 KB
testcase_29 AC 3,919 ms
8,576 KB
testcase_30 AC 3,919 ms
7,808 KB
testcase_31 AC 3,918 ms
8,752 KB
testcase_32 AC 3,930 ms
7,936 KB
testcase_33 AC 2 ms
6,820 KB
testcase_34 AC 1 ms
6,816 KB
testcase_35 AC 2 ms
6,820 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {ll res = A % M; if (res < 0) res += M; return res;}
ll divfloor(ll A, ll B) {if (B < 0) A = -A, B = -B; return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) A = -A, B = -B; return divfloor(A + B - 1, B);}
ll pow_ll(ll A, ll B) {if (A == 0 || A == 1) {return A;} if (A == -1) {return B & 1 ? -1 : 1;} ll res = 1; for (int i = 0; i < B; i++) {res *= A;} return res;}
ll mul_limited(ll A, ll B, ll M = INF) { return B == 0 ? 0 : A > M / B ? M : A * B; }
ll pow_limited(ll A, ll B, ll M = INF) { if (A == 0 || A == 1) {return A;} ll res = 1; for (int i = 0; i < B; i++) {if (res > M / A) return M; res *= A;} return res;}
template<class T> void unique(vector<T> &V) {V.erase(unique(V.begin(), V.end()), V.end());}
template<class T> void sortunique(vector<T> &V) {sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end());}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)
//*
#include <atcoder/all>
using namespace atcoder;
template <class T, internal::is_static_modint_t<T> * = nullptr>
istream &operator>>(istream &is, T &a) { ll v; is >> v; a = v; return is; }
template <class T, internal::is_dynamic_modint_t<T> * = nullptr>
istream &operator>>(istream &is, T &a) { ll v; is >> v; a = v; return is; }
template <class T, internal::is_static_modint_t<T> * = nullptr>
ostream &operator<<(ostream &os, const T &a) { os << a.val(); return os; }
template <class T, internal::is_dynamic_modint_t<T> * = nullptr>
ostream &operator<<(ostream &os, const T &a) { os << a.val(); return os; }
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = modint;
//*/
template<class T> void printvec(const vector<T> &V) {int _n = V.size(); for (int i = 0; i < _n; i++) cout << V[i] << (i == _n - 1 ? "" : " "); cout << '\n';}
template<class T> void printvect(const vector<T> &V) {for (auto v : V) cout << v << '\n';}
template<class T> void printvec2(const vector<vector<T>> &V) {for (auto &v : V) printvec(v);}

int main()
{
  ll start_time = clock();

  ll N, K, C;
  cin >> N >> K >> C;
  using tlll = tuple<ll, ll, ll, ll>;
  vector<tlll> UVWP(K);
  for (ll i = 0; i < K; i++)
  {
    ll u, v, w, p;
    cin >> u >> v >> w >> p;
    u--, v--;
    UVWP.at(i) = {u, v, w, p};
  }

  ll ans = 0;
  {
    ranges::sort(UVWP, {}, [&](tlll &t) { return get<2>(t); });
    dsu ds(N);
    ll cost = 0, gain = 0;
    for (auto [u, v, w, p] : UVWP)
    {
      if (ds.same(u, v)) continue;
      ds.merge(u, v);
      cost += w;
      chmax(gain, p);
    }
    if (cost > C)
      FINALANS(-1);
    ans = gain;
  }
  auto UVWP2(UVWP);
  ranges::sort(UVWP2, greater{}, [&](tlll &t) { return get<3>(t); });
  for (auto [u1, v1, w1, p1] : UVWP)
  {
    ll cost = 0, gain = 0;
    dsu ds(N);
    ds.merge(u1, v1);
    cost += w1, gain = p1;
    for (auto [u, v, w, p] : UVWP)
    {
      if (ds.same(u, v)) continue;
      ds.merge(u, v);
      cost += w;
      chmax(gain, p);

      if (clock() - start_time >= 3900000)
        FINALANS(ans);
    }
    if (cost <= C)
      chmax(ans, gain);
  }
  cout << ans << endl;
}
0