結果

問題 No.1780 [Cherry Anniversary] 真冬に咲く26の櫻の木
ユーザー hitonanodehitonanode
提出日時 2021-12-09 00:19:40
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 342 ms / 2,000 ms
コード長 9,164 bytes
コンパイル時間 2,288 ms
コンパイル使用メモリ 190,588 KB
実行使用メモリ 17,048 KB
最終ジャッジ日時 2024-07-16 11:21:12
合計ジャッジ時間 6,881 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,944 KB
testcase_02 AC 4 ms
6,940 KB
testcase_03 AC 4 ms
6,944 KB
testcase_04 AC 5 ms
6,944 KB
testcase_05 AC 4 ms
6,940 KB
testcase_06 AC 4 ms
6,944 KB
testcase_07 AC 4 ms
6,944 KB
testcase_08 AC 4 ms
6,940 KB
testcase_09 AC 4 ms
6,940 KB
testcase_10 AC 4 ms
6,944 KB
testcase_11 AC 4 ms
6,940 KB
testcase_12 AC 4 ms
6,940 KB
testcase_13 AC 3 ms
6,940 KB
testcase_14 AC 57 ms
6,944 KB
testcase_15 AC 252 ms
13,296 KB
testcase_16 AC 249 ms
13,344 KB
testcase_17 AC 37 ms
6,944 KB
testcase_18 AC 154 ms
9,380 KB
testcase_19 AC 50 ms
6,944 KB
testcase_20 AC 184 ms
10,612 KB
testcase_21 AC 318 ms
16,144 KB
testcase_22 AC 327 ms
16,552 KB
testcase_23 AC 77 ms
6,940 KB
testcase_24 AC 342 ms
17,048 KB
testcase_25 AC 70 ms
6,940 KB
testcase_26 AC 53 ms
6,944 KB
testcase_27 AC 155 ms
9,360 KB
testcase_28 AC 31 ms
6,940 KB
testcase_29 AC 22 ms
6,944 KB
testcase_30 AC 311 ms
15,776 KB
testcase_31 AC 10 ms
6,940 KB
testcase_32 AC 23 ms
6,944 KB
testcase_33 AC 138 ms
8,704 KB
testcase_34 AC 2 ms
6,940 KB
testcase_35 AC 7 ms
6,940 KB
testcase_36 AC 3 ms
6,944 KB
testcase_37 AC 7 ms
6,940 KB
testcase_38 AC 7 ms
6,940 KB
testcase_39 AC 8 ms
6,940 KB
testcase_40 AC 7 ms
6,944 KB
testcase_41 AC 7 ms
6,944 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) (x)
#define dbgif(cond, x) 0
#endif

// Tropical matrix
// Verify: <https://atcoder.jp/contests/ddcc2020-final/submissions/16941701>
// A[j][i] = "length of shortest parh i -> j of graph A"
// (B * A)[k][i] = min_j (B[k][j] + A[j][i])
template <typename T> struct tropical_matrix {
    constexpr static T INF = __int128(1LL << 62);
    static bool _chmin(T &m, const T q) {
        if (m > q) {
            m = q;
            chmax(m, -INF);
            return true;
        }
        return false;
    }
    int H, W;
    std::vector<T> elem;
    typename std::vector<T>::iterator operator[](int i) { return elem.begin() + i * W; }
    inline T &at(int i, int j) { return elem[i * W + j]; }
    inline T get(int i, int j) const { return elem[i * W + j]; }
    operator std::vector<std::vector<T>>() const {
        std::vector<std::vector<T>> ret(H);
        for (int i = 0; i < H; i++) std::copy(elem.begin() + i * W, elem.begin() + (i + 1) * W, std::back_inserter(ret[i]));
        return ret;
    }

    tropical_matrix(int H = 0, int W = 0) : H(H), W(W), elem(H * W, INF) {}
    tropical_matrix(const std::vector<std::vector<T>> &d) : H(d.size()), W(d.size() ? d[0].size() : 0) {
        for (auto &raw : d) std::copy(raw.begin(), raw.end(), std::back_inserter(elem));
    }

    static tropical_matrix Identity(int N) {
        tropical_matrix ret(N, N);
        for (int i = 0; i < N; i++) ret.at(i, i) = 0;
        return ret;
    }

    tropical_matrix operator+(const tropical_matrix &r) const {
        tropical_matrix ret(H, W);
        for (int i = 0; i < H * W; i++) _chmin(ret.elem[i], r.elem[i]);
        return ret;
    }
    tropical_matrix operator*(const tropical_matrix &r) const {
        tropical_matrix ret(H, r.W);
        for (int i = 0; i < H; i++) {
            for (int k = 0; k < W; k++) {
                for (int j = 0; j < r.W; j++) {_chmin(ret.at(i, j), this->get(i, k) + r.get(k, j)); }
            }
        }
        return ret;
    }
    tropical_matrix &operator+=(const tropical_matrix &r) { return *this = *this + r; }
    tropical_matrix &operator*=(const tropical_matrix &r) { return *this = *this * r; }
    bool operator==(const tropical_matrix &r) const { return H == r.H and W == r.W and elem == r.elem; }
    bool operator!=(const tropical_matrix &r) const { return H != r.H or W != r.W or elem != r.elem; }
    bool operator<(const tropical_matrix &r) const { return elem < r.elem; }
    tropical_matrix pow(int64_t n) const {
        tropical_matrix ret = Identity(H);
        if (n == 0) return ret;
        for (int i = 63 - __builtin_clzll(n); i >= 0; i--) {
            ret *= ret;
            if ((n >> i) & 1) ret *= (*this);
        }
        return ret;
    }
};


int main() {
    constexpr int W = 26;
    vector<int> C(W), K(W);
    cin >> C >> K;
    for (auto &x : C) --x;
    int N;
    cin >> N;
    dbg(C);
    dbg(K);
    vector<tuple<string, int, int, int>> SABE(N);
    for (auto &[s, a, b, e] : SABE) cin >> s >> a >> b >> e, a--, b--;
    dbg(SABE);

    constexpr int dim = 16;
    constexpr __int128 INF = 1LL << 60;
    auto solve = [&](int init, int c, lint k) {
        vector mat(dim, vector<__int128>(dim, INF));
        REP(w, dim) mat[w][w] = 0;
        for (auto [s, a, b, e] : SABE) {
            if (count(s.begin(), s.end(), (char)('A' + init))) {
                chmin<__int128>(mat[a][b], -e);
                chmin<__int128>(mat[b][a], -e);
            }
        }
        auto Mp = tropical_matrix(mat).pow(k);
        vector<__int128> ret(dim);
        REP(w, dim) ret[w] = -Mp[w][c];
        return ret;
    };

    vector<__int128> rets(dim);
    REP(w, W) {
        auto f = solve(w, C[w], K[w]);
        // dbg(f);
        REP(i, f.size()) {
            rets[i] += f[i];
            if (f[i] < -INF) rets[i] = -INF * 2;
            chmax(rets[i], -INF * 2);
        }
    }
    // dbg(rets);

    lint ret = *max_element(ALL(rets));
    cout << (ret >= -INF / 2 ? to_string(ret) : "Impossible") << '\n';
}
0