#723037 (C++17) No.1780 [Cherry Anniversary] 真冬に咲く26の櫻の木

提出ソース

結果

問題	No.1780 [Cherry Anniversary] 真冬に咲く26の櫻の木
ユーザー	NyaanNyaan
提出日時	2021-12-09 00:27:09
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	160 ms / 2,000 ms
コード長	13,883 bytes
コンパイル時間	2,685 ms
コンパイル使用メモリ	263,108 KB
実行使用メモリ	18,684 KB
最終ジャッジ日時	2024-07-16 11:27:01
合計ジャッジ時間	6,193 ms
ジャッジサーバーID （参考情報）	judge4 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	4 ms 5,376 KB
testcase_03	AC	4 ms 5,376 KB
testcase_04	AC	5 ms 5,376 KB
testcase_05	AC	5 ms 5,376 KB
testcase_06	AC	5 ms 5,376 KB
testcase_07	AC	5 ms 5,376 KB
testcase_08	AC	5 ms 5,376 KB
testcase_09	AC	5 ms 5,376 KB
testcase_10	AC	5 ms 5,376 KB
testcase_11	AC	5 ms 5,376 KB
testcase_12	AC	4 ms 5,376 KB
testcase_13	AC	4 ms 5,376 KB
testcase_14	AC	34 ms 5,632 KB
testcase_15	AC	125 ms 14,592 KB
testcase_16	AC	120 ms 14,416 KB
testcase_17	AC	25 ms 5,376 KB
testcase_18	AC	77 ms 10,112 KB
testcase_19	AC	30 ms 5,376 KB
testcase_20	AC	91 ms 11,392 KB
testcase_21	AC	153 ms 17,880 KB
testcase_22	AC	151 ms 18,048 KB
testcase_23	AC	42 ms 6,656 KB
testcase_24	AC	160 ms 18,684 KB
testcase_25	AC	39 ms 6,144 KB
testcase_26	AC	32 ms 5,376 KB
testcase_27	AC	79 ms 10,240 KB
testcase_28	AC	21 ms 5,376 KB
testcase_29	AC	19 ms 5,376 KB
testcase_30	AC	147 ms 17,280 KB
testcase_31	AC	13 ms 5,376 KB
testcase_32	AC	17 ms 5,376 KB
testcase_33	AC	68 ms 9,216 KB
testcase_34	AC	2 ms 5,376 KB
testcase_35	AC	7 ms 5,376 KB
testcase_36	AC	2 ms 5,376 KB
testcase_37	AC	7 ms 5,376 KB
testcase_38	AC	11 ms 5,376 KB
testcase_39	AC	11 ms 5,376 KB
testcase_40	AC	9 ms 5,376 KB
testcase_41	AC	10 ms 5,376 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

/**
 *  date : 2021-12-09 00:27:03
 */

#define NDEBUG
using namespace std;

// intrinstic
#include <immintrin.h>

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdarg>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <streambuf>
#include <string>
#include <tuple>
#include <type_traits>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

// utility
namespace Nyaan {
using ll = long long;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;

template <typename T>
using V = vector<T>;
template <typename T>
using VV = vector<vector<T>>;
using vi = vector<int>;
using vl = vector<long long>;
using vd = V<double>;
using vs = V<string>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<long long>>;

template <typename T, typename U>
struct P : pair<T, U> {
  template <typename... Args>
  P(Args... args) : pair<T, U>(args...) {}

  using pair<T, U>::first;
  using pair<T, U>::second;

  T &x() { return first; }
  const T &x() const { return first; }
  U &y() { return second; }
  const U &y() const { return second; }

  P &operator+=(const P &r) {
    first += r.first;
    second += r.second;
    return *this;
  }
  P &operator-=(const P &r) {
    first -= r.first;
    second -= r.second;
    return *this;
  }
  P &operator*=(const P &r) {
    first *= r.first;
    second *= r.second;
    return *this;
  }
  P operator+(const P &r) const { return P(*this) += r; }
  P operator-(const P &r) const { return P(*this) -= r; }

  P operator*(const P &r) const { return P(*this) *= r; }

  P operator*(int r) const { return {first * r, second * r}; }

