#652661 (C++17) No.1494 LCS on Tree

提出ソース

結果

問題	No.1494 LCS on Tree
ユーザー	hitonanode
提出日時	2021-04-30 22:00:56
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	5,637 bytes
コンパイル時間	2,259 ms
コンパイル使用メモリ	215,416 KB
実行使用メモリ	35,456 KB
最終ジャッジ日時	2024-07-19 01:27:14
合計ジャッジ時間	5,606 ms
ジャッジサーバーID （参考情報）	judge5 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
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	72 ms 35,328 KB
testcase_04	AC	70 ms 34,816 KB
testcase_05	AC	70 ms 34,816 KB
testcase_06	AC	74 ms 34,688 KB
testcase_07	AC	70 ms 34,816 KB
testcase_08	AC	70 ms 34,816 KB
testcase_09	AC	72 ms 34,816 KB
testcase_10	AC	70 ms 34,688 KB
testcase_11	AC	71 ms 34,688 KB
testcase_12	AC	70 ms 34,688 KB
testcase_13	AC	70 ms 34,688 KB
testcase_14	AC	70 ms 35,328 KB
testcase_15	AC	70 ms 35,200 KB
testcase_16	AC	71 ms 35,072 KB
testcase_17	AC	71 ms 35,072 KB
testcase_18	AC	71 ms 35,072 KB
testcase_19	AC	2 ms 5,376 KB
testcase_20	AC	2 ms 5,376 KB
testcase_21	AC	2 ms 5,376 KB
testcase_22	AC	2 ms 5,376 KB
testcase_23	AC	2 ms 5,376 KB
testcase_24	AC	2 ms 5,376 KB
testcase_25	AC	2 ms 5,376 KB
testcase_26	AC	2 ms 5,376 KB
testcase_27	AC	2 ms 5,376 KB
testcase_28	AC	2 ms 5,376 KB
testcase_29	AC	2 ms 5,376 KB
testcase_30	AC	70 ms 35,456 KB
testcase_31	AC	70 ms 35,200 KB
testcase_32	AC	70 ms 35,072 KB
testcase_33	AC	71 ms 35,072 KB
testcase_34	AC	70 ms 35,200 KB
testcase_35	WA	-
testcase_36	WA	-
testcase_37	AC	5 ms 5,376 KB
testcase_38	AC	18 ms 10,624 KB
testcase_39	WA	-
testcase_40	WA	-
testcase_41	AC	51 ms 26,368 KB
testcase_42	AC	11 ms 7,680 KB
testcase_43	AC	47 ms 24,064 KB
testcase_44	AC	36 ms 18,432 KB
testcase_45	AC	64 ms 34,688 KB
testcase_46	AC	64 ms 34,816 KB
testcase_47	AC	65 ms 34,688 KB
testcase_48	AC	64 ms 34,688 KB
testcase_49	AC	64 ms 34,816 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
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) { if (m < q) {m = q; return true;} else return false; }
template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return 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> 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) { 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
#else
#define dbg(x) (x)
#endif

int main() {
    int N;
    string S;
    cin >> N >> S;
    string T = S;
    reverse(ALL(T));
    vector<vector<pair<int, char>>> to(N);
    REP(i, N - 1) {
        int u, v;
        char c;
        cin >> u >> v >> c;
        u--, v--;
        to[u].emplace_back(v, c);
        to[v].emplace_back(u, c);
    }

    int ret = 0;
    vector<vector<int>> v1(N);
    vector<vector<int>> v2(N);
    auto dfs1 = [&](auto self, int now, int prv) -> void {
        vector<int> ret1(S.size() + 1);
        vector<int> ret2(S.size() + 1);
        for (auto [nxt, w] : to[now]) {
            if (nxt == prv) continue;
            self(self, nxt, now);

            vector<int> hi1 = v1[nxt];
            vector<int> hi2 = v2[nxt];
            IREP(i, S.size()) if (S[i] == w) chmax(hi1[i + 1], hi1[i] + 1);
            IREP(i, S.size()) if (T[i] == w) chmax(hi2[i + 1], hi2[i] + 1);

            REP(j, ret1.size()) chmax(ret, ret1[j] + hi2[S.size() - j]);
            REP(j, ret2.size()) chmax(ret, ret2[j] + hi1[S.size() - j]);
            REP(i, ret1.size()) chmax(ret1[i], hi1[i]);
            REP(i, ret2.size()) chmax(ret2[i], hi2[i]);
        }
        REP(i, ret1.size() - 1) chmax(ret1[i + 1], ret1[i]);
        REP(i, ret2.size() - 1) chmax(ret2[i + 1], ret2[i]);
        chmax(ret, *max_element(ALL(ret1)));
        chmax(ret, *max_element(ALL(ret2)));
        v1[now] = ret1;
        v2[now] = ret2;
    };
    dfs1(dfs1, 0, -1);
    cout << ret << '\n';
}

yukicoder

結果

テストケース

ソースコード