F - Bracket Substring

最新推荐文章于 2024-07-12 18:02:43 发布

三巷DP

最新推荐文章于 2024-07-12 18:02:43 发布

阅读量99

点赞数 1

分类专栏： codeforces 文章标签：算法动态规划

本文链接：https://blog.csdn.net/m0_62167326/article/details/127647209

版权

codeforces 专栏收录该内容

103 篇文章 1 订阅

订阅专栏

Problem - 1015F - Codeforces

题意：给定一个合法括号字符串的连续子串，以及原合法括号的括号对数，要求求出构造原字符串的方案数。

思路：乍一看是组合数学问题，但很快我们就发现，想要构造出原字符串较为复杂，又因为n<=100，数据量较小，我们考虑如何dp。

我们可以先预处理出to[i][0/1]，表示如果后缀已经ss匹配上了前ii个字符，再填一个左/右括号后，后缀和s前缀匹配的长度。这个东西可以直接暴力预处理，也可以用kmp来处理

然后就是设dp[i][j][k][0/1]，表示考虑到第i个位置，左括号比右括号多j个，当前后缀和s已经匹配上了k位，当前串是否已经包含了s串。转移就直接枚举当前位置填什么，并利用预处理出来的to数组转移

#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#include<string>
#include<bitset>
#include<cmath>
#include<array>
#include<atomic>
#include<sstream>
#include<stack>
#include<iomanip>
//#include<bits/stdc++.h>

//#define int ll
#define IOS std::ios::sync_with_stdio(false);std::cin.tie(0);
#define pb push_back
#define endl '\n'
#define x first
#define y second
#define Endl endl
#define pre(i,a,b) for(int i=a;i<=b;i++)
#define rep(i,b,a) for(int i=b;i>=a;i--)
#define si(x) scanf("%d", &x);
#define sl(x) scanf("%lld", &x);
#define ss(x) scanf("%s", x);
#define YES {puts("YES");return;}
#define NO {puts("NO"); return;}
#define all(x) x.begin(),x.end()

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<int, PII> PIII;
typedef pair<char, int> PCI;
typedef pair<int, char> PIC;
typedef pair<double, double> PDD;
typedef pair<ll, ll> PLL;
const int N = 200010, M = 2 * N, B = N, MOD = 1e9 + 7;
const double eps = 1e-7;
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;

int dx[4] = { -1,0,1,0 }, dy[4] = { 0,1,0,-1 };
//int dx[8] = { 1,2,2,1,-1,-2,-2,-1 }, dy[8] = { 2,1,-1,-2,-2,-1,1,2 };
int n, m, k;
int ne[210],to[210][2];
ll dp[210][210][210][2];
char s[210];

ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
ll lowbit(ll x) { return x & -x; }
ll qmi(ll a, ll b, ll MOD) {
	ll res = 1;
	while (b) {
		if (b & 1) res = res * a % MOD;
		a = a * a % MOD;
		b >>= 1;
	}
	return res;
}

inline void init() {}

void slove()
{
	cin >> n;
	n <<= 1;
	cin >> s + 1;
	m = strlen(s + 1);

	for (int i = 2, j = 0; i <= m; i++)
	{
		while (j && s[j + 1] != s[i])j = ne[j];
		if (s[j + 1] == s[i])j++;
		ne[i] = j;
	}

	for (int i = 0; i < m; i++)
	{
		int j = i;
		while (j && s[j + 1] != '(')j = ne[j];
		if (s[j + 1] == '(')to[i][0] = j + 1;
		j = i;
		while (j && s[j + 1] != ')')j = ne[j];
		if (s[j + 1] == ')')to[i][1] = j + 1;
	}

	dp[0][0][0][0] = 1;
	for (int i = 0; i < n; i++)
		for (int j = 0; j <= i; j++)
		{
			for (int k = 0; k < m; k++)
			{
				if (j) dp[i + 1][j - 1][to[k][1]][to[k][1] == m] =
					(dp[i + 1][j - 1][to[k][1]][to[k][1] == m] + dp[i][j][k][0]) % MOD;
				dp[i + 1][j + 1][to[k][0]][to[k][0] == m] =
					(dp[i + 1][j + 1][to[k][0]][to[k][0] == m] + dp[i][j][k][0]) % MOD;
			}
			if (j) dp[i + 1][j - 1][m][1] = (dp[i + 1][j - 1][m][1] + dp[i][j][m][1]) % MOD;
			dp[i + 1][j + 1][m][1] = (dp[i + 1][j + 1][m][1] + dp[i][j][m][1]) % MOD;
		}

	cout << dp[n][0][m][1] << endl;
}

signed main()
{
	//IOS;
	int _ = 1;
	//si(_);
	init();
	while (_--)
	{
		slove();
	}
	return 0;
}
/*
10 9 9

*/