  P operator-() const { return P{-first, -second}; }
};

using pl = P<ll, ll>;
using pi = P<int, int>;
using vp = V<pl>;

constexpr int inf = 1001001001;
constexpr long long infLL = 4004004004004004004LL;

template <typename T>
int sz(const T &t) {
  return t.size();
}

template <typename T, typename U>
inline bool amin(T &x, U y) {
  return (y < x) ? (x = y, true) : false;
}
template <typename T, typename U>
inline bool amax(T &x, U y) {
  return (x < y) ? (x = y, true) : false;
}

template <typename T>
inline T Max(const vector<T> &v) {
  return *max_element(begin(v), end(v));
}
template <typename T>
inline T Min(const vector<T> &v) {
  return *min_element(begin(v), end(v));
}
template <typename T>
inline long long Sum(const vector<T> &v) {
  return accumulate(begin(v), end(v), 0LL);
}

template <typename T>
int lb(const vector<T> &v, const T &a) {
  return lower_bound(begin(v), end(v), a) - begin(v);
}
template <typename T>
int ub(const vector<T> &v, const T &a) {
  return upper_bound(begin(v), end(v), a) - begin(v);
}

constexpr long long TEN(int n) {
  long long ret = 1, x = 10;
  for (; n; x *= x, n >>= 1) ret *= (n & 1 ? x : 1);
  return ret;
}

template <typename T, typename U>
pair<T, U> mkp(const T &t, const U &u) {
  return make_pair(t, u);
}

template <typename T>
vector<T> mkrui(const vector<T> &v, bool rev = false) {
  vector<T> ret(v.size() + 1);
  if (rev) {
    for (int i = int(v.size()) - 1; i >= 0; i--) ret[i] = v[i] + ret[i + 1];
  } else {
    for (int i = 0; i < int(v.size()); i++) ret[i + 1] = ret[i] + v[i];
  }
  return ret;
};

template <typename T>
vector<T> mkuni(const vector<T> &v) {
  vector<T> ret(v);
  sort(ret.begin(), ret.end());
  ret.erase(unique(ret.begin(), ret.end()), ret.end());
  return ret;
}

template <typename F>
vector<int> mkord(int N, F f) {
  vector<int> ord(N);
  iota(begin(ord), end(ord), 0);
  sort(begin(ord), end(ord), f);
  return ord;
}

template <typename T>
vector<int> mkinv(vector<T> &v) {
  int max_val = *max_element(begin(v), end(v));
  vector<int> inv(max_val + 1, -1);
  for (int i = 0; i < (int)v.size(); i++) inv[v[i]] = i;
  return inv;
}

}  // namespace Nyaan

// bit operation
namespace Nyaan {
__attribute__((target("popcnt"))) inline int popcnt(const u64 &a) {
  return _mm_popcnt_u64(a);
}
inline int lsb(const u64 &a) { return a ? __builtin_ctzll(a) : 64; }
inline int ctz(const u64 &a) { return a ? __builtin_ctzll(a) : 64; }
inline int msb(const u64 &a) { return a ? 63 - __builtin_clzll(a) : -1; }
template <typename T>
inline int gbit(const T &a, int i) {
  return (a >> i) & 1;
}
template <typename T>
inline void sbit(T &a, int i, bool b) {
  if (gbit(a, i) != b) a ^= T(1) << i;
}
constexpr long long PW(int n) { return 1LL << n; }
constexpr long long MSK(int n) { return (1LL << n) - 1; }
}  // namespace Nyaan

// inout
namespace Nyaan {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  os << p.first << " " << p.second;
  return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
  is >> p.first >> p.second;
  return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  int s = (int)v.size();
  for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
  return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (auto &x : v) is >> x;
  return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &... u) {
  cin >> t;
  in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &... u) {
  cout << t;
  if (sizeof...(u)) cout << sep;
  out(u...);
}

void outr() {}
template <typename T, class... U, char sep = ' '>
void outr(const T &t, const U &... u) {
  cout << t;
  outr(u...);
}

struct IoSetupNya {
  IoSetupNya() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);
    cerr << fixed << setprecision(7);
  }
} iosetupnya;

}  // namespace Nyaan

