結果

問題 No.1494 LCS on Tree
ユーザー Aoxiang CuiAoxiang Cui
提出日時 2021-09-16 01:22:04
言語 C++14
(gcc 11.1.0 + boost 1.77.0)
結果
TLE  
実行時間 -
コード長 4,411 Byte
コンパイル時間 1,051 ms
使用メモリ 40,144 KB
最終ジャッジ日時 2021-09-16 01:22:18
合計ジャッジ時間 11,607 ms
ジャッジサーバーID
(参考情報)
judge13 / judge15
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 1 ms
4,976 KB
testcase_01 AC 1 ms
4,976 KB
testcase_02 AC 1 ms
4,976 KB
testcase_03 AC 246 ms
34,948 KB
testcase_04 AC 248 ms
35,048 KB
testcase_05 AC 282 ms
34,900 KB
testcase_06 AC 252 ms
34,976 KB
testcase_07 AC 244 ms
34,976 KB
testcase_08 AC 250 ms
35,048 KB
testcase_09 AC 249 ms
34,980 KB
testcase_10 AC 252 ms
34,972 KB
testcase_11 AC 269 ms
34,900 KB
testcase_12 AC 251 ms
34,896 KB
testcase_13 AC 180 ms
35,316 KB
testcase_14 AC 181 ms
35,164 KB
testcase_15 AC 182 ms
35,172 KB
testcase_16 AC 180 ms
35,244 KB
testcase_17 AC 182 ms
35,312 KB
testcase_18 AC 2 ms
7,024 KB
testcase_19 AC 1 ms
7,020 KB
testcase_20 AC 1 ms
4,976 KB
testcase_21 AC 1 ms
7,020 KB
testcase_22 AC 1 ms
7,024 KB
testcase_23 AC 1 ms
7,024 KB
testcase_24 AC 2 ms
4,976 KB
testcase_25 AC 1 ms
7,028 KB
testcase_26 AC 1 ms
4,976 KB
testcase_27 AC 2 ms
7,020 KB
testcase_28 AC 1 ms
4,976 KB
testcase_29 AC 194 ms
35,384 KB
testcase_30 AC 180 ms
35,240 KB
testcase_31 AC 182 ms
35,244 KB
testcase_32 AC 185 ms
35,312 KB
testcase_33 AC 183 ms
35,328 KB
testcase_34 AC 15 ms
7,024 KB
testcase_35 AC 76 ms
12,608 KB
testcase_36 AC 14 ms
4,976 KB
testcase_37 AC 58 ms
10,692 KB
testcase_38 AC 116 ms
17,552 KB
testcase_39 AC 37 ms
7,904 KB
testcase_40 AC 197 ms
26,528 KB
testcase_41 AC 40 ms
7,856 KB
testcase_42 AC 171 ms
24,224 KB
testcase_43 AC 120 ms
18,684 KB
testcase_44 TLE -
testcase_45 -- -
testcase_46 -- -
testcase_47 -- -
testcase_48 -- -
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: ラムダ関数内:
main.cpp:129:18: 警告: structured bindings only available with ‘-std=c++17’ or ‘-std=gnu++17’
  129 |       for (auto& [v, nc, nk] : a[u]) {
      |                  ^
main.cpp: 関数 ‘int main()’ 内:
main.cpp:142:16: 警告: structured bindings only available with ‘-std=c++17’ or ‘-std=gnu++17’
  142 |     for (auto& [y, z, k] : a[x]) {
      |                ^

ソースコード

diff #

#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

template <class T> auto vect(const T& v, int n) { return vector<T>(n, v); }
template <class T, class... D> auto vect(const T& v, int n, D... m) {
  return vector<decltype(vect(v, m...))>(n, vect(v, m...));
}

typedef long long int64;
typedef pair<int, int> ii;
#define SZ(x) (int)((x).size())
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }
// mt19937_64 mrand(random_device{}());
// int64 rnd(int64 x) { return mrand() % x; }
template <class T> void out(const vector<T>& a) { for (int i = 0; i < SZ(a); ++i) cout << a[i] << " \n"[i + 1 == SZ(a)]; }
template <class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template <class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
template <class T> void dedup(vector<T>& v) { sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); }
void add(int& x, int y) { x += y; if (x >= MOD) x -= MOD; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

int main() {
  int n;
  cin >> n;
  string s;
  cin >> s;
  int m = SZ(s);
  vector<vector<array<int, 3>>> a(n);
  for (int i = 0; i < n - 1; ++i) {
    int x, y, z;
    string t;
    cin >> x >> y >> t;
    z = t[0] - 'a';
    --x; --y;
    a[x].push_back({y, z, i});
    a[y].push_back({x, z, i + n - 1});
  }

  auto dp = vect<int>(-1, 2 * (n - 1), m);
  function<int(int, int, int, int, int)> solve =
    [&](int u, int parent, int c, int k, int pos) {
      if (pos == m) return 0;
      int& ret = dp[k][pos];
      if (ret >= 0) return ret;
      ret = s[pos] - 'a' == c ? 1 : 0;
      // move on tree
      for (auto& [v, nc, nk] : a[u]) {
        if (v == parent) continue;
        ckmax(ret, solve(v, u, nc, nk, pos));
        // move on both tree and string
        if (s[pos] - 'a' == c) ckmax(ret, solve(v, u, nc, nk, pos + 1) + 1);
      }
      // move on string
      ckmax(ret, solve(u, parent, c, k, pos + 1));
      return ret;
    };
  int ret = 0;
  for (int x = 0; x < n; ++x) {
    if (SZ(a[x]) > 1) continue;
    for (auto& [y, z, k] : a[x]) {
      int cur = solve(y, x, z, k, 0);
      ckmax(ret, cur);
    }
  }
  cout << ret << '\n';

  return 0;
}
0