D2 - Zero-One (Hard Version)(线性dp)

D2 - Zero-One (Hard Version)(线性dp)

传送门

样例输入：

6
5 8 9
01001
00101
6 2 11
000001
100000
5 7 2
01000
11011
7 8 3
0111001
0100001
6 3 4
010001
101000
5 10 1
01100
01100

样例输出：

8
10
-1
6
7
0

代码：

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;

typedef long long LL;
const int N = 5005;
int n;
double x, y, f[N];
string a, b;
int s[N], m;

int main()
{
	int T;
	cin >> T;
	while(T -- )
	{
		m = 0;
		cin >> n >> x >> y >> a >> b;
		for(int i = 0; i < n; i ++ )
			if(a[i] ^ b[i])
				s[ ++ m ] = i;
		
		x = min(x, y * 2);	
		y /= 2;
		f[1] = y;
		if(m % 2) cout << -1 << endl;
		else if(m == 2 && s[2] - s[1] == 1) printf("%d\n", (int)x);
		else
		{
			for(int i = 2; i <= m; i ++ )
				f[i]  = min(f[i - 2] + 1.0 * (s[i] - s[i - 1]) * x, f[i - 1] + y);
				
			printf("%lld\n",(LL)f[m]);
		}
		
	}
	return 0;
}

---