// debug
namespace DebugImpl {

template <typename U, typename = void>
struct is_specialize : false_type {};
template <typename U>
struct is_specialize<
    U, typename conditional<false, typename U::iterator, void>::type>
    : true_type {};
template <typename U>
struct is_specialize<
    U, typename conditional<false, decltype(U::first), void>::type>
    : true_type {};
template <typename U>
struct is_specialize<U, enable_if_t<is_integral<U>::value, void>> : true_type {
};

void dump(const char& t) { cerr << t; }

void dump(const string& t) { cerr << t; }

void dump(const bool& t) { cerr << (t ? "true" : "false"); }

template <typename U,
          enable_if_t<!is_specialize<U>::value, nullptr_t> = nullptr>
void dump(const U& t) {
  cerr << t;
}

template <typename T>
void dump(const T& t, enable_if_t<is_integral<T>::value>* = nullptr) {
  string res;
  if (t == Nyaan::inf) res = "inf";
  if constexpr (is_signed<T>::value) {
    if (t == -Nyaan::inf) res = "-inf";
  }
  if constexpr (sizeof(T) == 8) {
    if (t == Nyaan::infLL) res = "inf";
    if constexpr (is_signed<T>::value) {
      if (t == -Nyaan::infLL) res = "-inf";
    }
  }
  if (res.empty()) res = to_string(t);
  cerr << res;
}

template <typename T, typename U>
void dump(const pair<T, U>&);
template <typename T>
void dump(const pair<T*, int>&);

template <typename T>
void dump(const T& t,
          enable_if_t<!is_void<typename T::iterator>::value>* = nullptr) {
  cerr << "[ ";
  for (auto it = t.begin(); it != t.end();) {
    dump(*it);
    cerr << (++it == t.end() ? "" : ", ");
  }
  cerr << " ]";
}

template <typename T, typename U>
void dump(const pair<T, U>& t) {
  cerr << "( ";
  dump(t.first);
  cerr << ", ";
  dump(t.second);
  cerr << " )";
}

template <typename T>
void dump(const pair<T*, int>& t) {
  cerr << "[ ";
  for (int i = 0; i < t.second; i++) {
    dump(t.first[i]);
    cerr << (i == t.second - 1 ? "" : ", ");
  }
  cerr << " ]";
}

void trace() { cerr << endl; }
template <typename Head, typename... Tail>
void trace(Head&& head, Tail&&... tail) {
  cerr << " ";
  dump(head);
  if (sizeof...(tail) != 0) cerr << ",";
  trace(forward<Tail>(tail)...);
}

}  // namespace DebugImpl

#ifdef NyaanDebug
#define trc(...)                            \
  do {                                      \
    cerr << "## " << #__VA_ARGS__ << " = "; \
    DebugImpl::trace(__VA_ARGS__);          \
  } while (0)
#else
#define trc(...) (void(0))
#endif

// macro
#define each(x, v) for (auto&& x : v)
#define each2(x, y, v) for (auto&& [x, y] : v)
#define all(v) (v).begin(), (v).end()
#define rep(i, N) for (long long i = 0; i < (long long)(N); i++)
#define repr(i, N) for (long long i = (long long)(N)-1; i >= 0; i--)
#define rep1(i, N) for (long long i = 1; i <= (long long)(N); i++)
#define repr1(i, N) for (long long i = (N); (long long)(i) > 0; i--)
#define reg(i, a, b) for (long long i = (a); i < (b); i++)
#define regr(i, a, b) for (long long i = (b)-1; i >= (a); i--)
#define fi first
#define se second
#define ini(...)   \
  int __VA_ARGS__; \
  in(__VA_ARGS__)
#define inl(...)         \
  long long __VA_ARGS__; \
  in(__VA_ARGS__)
#define ins(...)      \
  string __VA_ARGS__; \
  in(__VA_ARGS__)
#define in2(s, t)                           \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i]);                         \
  }
#define in3(s, t, u)                        \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i], u[i]);                   \
  }
#define in4(s, t, u, v)                     \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i], u[i], v[i]);             \
  }
#define die(...)             \
  do {                       \
    Nyaan::out(__VA_ARGS__); \
    return;                  \
  } while (0)

namespace Nyaan {
void solve();
}
int main() { Nyaan::solve(); }

//

template <typename T, T (*add)(T, T), T (*mul)(T, T), T (*I0)(), T (*I1)()>
struct semiring {
  T x;
  semiring() : x(I0()) {}
  semiring(T y) : x(y) {}
  static T id0() { return I0(); }
  static T id1() { return I1(); }

