結果

問題 No.1494 LCS on Tree
ユーザー rniyarniya
提出日時 2021-05-09 17:23:55
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 111 ms / 2,000 ms
コード長 5,886 bytes
コンパイル時間 2,447 ms
コンパイル使用メモリ 212,912 KB
実行使用メモリ 65,664 KB
最終ジャッジ日時 2024-11-20 15:07:43
合計ジャッジ時間 6,245 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 2 ms
6,820 KB
testcase_03 AC 108 ms
64,868 KB
testcase_04 AC 67 ms
34,944 KB
testcase_05 AC 66 ms
34,944 KB
testcase_06 AC 65 ms
34,944 KB
testcase_07 AC 65 ms
34,944 KB
testcase_08 AC 65 ms
35,072 KB
testcase_09 AC 66 ms
35,072 KB
testcase_10 AC 66 ms
34,944 KB
testcase_11 AC 67 ms
34,944 KB
testcase_12 AC 65 ms
35,072 KB
testcase_13 AC 65 ms
34,944 KB
testcase_14 AC 110 ms
65,664 KB
testcase_15 AC 110 ms
62,080 KB
testcase_16 AC 110 ms
51,072 KB
testcase_17 AC 110 ms
56,368 KB
testcase_18 AC 111 ms
54,144 KB
testcase_19 AC 2 ms
6,816 KB
testcase_20 AC 2 ms
6,816 KB
testcase_21 AC 2 ms
6,816 KB
testcase_22 AC 2 ms
6,816 KB
testcase_23 AC 2 ms
6,816 KB
testcase_24 AC 2 ms
6,816 KB
testcase_25 AC 2 ms
6,820 KB
testcase_26 AC 2 ms
6,820 KB
testcase_27 AC 2 ms
6,820 KB
testcase_28 AC 2 ms
6,816 KB
testcase_29 AC 2 ms
6,816 KB
testcase_30 AC 111 ms
65,024 KB
testcase_31 AC 109 ms
60,416 KB
testcase_32 AC 109 ms
52,828 KB
testcase_33 AC 109 ms
51,792 KB
testcase_34 AC 109 ms
51,968 KB
testcase_35 AC 5 ms
6,816 KB
testcase_36 AC 22 ms
12,544 KB
testcase_37 AC 5 ms
6,816 KB
testcase_38 AC 17 ms
10,752 KB
testcase_39 AC 32 ms
17,664 KB
testcase_40 AC 11 ms
7,936 KB
testcase_41 AC 49 ms
26,624 KB
testcase_42 AC 11 ms
7,808 KB
testcase_43 AC 43 ms
24,448 KB
testcase_44 AC 33 ms
18,688 KB
testcase_45 AC 64 ms
34,816 KB
testcase_46 AC 65 ms
34,688 KB
testcase_47 AC 65 ms
34,816 KB
testcase_48 AC 65 ms
34,688 KB
testcase_49 AC 63 ms
34,688 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(), (x).end()

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}
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, typename V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
    return os;
}
template <typename T, typename U, typename V, typename W> ostream& operator<<(ostream& os, const tuple<T, U, V, W>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}

void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {
    cerr << head;
    if (sizeof...(Tail) > 0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...)                                                                   \
    cerr << " ";                                                                     \
    cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \
    cerr << " ";                                                                     \
    debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
#pragma endregion

const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
const long long MOD = 1000000007;
// const long long MOD = 998244353;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    string S;
    cin >> N >> S;
    vector<vector<pair<int, char>>> G(N);
    for (int i = 0; i < N - 1; i++) {
        int u, v;
        char c;
        cin >> u >> v >> c;
        u--, v--;
        G[u].emplace_back(v, c);
        G[v].emplace_back(u, c);
    }

    int sz = S.size(), ans = 0;
    string T = S;
    reverse(T.begin(), T.end());
    vector<vector<int>> dp1(N, vector<int>(sz + 1, 0)),
        dp2(N,
            vector<int>(sz + 1,
                        0));  // vの部分木内のある頂点からvの親頂点に進む際のSの先頭i文字(もしくはその逆)とのLCSの大きさ
    auto dfs = [&](auto self, int v, int p) -> void {
        vector<int> Max1(sz + 1, 0), Max2(sz + 1, 0);
        for (auto& e : G[v]) {
            int u = e.first;
            if (u == p) continue;
            self(self, u, v);
            for (int i = sz - 1; i >= 0; i--) {
                dp1[u][i + 1] = max(dp1[u][i + 1], dp1[u][i] + (S[i] == e.second));
                dp2[u][i + 1] = max(dp2[u][i + 1], dp2[u][i] + (T[i] == e.second));
            }
            for (int i = 0; i < sz; i++) {
                dp1[u][i + 1] = max(dp1[u][i + 1], dp1[u][i]);
                dp2[u][i + 1] = max(dp2[u][i + 1], dp2[u][i]);
            }
            for (int i = 0; i <= sz; i++) {
                dp1[v][i] = max(dp1[v][i], dp1[u][i]);
                dp2[v][i] = max(dp2[v][i], dp2[u][i]);
            }
            for (int i = 0; i <= sz; i++) {
                ans = max(ans, dp1[u][i] + Max2[sz - i]);
                ans = max(ans, dp2[u][i] + Max1[sz - i]);
            }
            for (int i = 0; i <= sz; i++) {
                Max1[i] = max(Max1[i], dp1[u][i]);
                Max2[i] = max(Max2[i], dp2[u][i]);
            }
        }
    };

    dfs(dfs, 0, -1);
    cout << ans << '\n';
    return 0;
}
0