結果

問題 No.1898 Battle and Exchange
ユーザー hitonanodehitonanode
提出日時 2022-04-10 02:03:21
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 507 ms / 5,000 ms
コード長 7,079 bytes
コンパイル時間 2,924 ms
コンパイル使用メモリ 191,936 KB
実行使用メモリ 12,020 KB
最終ジャッジ日時 2024-05-07 13:15:51
合計ジャッジ時間 20,492 ms
ジャッジサーバーID
(参考情報)
judge2 / judge5
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 3 ms
5,376 KB
testcase_05 AC 3 ms
5,376 KB
testcase_06 AC 4 ms
5,376 KB
testcase_07 AC 3 ms
5,376 KB
testcase_08 AC 3 ms
5,376 KB
testcase_09 AC 34 ms
5,376 KB
testcase_10 AC 2 ms
5,376 KB
testcase_11 AC 2 ms
5,376 KB
testcase_12 AC 12 ms
5,376 KB
testcase_13 AC 1 ms
5,376 KB
testcase_14 AC 9 ms
5,376 KB
testcase_15 AC 2 ms
5,376 KB
testcase_16 AC 4 ms
5,376 KB
testcase_17 AC 17 ms
5,376 KB
testcase_18 AC 79 ms
5,376 KB
testcase_19 AC 126 ms
5,888 KB
testcase_20 AC 141 ms
6,132 KB
testcase_21 AC 421 ms
9,988 KB
testcase_22 AC 2 ms
5,376 KB
testcase_23 AC 4 ms
5,376 KB
testcase_24 AC 4 ms
5,376 KB
testcase_25 AC 6 ms
5,376 KB
testcase_26 AC 2 ms
5,376 KB
testcase_27 AC 30 ms
5,376 KB
testcase_28 AC 41 ms
5,376 KB
testcase_29 AC 130 ms
5,376 KB
testcase_30 AC 10 ms
5,376 KB
testcase_31 AC 3 ms
5,376 KB
testcase_32 AC 61 ms
5,632 KB
testcase_33 AC 81 ms
7,512 KB
testcase_34 AC 49 ms
5,376 KB
testcase_35 AC 85 ms
6,528 KB
testcase_36 AC 54 ms
6,124 KB
testcase_37 AC 46 ms
5,376 KB
testcase_38 AC 507 ms
12,020 KB
testcase_39 AC 386 ms
10,384 KB
testcase_40 AC 449 ms
11,344 KB
testcase_41 AC 346 ms
10,084 KB
testcase_42 AC 14 ms
5,376 KB
testcase_43 AC 259 ms
8,360 KB
testcase_44 AC 2 ms
5,376 KB
testcase_45 AC 26 ms
5,376 KB
testcase_46 AC 121 ms
5,888 KB
testcase_47 AC 32 ms
5,376 KB
testcase_48 AC 77 ms
5,376 KB
testcase_49 AC 24 ms
5,376 KB
testcase_50 AC 23 ms
5,376 KB
testcase_51 AC 24 ms
5,376 KB
testcase_52 AC 55 ms
5,376 KB
testcase_53 AC 250 ms
5,376 KB
testcase_54 AC 369 ms
5,444 KB
testcase_55 AC 294 ms
5,472 KB
testcase_56 AC 393 ms
5,512 KB
testcase_57 AC 363 ms
10,612 KB
testcase_58 AC 489 ms
10,736 KB
testcase_59 AC 468 ms
10,612 KB
testcase_60 AC 465 ms
10,740 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <typename T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
#endif
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl
#define dbgif(cond, x) ((cond) ? cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl : cerr)
#else
#define dbg(x) 0
#define dbgif(cond, x) 0
#endif

int main() {
    int N, M;
    cin >> N >> M;
    vector<vector<int>> to(N);
    while (M--) {
        int a, b;
        cin >> a >> b;
        --a, --b;
        to[a].push_back(b), to[b].push_back(a);
    }

    vector A(3, vector<int>(N));
    vector<int> sum(N);

    REP(i, N) {
        vector<int> v(3);
        cin >> v;
        sort(v.rbegin(), v.rend());
        sum[i] = accumulate(ALL(v), 0);
        REP(d, 3) A[d][i] = v[d];
    }
    dbg(A);


    int lo = A[0][0] + A[1][0] + A[2][0], hi = 3.01e8;
    while (hi - lo > 1) {
        const int c = (lo + hi) / 2;

        int hi1 = c - 2, hi2 = 1, hi3 = 1, su = c;

        bool found = false;

        for (auto nxt : to[0]) {
            if (sum[nxt] < c - 1 + A[0][0]) found = true;
        }

        if (!found) {
            lo = c;
            continue;
        }

        vector<int> visited(N);
        auto adv = [&](int x) {
            visited[x] = 1;
            REP(d, 3) {
                int v = A[d][x];
                if (v > hi1) {
                    hi3 = hi2;
                    hi2 = hi1;
                    hi1 = v;
                } else if (v > hi2) {
                    hi3 = hi2;
                    hi2 = v;
                } else if (v > hi3) {
                    hi3 = v;
                }
                su = hi1 + hi2 + hi3;
            }
        };

        adv(0);

        priority_queue<pint, vector<pint>, greater<>> pq;
        for (auto nxt : to[0]) pq.emplace(sum[nxt], nxt);

        while (pq.size()) {
            auto [vnow, now] = pq.top();
            pq.pop();
            if (visited[now]) continue;
            if (vnow >= su) break;
            adv(now);
            for (auto nxt : to[now]) {
                if (!visited[nxt]) pq.emplace(sum[nxt], nxt);
            }
        }
        (visited.back() ? hi : lo) = c;
    }
    cout << hi - 2 << " 1 1\n";
}
0