Gomamayo Sequence

 这个有意思，收录一下

D - Gomamayo Sequence (atcoder.jp)

#include <iostream>
#include <string>
#include <stack>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <numeric>
#include <functional>
#include <climits>
//#include <windows.h>
using namespace std;
#define ll long long  
#define db double
#define PII pair<int, int>
#define TUP tuple<int, int, int>
const int inf = 0x3f3f3f3f;
ll mod = 1e15 + 17;
ll q_pow(ll a, ll b) { ll ret = 1; while (b) { if (b & 1)ret = ret * a % mod; b >>= 1; a = a * a % mod; }return ret; }
ll gcd(ll a, ll b) { if (!b)return a; return gcd(b, a % b); }

const int N = 1e6;

int n;
string s;
ll w[N];
ll sum01[N], sum10[N];
void yelp_solve() {
    cin >> n >> s;
    for (int i = 0; i < n; i++) cin >> w[i];
    sum01[0] = s[0] == '0' ? 0 : w[0];
    for (int i = 1; i < n; i++) {
        if (i % 2 == 0) {
            sum01[i] = sum01[i - 1] + (s[i] == '1' ? w[i] : 0);
        }
        else {
            sum01[i] = sum01[i - 1] + (s[i] == '0' ? w[i] : 0);
        }
    }
    sum10[0] = s[0] == '1' ? 0 : w[0];
    for (int i = 1; i < n; i++) {
        if (i % 2 == 0) {
            sum10[i] = sum10[i - 1] + (s[i] == '0' ? w[i] : 0);
        }
        else {
            sum10[i] = sum10[i - 1] + (s[i] == '1' ? w[i] : 0);
        }
    }
    ll ans = LLONG_MAX;
    for (int i = 0; i + 1 < n; i++) {
        if (i % 2 == 0) {
            //00
            ans = min(ans, (i - 1 >= 0 ? sum01[i - 1] : 0) + sum10[n - 1] - sum10[i + 1] + (s[i] == '0' ? 0 : w[i]) + (s[i + 1] == '0' ? 0 : w[i + 1]));
            //11
            ans = min(ans, (i - 1 >= 0 ? sum10[i - 1] : 0) + sum01[n - 1] - sum01[i + 1] + (s[i] == '1' ? 0 : w[i]) + (s[i + 1] == '1' ? 0 : w[i + 1]));
        }
        else {
            //00
            ans = min(ans, (i - 1 >= 0 ? sum10[i - 1] : 0) + sum01[n - 1] - sum01[i + 1] + (s[i] == '0' ? 0 : w[i]) + (s[i + 1] == '0' ? 0 : w[i + 1]));
            //11
            ans = min(ans, (i - 1 >= 0 ? sum01[i - 1] : 0) + sum10[n - 1] - sum10[i + 1] + (s[i] == '1' ? 0 : w[i]) + (s[i + 1] == '1' ? 0 : w[i + 1]));
        }
    }
    cout << ans;
    return;
}
int main() {
    int r = 1;
    //cin >> r;
    while (r--) yelp_solve();
    return 0;
}