結果

問題 No.1494 LCS on Tree
ユーザー leaf_1415leaf_1415
提出日時 2021-04-30 22:10:42
言語 C++11
(gcc 11.4.0)
結果
TLE  
実行時間 -
コード長 5,991 bytes
コンパイル時間 767 ms
コンパイル使用メモリ 89,196 KB
実行使用メモリ 41,776 KB
最終ジャッジ日時 2024-07-19 01:35:54
合計ジャッジ時間 17,593 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
10,752 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 1 ms
5,376 KB
testcase_03 AC 442 ms
35,200 KB
testcase_04 AC 671 ms
34,944 KB
testcase_05 AC 646 ms
35,036 KB
testcase_06 AC 656 ms
35,048 KB
testcase_07 AC 646 ms
35,044 KB
testcase_08 AC 634 ms
35,072 KB
testcase_09 AC 641 ms
35,072 KB
testcase_10 AC 656 ms
35,020 KB
testcase_11 AC 668 ms
35,072 KB
testcase_12 AC 634 ms
35,072 KB
testcase_13 AC 662 ms
35,060 KB
testcase_14 AC 325 ms
35,328 KB
testcase_15 AC 331 ms
35,200 KB
testcase_16 AC 328 ms
35,092 KB
testcase_17 AC 331 ms
35,172 KB
testcase_18 AC 337 ms
35,200 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 1 ms
5,376 KB
testcase_25 AC 2 ms
5,376 KB
testcase_26 AC 1 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 442 ms
35,272 KB
testcase_31 AC 446 ms
35,112 KB
testcase_32 AC 436 ms
35,200 KB
testcase_33 AC 454 ms
35,212 KB
testcase_34 AC 454 ms
35,200 KB
testcase_35 AC 17 ms
7,552 KB
testcase_36 AC 117 ms
15,232 KB
testcase_37 AC 20 ms
11,392 KB
testcase_38 AC 89 ms
18,560 KB
testcase_39 AC 219 ms
21,504 KB
testcase_40 AC 52 ms
12,544 KB
testcase_41 AC 419 ms
33,664 KB
testcase_42 AC 52 ms
15,488 KB
testcase_43 AC 361 ms
27,776 KB
testcase_44 AC 218 ms
23,472 KB
testcase_45 TLE -
testcase_46 -- -
testcase_47 -- -
testcase_48 -- -
testcase_49 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define per(x, s, t) for(llint (x) = (s); (x) >= (t); (x)--)
#define reps(x, s) for(llint (x) = 0; (x) < (llint)(s).size(); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define sz(x) ((ll)(x).size())
#define ceil(x, y) (((x)+(y)-1) / (y))
#define all(x) (x).begin(),(x).end()
#define outl(...) dump_func(__VA_ARGS__)
#define inf 1e18

using namespace std;

typedef long long llint;
typedef int ll;
typedef pair<ll, ll> P;

struct edge{
	ll to, id; char c;
	edge(){}
	edge(ll a, ll b, char c){ to = a, id = b; this->c = c;}
};
const ll dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};

const ll mod = 1000000007;
//const ll mod = 998244353;

struct mint{
	ll x = 0;
	mint(ll y = 0){x = y; if(x < 0 || x >= mod) x = (x%mod+mod)%mod;}
	mint(const mint &ope) {x = ope.x;}
	
	mint operator-(){return mint(-x);}
	mint operator+(const mint &ope){return mint(x) += ope;}
	mint operator-(const mint &ope){return mint(x) -= ope;}
	mint operator*(const mint &ope){return mint(x) *= ope;}
	mint operator/(const mint &ope){return mint(x) /= ope;}
	mint& operator+=(const mint &ope){
		x += ope.x;
		if(x >= mod) x -= mod;
		return *this;
	}
	mint& operator-=(const mint &ope){
		x += mod - ope.x;
		if(x >= mod) x -= mod;
		return *this;
	}
	mint& operator*=(const mint &ope){
		x *= ope.x, x %= mod;
		return *this;
	}
	mint& operator/=(const mint &ope){
		ll n = mod-2; mint mul = ope;
		while(n){
			if(n & 1) *this *= mul;
			mul *= mul;
			n >>= 1;
		}
		return *this;
	}
	mint inverse(){return mint(1) / *this;}
	bool operator ==(const mint &ope){return x == ope.x;}
	bool operator !=(const mint &ope){return x != ope.x;}
};
mint modpow(mint a, ll n){
	if(n == 0) return mint(1);
	if(n % 2) return a * modpow(a, n-1);
	else return modpow(a*a, n/2);
}
istream& operator >>(istream &is, mint &ope){
	ll t; is >> t, ope.x = t;
	return is;
}
ostream& operator <<(ostream &os, mint &ope){return os << ope.x;}
ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;}

