CodeForces 1272F : Two Bracket Sequences bfs + DP + 路径还原

传送门

题意

输入两个括号序列 s,t（不一定合法），你需要构造一个尽可能短的合法括号序列使得s,t 都是这个序列的子序列（子序列意味着不用连续）

分析

首先答案肯定存在，最多两百对()
这道题的状态表示很巧妙，我们用$f[i][j][d]$表示$s$对上$x$，$y$对上$j$的情况下，左括号的数量减去右括号的数量为$d$的时候最小长度，然后跑$bfs$，构造$f[n][m][0]$的情况即可，需要保存一下路径

代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10,M = 1e6 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
	char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
	while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int h[N],ne[M],e[M],w[M],idx;
int n,a[N];
int d1[N];
int d2[N];
bool st[N];

void add(int x,int y,int z){
	ne[idx] = h[x],e[idx] = y,w[idx] = z,h[x] = idx++;
}

int main() {
	read(n);
	memset(h,-1,sizeof h);
	for(int i = 1;i <= n;i++) {
		read(a[i]);
		if(a[i] & 1) add(0,i,0);
		else add(n + 1,i,0);
	}
	for(int i = 1;i <= n;i++){
		int p = i + a[i];
		if(p >= 1 && p <= n) add(p,i,1);
		p = i - a[i];
		if(p >= 1 && p <= n) add(p,i,1);
	}
	queue<int> q;
	q.push(1);
	memset(d1,0x3f,sizeof d1);
	memset(d2,0x3f,sizeof d2);
	d1[0] = 0,d2[n + 1] = 0;
	q.push(0);
	while(q.size()){
		int t = q.front();
		q.pop();
		st[t] = false;
		for(int i = h[t];~i;i = ne[i]){
			int j = e[i];
			if(d1[j] > d1[t] + w[i]){
				d1[j] = d1[t] + w[i];
				if(!st[j]){
					q.push(j);
					st[j] = true;
				} 
			}
		}
	}
	q.push(n + 1);
	while(q.size()){
		int t = q.front();
		q.pop();
		st[t] = false;
		for(int i = h[t];~i;i = ne[i]){
			int j = e[i];
			if(d2[j] > d2[t] + w[i]){
				d2[j] = d2[t] + w[i];
				if(!st[j]){
					q.push(j);
					st[j] = true;
				} 
			}
		}
	}
	for(int i = 1;i <= n;i++) {
		if(d1[i] == INF) d1[i] = -1;
		if(d2[i] == INF) d2[i] = -1;
	}
	for(int i = 1;i <= n;i++){
		if(a[i] & 1) printf("%d ",d2[i]);
		else printf("%d ",d1[i]);
	}
	return 0;
}