結果
問題 | No.1494 LCS on Tree |
ユーザー | fastmath |
提出日時 | 2021-04-30 22:10:03 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 114 ms / 2,000 ms |
コード長 | 3,560 bytes |
コンパイル時間 | 1,451 ms |
コンパイル使用メモリ | 135,316 KB |
実行使用メモリ | 66,592 KB |
最終ジャッジ日時 | 2023-08-12 22:40:36 |
合計ジャッジ時間 | 6,544 ms |
ジャッジサーバーID (参考情報) |
judge7 / judge9 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,384 KB |
testcase_01 | AC | 1 ms
4,384 KB |
testcase_02 | AC | 2 ms
4,384 KB |
testcase_03 | AC | 111 ms
66,388 KB |
testcase_04 | AC | 112 ms
66,232 KB |
testcase_05 | AC | 113 ms
66,248 KB |
testcase_06 | AC | 112 ms
66,248 KB |
testcase_07 | AC | 113 ms
66,252 KB |
testcase_08 | AC | 112 ms
66,284 KB |
testcase_09 | AC | 113 ms
66,432 KB |
testcase_10 | AC | 113 ms
66,296 KB |
testcase_11 | AC | 112 ms
66,344 KB |
testcase_12 | AC | 113 ms
66,232 KB |
testcase_13 | AC | 113 ms
66,268 KB |
testcase_14 | AC | 110 ms
66,356 KB |
testcase_15 | AC | 110 ms
66,400 KB |
testcase_16 | AC | 111 ms
66,296 KB |
testcase_17 | AC | 111 ms
66,592 KB |
testcase_18 | AC | 111 ms
66,300 KB |
testcase_19 | AC | 2 ms
4,380 KB |
testcase_20 | AC | 1 ms
4,384 KB |
testcase_21 | AC | 2 ms
4,380 KB |
testcase_22 | AC | 2 ms
4,384 KB |
testcase_23 | AC | 2 ms
4,384 KB |
testcase_24 | AC | 1 ms
4,380 KB |
testcase_25 | AC | 2 ms
4,384 KB |
testcase_26 | AC | 2 ms
4,388 KB |
testcase_27 | AC | 2 ms
4,384 KB |
testcase_28 | AC | 1 ms
4,380 KB |
testcase_29 | AC | 2 ms
4,384 KB |
testcase_30 | AC | 111 ms
66,384 KB |
testcase_31 | AC | 111 ms
66,436 KB |
testcase_32 | AC | 110 ms
66,332 KB |
testcase_33 | AC | 111 ms
66,528 KB |
testcase_34 | AC | 111 ms
66,340 KB |
testcase_35 | AC | 10 ms
9,484 KB |
testcase_36 | AC | 47 ms
34,208 KB |
testcase_37 | AC | 9 ms
7,760 KB |
testcase_38 | AC | 29 ms
18,836 KB |
testcase_39 | AC | 64 ms
44,072 KB |
testcase_40 | AC | 23 ms
16,804 KB |
testcase_41 | AC | 84 ms
52,008 KB |
testcase_42 | AC | 19 ms
13,272 KB |
testcase_43 | AC | 86 ms
57,596 KB |
testcase_44 | AC | 66 ms
45,600 KB |
testcase_45 | AC | 113 ms
66,272 KB |
testcase_46 | AC | 114 ms
66,220 KB |
testcase_47 | AC | 114 ms
66,344 KB |
testcase_48 | AC | 113 ms
66,228 KB |
testcase_49 | AC | 113 ms
66,232 KB |
ソースコード
#include <iostream> #include <cstdio> #include <cstdlib> #include <algorithm> #include <cmath> #include <vector> #include <set> #include <map> #include <unordered_set> #include <unordered_map> #include <queue> #include <ctime> #include <cassert> #include <complex> #include <string> #include <cstring> #include <chrono> #include <random> #include <bitset> #include <fstream> using namespace std; #define int long long #define ii pair <int, int> #define app push_back #define all(a) a.begin(), a.end() #define bp __builtin_popcountll #define ll long long #define mp make_pair #define x first #define y second #define Time (double)clock()/CLOCKS_PER_SEC #define debug(x) std::cerr << #x << ": " << x << '\n'; #define FOR(i, n) for (int i = 0; i < n; ++i) #define FORN(i, n) for (int i = 1; i <= n; ++i) #define pb push_back #define trav(a, x) for (auto& a : x) using vi = vector<int>; template <typename T> std::istream& operator >>(std::istream& input, std::vector<T>& data) { for (T& x : data) input >> x; return input; } template <typename T> std::ostream& operator <<(std::ostream& output, const pair <T, T> & data) { output << "(" << data.x << "," << data.y << ")"; return output; } template <typename T> std::ostream& operator <<(std::ostream& output, const std::vector<T>& data) { for (const T& x : data) output << x << " "; return output; } ll div_up(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up ll div_down(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down ll math_mod(ll a, ll b) { return a - b * div_down(a, b); } #define tcT template<class T #define tcTU tcT, class U tcT> using V = vector<T>; tcT> void re(V<T>& x) { trav(a, x) cin >> a; } tcT> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } // set a = min(a,b) tcT> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } ll gcd(ll a, ll b) { while (b) { tie(a, b) = mp(b, a % b); } return a; } const int N = 2007; int pref[N][N], suf[N][N]; int n, len; string s; V <pair <int, char> > g[N]; int ans = 0; void dfs(int u, int p, char c) { trav (e, g[u]) { int v = e.x; char go = e.y; if (v != p) { dfs(v, u, go); FOR (i, len + 1) { ckmax(ans, pref[u][i] + suf[v][len - i]); ckmax(ans, pref[v][i] + suf[u][len - i]); } FOR (i, len + 1) { ckmax(pref[u][i], pref[v][i]); ckmax(suf[u][i], suf[v][i]); } } } if (u != 1) { for (int i = len - 1; i >= 0; --i) { if (s[i] == c) { ckmax(pref[u][i + 1], pref[u][i] + 1); } } FOR (i, len) { ckmax(pref[u][i + 1], pref[u][i]); } for (int i = len - 1; i >= 0; --i) { int p = len - 1 - i; if (s[p] == c) { ckmax(suf[u][i + 1], suf[u][i] + 1); } } FOR (i, len) { ckmax(suf[u][i + 1], suf[u][i]); } } FOR (i, len + 1) { ckmax(ans, pref[u][i]); ckmax(ans, suf[u][i]); } } signed main() { #ifdef LOCAL #else #define endl '\n' ios_base::sync_with_stdio(0); cin.tie(0); #endif cin >> n; cin >> s; len = s.size(); FOR (i, n - 1) { int u, v; char c; cin >> u >> v >> c; g[u].app(mp(v, c)); g[v].app(mp(u, c)); } dfs(1, 1, 0); cout << ans << endl; }