bool exceed(ll x, ll y, ll m){return x >= m / y + 1;}
void mark(){ cout << "*" << endl; }
void yes(){ cout << "YES" << endl; }
void no(){ cout << "NO" << endl; }
ll sgn(ll x){ if(x > 0) return 1; if(x < 0) return -1; return 0;}
ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);}
ll lcm(ll a, ll b){return a/gcd(a, b)*b;}
ll digitnum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret++; return ret;}
ll digitsum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret += x % b; return ret;}
string lltos(ll x){string ret; for(;x;x/=10) ret += x % 10 + '0'; reverse(ret.begin(), ret.end()); return ret;}
ll stoll(string &s){ll ret = 0; for(auto c : s) ret *= 10, ret += c - '0'; return ret;}
template<typename T>
void uniq(T &vec){ sort(vec.begin(), vec.end()); vec.erase(unique(vec.begin(), vec.end()), vec.end());}

template<typename T>
ostream& operator << (ostream& os, vector<T>& vec) {
	for(int i = 0; i < vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : " ");
	return os;
}
template<typename T>
ostream& operator << (ostream& os, deque<T>& deq) {
	for(int i = 0; i < deq.size(); i++) os << deq[i] << (i + 1 == deq.size() ? "" : " ");
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, pair<T, U>& pair_var) {
	os << "(" << pair_var.first << ", " << pair_var.second << ")";
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, const pair<T, U>& pair_var) {
	os << "(" << pair_var.first << ", " << pair_var.second << ")";
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, map<T, U>& map_var) {
	for(typename map<T, U>::iterator itr = map_var.begin(); itr != map_var.end(); itr++) {
		os << "(" << itr->first << ", " << itr->second << ")";
		itr++; if(itr != map_var.end()) os << ","; itr--;
	}
	return os;
}
template<typename T>
ostream& operator << (ostream& os, set<T>& set_var) {
	for(typename set<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {
		os << *itr; ++itr; if(itr != set_var.end()) os << " "; itr--;
	}
	return os;
}
template<typename T>
ostream& operator << (ostream& os, multiset<T>& set_var) {
	for(typename multiset<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {
		os << *itr; ++itr; if(itr != set_var.end()) os << " "; itr--;
	}
	return os;
}
template<typename T>
void outa(T a[], ll s, ll t){
	for(ll i = s; i <= t; i++){ cout << a[i]; if(i < t) cout << " ";}
	cout << endl;
}
void dump_func() {cout << endl;}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail) {
	cout << head;
	if(sizeof...(Tail) > 0) cout << " ";
	dump_func(std::move(tail)...);
}

ll n, S;
vector<edge> G[2005];
ll t[2005][2];
int memo[2005][2005][2];
string s;

ll dfs(int v, int eid, int dir, int pos)
{
	if(memo[pos][eid][dir] != -1) return memo[pos][eid][dir];
	if(pos == S) return 0;
	
	ll ret = 0;
	if(pos < S) ret = dfs(v, eid, dir, pos+1);
	
	ll p = t[eid][1-dir];
	for(auto e : G[v]){
		ll u = e.to, id = e.id, d = 0;
		if(u == p) continue;
		if(t[id][0] == v) d = 1;
		if(e.c == s[pos+1]) chmax(ret, dfs(u, id, d, pos+1)+1);
		else chmax(ret, dfs(u, id, d, pos));
	}
	
	if(eid) memo[pos][eid][dir] = ret;
	return ret;
}

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> s;
	S = sz(s);
	s = "#" + s;
	
	ll u, v; char c;
	rep(i, 1, n-1){
		cin >> u >> v >> c;
		G[u].push_back(edge(v, i, c));
		G[v].push_back(edge(u, i, c));
		t[i][0] = u, t[i][1] = v;
	}
	
	rep(i, 0, S) rep(j, 0, n) rep(k, 0, 1) memo[i][j][k] = -1;
	
	ll ans = 0;
	rep(i, 1, n) chmax(ans, dfs(i, 0, 0, 0));
	outl(ans);
	
	return 0;
}
0