rt，自认为写得没多大问题啊

给组hack也行

#include <bits/stdc++.h>
#define int long long
#define maxm 1000005
#define maxn 1005
#define inf 0x3f3f3f3f3f3f
using namespace std;
int t,n,m,sum;
int a[maxm],s[maxm],f[maxm][2][2];//本字符串为0/1时用没用特权 
char c[maxm];
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>c[i];
		s[i]=c[i]-'0';
	}
	for(int i=1;i<=n;i++)cin>>a[i];
	for(int i=1;i<=n;i++){
		f[i][s[i]][0]=f[i-1][s[i]^1][0];
		f[i][s[i]^1][0]=f[i-1][s[i]][0]+a[i];
		f[i][s[i]][1]=min(f[i-1][s[i]][0],f[i-1][s[i]^1][0]);
		f[i][s[i]^1][1]=min(f[i-1][s[i]][0],f[i-1][s[i]^1][0])+a[i];
		f[i][s[i]][1]=min(f[i][s[i]][1],f[i-1][s[i]^1][1]);
		f[i][s[i]^1][1]=min(f[i][s[i]^1][1],f[i-1][s[i]][1]+a[i]);
		cout<<f[i][0][0]<<" "<<f[i][0][1]<<" "<<f[i][1][0]<<" "<<f[i][1][1]<<"\n";
	} 
	sum=min(min(min(f[n][0][0],f[n][0][1]),f[n][1][0]),f[n][1][1]);
	cout<<sum;
    return 0;
}