我的代码WA,求调

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e5+5, mod=998244353, inf=1e14;
int n;
int c[N];
string s1, s2;
int dp[N];

void work(){
    cin >> n;
    cin >> s1 >> s2;
    reverse(s1.begin(), s1.end());
    reverse(s2.begin(), s2.end());
    s1 += '0'; 
    s2 += '0';
    for(int i = n-1; i >= 0; i--)
        cin >> c[i];
    for(int i = 0; i < n; i++)
        if(s1[i] > s2[i]) {
            puts("-1");
            return;
        }
    int ans = 0;
    for(int i = 0; i <= n; i++) dp[i] = 0;
    dp[0] = (s1[0] != s2[0]) * c[0];
    for(int i = 1; i <= n; i++){
        if(s2[i] == '0'){
            ans += dp[i-1];
            dp[i] = dp[i-1];
            continue;
        }
        if(s1[i] == '0'){
            int mi = inf;
            for(int j = i; j >= 0 && s2[j] == '1'; j--)
                mi = min(mi, c[j]);
            dp[i] = dp[i-1] + mi;
            for(int j = i-1; j >= -1 && (j == -1 || (s2[j+1] == '1' && s1[j+1] == '0')); j--)
                dp[i] = min(dp[i], (j < 0 ? 0 : dp[j]) + c[j+1] + c[i]);
        } else {
            dp[i] = dp[i-1];
        }
    }
    cout << ans << "\n";
}

signed main(){
    int _;
    cin >> _;
    while(_--) work();
    return 0;
}