#652787 (C++11) No.1494 LCS on Tree

提出ソース

結果

問題	No.1494 LCS on Tree
ユーザー	leaf_1415
提出日時	2021-04-30 22:32:28
言語	C++11 (gcc 11.4.0)
結果	AC
実行時間	414 ms / 2,000 ms
コード長	6,971 bytes
コンパイル時間	1,490 ms
コンパイル使用メモリ	89,864 KB
実行使用メモリ	66,396 KB
最終ジャッジ日時	2024-11-20 14:58:48
合計ジャッジ時間	11,806 ms
ジャッジサーバーID （参考情報）	judge2 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,248 KB
testcase_02	AC	2 ms 5,248 KB
testcase_03	AC	343 ms 66,272 KB
testcase_04	AC	405 ms 66,176 KB
testcase_05	AC	414 ms 66,176 KB
testcase_06	AC	414 ms 66,176 KB
testcase_07	AC	408 ms 66,252 KB
testcase_08	AC	408 ms 66,176 KB
testcase_09	AC	404 ms 66,176 KB
testcase_10	AC	408 ms 66,148 KB
testcase_11	AC	400 ms 66,176 KB
testcase_12	AC	398 ms 66,168 KB
testcase_13	AC	399 ms 66,176 KB
testcase_14	AC	281 ms 66,304 KB
testcase_15	AC	279 ms 66,304 KB
testcase_16	AC	285 ms 66,196 KB
testcase_17	AC	283 ms 66,292 KB
testcase_18	AC	283 ms 66,148 KB
testcase_19	AC	2 ms 5,248 KB
testcase_20	AC	2 ms 5,248 KB
testcase_21	AC	1 ms 5,248 KB
testcase_22	AC	1 ms 5,248 KB
testcase_23	AC	2 ms 5,248 KB
testcase_24	AC	1 ms 5,248 KB
testcase_25	AC	1 ms 5,248 KB
testcase_26	AC	2 ms 5,248 KB
testcase_27	AC	2 ms 5,248 KB
testcase_28	AC	1 ms 5,248 KB
testcase_29	AC	2 ms 5,248 KB
testcase_30	AC	339 ms 66,372 KB
testcase_31	AC	349 ms 66,396 KB
testcase_32	AC	344 ms 66,272 KB
testcase_33	AC	341 ms 66,304 KB
testcase_34	AC	341 ms 66,304 KB
testcase_35	AC	17 ms 11,520 KB
testcase_36	AC	111 ms 26,368 KB
testcase_37	AC	20 ms 18,944 KB
testcase_38	AC	73 ms 33,152 KB
testcase_39	AC	168 ms 38,912 KB
testcase_40	AC	44 ms 21,248 KB
testcase_41	AC	281 ms 63,232 KB
testcase_42	AC	42 ms 27,136 KB
testcase_43	AC	249 ms 51,584 KB
testcase_44	AC	186 ms 43,136 KB
testcase_45	AC	237 ms 66,152 KB
testcase_46	AC	228 ms 66,176 KB
testcase_47	AC	231 ms 66,176 KB
testcase_48	AC	227 ms 66,176 KB
testcase_49	AC	227 ms 66,176 KB

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

ソースコード

raw source code

#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 long long ll;
typedef pair<ll, ll> P;

struct edge{
	ll to, cost;
	edge(){}
	edge(ll a, ll b){ to = a, cost = b;}
};
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];
string s;

int parent[2005];
llint dp[2005][2005], dp2[2005][2005];

const llint e = 0; //
llint ope(llint a, llint b)
{
	return max(a, b); //
}

llint get(int u, int v, int q)
{
	if(parent[u] == v) return dp2[q][u];
	else return dp[q][v];
}

void dfs(int v, int p, int q)
{
	parent[v] = p;
	for(int i = 0; i < G[v].size(); i++){
		if(G[v][i].to == p) continue;
		dfs(G[v][i].to, v, q);
	}
	
	llint sum = e;
	for(int i = 0; i < G[v].size(); i++){
		int u = G[v][i].to; char c = G[v][i].cost;
		if(u == p) continue;
		if(s[q+1] == c) sum = ope(sum, get(v, u, q+1)+1); //
		else sum = ope(sum, get(v, u, q)); //
	}
	dp[q][v] = max(dp[q+1][v], sum); //
}

llint lsum[2005], rsum[2005];
void dfs2(int v, int p, int q)
{
	llint m = G[v].size(), sum;
	
	sum = lsum[0] = e;
	for(int i = 0; i < m; i++){
		int u = G[v][i].to; char c = G[v][i].cost;
		if(s[q+1] == c) sum = ope(sum, get(v, u, q+1)+1); //
		else sum = ope(sum, get(v, u, q)); //
		lsum[i+1] = sum;
	}
	sum = rsum[m+1] = e;
	for(int i = m-1; i >= 0; i--){
		int u = G[v][i].to; char c = G[v][i].cost;
		if(s[q+1] == c) sum = ope(sum, get(v, u, q+1)+1); //
		else sum = ope(sum, get(v, u, q)); //
		rsum[i+1] = sum;
	}
	for(int i = 0; i < m; i++){
		if(G[v][i].to == p) continue;
		dp2[q][G[v][i].to] = max(dp2[q+1][G[v][i].to], ope(lsum[i], rsum[i+2])); //
	}
	
	for(int i = 0; i < G[v].size(); i++){
		if(G[v][i].to == p) continue;
		dfs2(G[v][i].to, v, q);
	}
}


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, c));
		G[v].push_back(edge(u, c));
	}
	
	per(i, S-1, 0) dfs(1, 0, i), dfs2(1, 0, i);
	
	ll ans = 0;
	rep(i, 1, n){
		rep(j, 0, S-1){
			for(auto e : G[i]){
				int u = e.to; char c = e.cost;
				if(s[j+1] == c) chmax(ans, get(i, u, j+1)+1);
				else chmax(ans, get(i, u, j));
			}
		}
	}
	outl(ans);
	
	return 0;
}

yukicoder

結果

テストケース

ソースコード