  semiring &operator+=(const semiring &p) {
    if (x == I0()) return *this = p;
    if (p.x == I0()) return *this;
    return *this = add(x, p.x);
  }

  semiring &operator*=(const semiring &p) {
    if (x == I0() || p.x == I0()) return *this = I0();
    if (x == I1()) return *this = p;
    if (p.x == I1()) return *this;
    return *this = mul(x, p.x);
  }

  semiring operator+(const semiring &p) const { return semiring(*this) += p; }
  semiring operator*(const semiring &p) const { return semiring(*this) *= p; }
  bool operator==(const semiring &p) const { return x == p.x; }
  bool operator!=(const semiring &p) const { return x != p.x; }
  friend ostream &operator<<(ostream &os, const semiring &p) {
    return os << p.x;
  }
};

template <typename rig, int N>
struct Mat {
  using Array = array<array<rig, N>, N>;
  Array A;

  Mat() {
    for (int i = 0; i < N; i++) A[i].fill(rig::id0());
  }
  int height() const { return N; }
  int width() const { return N; }
  inline const array<rig, N> &operator[](int k) const { return A[k]; }
  inline array<rig, N> &operator[](int k) { return A[k]; }

  static Mat I() {
    Mat m;
    for (int i = 0; i < N; i++) m[i][i] = rig::id1();
    return m;
  }

  Mat &operator+=(const Mat &B) {
    for (int i = 0; i < N; i++)
      for (int j = 0; j < N; j++) A[i][j] += B[i][j];
    return (*this);
  }

  Mat &operator*=(const Mat &B) {
    Mat C;
    for (int i = 0; i < N; i++)
      for (int k = 0; k < N; k++)
        for (int j = 0; j < N; j++) C[i][j] += A[i][k] * B[k][j];
    A.swap(C.A);
    return (*this);
  }

  Mat &operator^=(long long k) {
    Mat B = Mat::I();
    for (; k; *this *= *this, k >>= 1)
      if (k & 1) B *= *this;
    A.swap(B.A);
    return (*this);
  }

  Mat operator+(const Mat &B) const { return (Mat(*this) += B); }
  Mat operator*(const Mat &B) const { return (Mat(*this) *= B); }
  Mat operator^(long long k) const { return (Mat(*this) ^= k); }

  friend ostream &operator<<(ostream &os, Mat &p) {
    for (int i = 0; i < N; i++) {
      os << "[";
      for (int j = 0; j < N; j++) {
        os << p[i][j].x << (j == N - 1 ? "]\n" : ",");
      }
    }
    return (os);
  }
};

/**
 * @brief 半環ライブラリ
 * @docs docs/math/semiring.md
 */


using namespace Nyaan;

using U = long long;
U add(U a, U b) { return max(a, b); }
U mul(U a, U b) {
  U res = a + b;
  if (res < -infLL) res = -infLL;
  return res;
}
U i0() { return -infLL; }
U i1() { return 0; }
using rig = semiring<U, add, mul, i0, i1>;
using M = Mat<rig, 16>;

void Nyaan::solve() {
  vl C(26), K(26);
  in(C, K);
  inl(N);
  vs S(N);
  vl A(N), B(N), E(N);
  in4(S, A, B, E);

  each(x, C)-- x;
  each(x, A)-- x;
  each(x, B)-- x;

  vvl memo(26, vl(16, -infLL));

  rep(col, 26) {
    M mat;
    rep(i, 16) mat[i][i] = 0;
    rep(i, N) {
      if (S[i].find('A' + col) != string::npos) {
        int a = A[i], b = B[i], e = E[i];
        if (mat[a][b] == i0()) {
          mat[a][b] = e;
        } else {
          amax(mat[a][b].x, e);
        }
        swap(a, b);
        if (mat[a][b] == i0()) {
          mat[a][b] = e;
        } else {
          amax(mat[a][b].x, e);
        }
      }
    }
    mat ^= K[col];
    rep(i, 16) memo[col][i] = mat[C[col]][i].x;
    trc(memo[col]);
  }

  ll ans = -infLL;
  rep(c, 16) {
    ll sm = 0;
    rep(i, 26) {
      sm += memo[i][c];
      if (sm < -infLL) sm = -infLL;
    }
    amax(ans, sm);
  }
  if (ans < -TEN(18)) die("Impossible");
  out(ans);
}

yukicoder

結果

テストケース

ソースコード