Bittijono

input/code.cpp: In function 'std::tuple<int, int, int> get_max_range(std::vector<int>)':
input/code.cpp:31:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |     for (int i = 0; i < starts.size(); i++)
      |                     ~~^~~~~~~~~~~~~~~
input/code.cpp:37:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |         if(i == starts.size()-1){
      |            ~~^~~~~~~~~~~~~~~~~~

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define pb push_back
#define pii pair<int,int>
#define pll pair<ll,ll>
#define FAST ios::sync_with_stdio(0); cin.tie(0);

int n;

tuple<int, int, int> get_max_range(vector<int> values){
    vector<int> pref(n, 0);
    partial_sum(values.begin(), values.end(), pref.begin());

    vector<int> starts;
    int max_sum = 0;
    int count = 0;
    for (int i = 0; i < n; i++)
    {
        if(count+values[i] <= values[i]){
            starts.pb(i);
        }
        count = max(count+values[i], values[i]);

        max_sum = max(count, max_sum);
    }

    tuple<int, int, int> max_range = {0, 0, 0};
    for (int i = 0; i < starts.size(); i++)
    {
        int d = max(0, starts[i]-1);
        int b_sum = pref[d];

        int de = 0;
        if(i == starts.size()-1){
            de = n-1;
        }
        else{
            de = starts[i+1]-1;
        }
        int a_sum = pref[de];

        int sum = a_sum-b_sum;

        if(sum > get<2>(max_range)){
            max_range = {d+1, de, sum};
        }
    }
    
    return max_range;
}

int bits_in_range(string st, int s, int e){
    int bits = 0;
    for (int i = n-e-1; i < n-s+1; i++)
    {
        if(st[i] == '1') bits++;
    }
    return bits;
}


int main(){
    
    int a, b;
    cin >> n >> a >> b;

    bitset<8> n1, n2;

    cin >> n1 >> n2;

    int cost = 0;
    while(n1 != n2){
        bitset<8> diff = n1^n2;

        vector<int> values(n);
        for (int i = n-1; i >= 0; i--)
        {
            if(diff[n-1-i]) values[n-1-i] = a;
            else values[n-1-i] = -a;
        }

        tuple<int,int,int> max_range = get_max_range(values);
    
        int c1 = bits_in_range(diff.to_string(), get<0>(max_range), get<1>(max_range)) * a;

        if(get<2>(max_range) > 0 && c1 > b){
            for (int i = get<0>(max_range); i <= get<1>(max_range); i++)
            {
                n2.flip(i);
            }
            cost += b;
        }
        else{
            for (int i = 0; i <= n; i++)
            {
                if(n1[i] && !n2[i]){
                    n2.flip(i);
                    cost += a;
                }
            }
        }

    }


    cout << cost;

    return 0;
}


//3 3 -3 3 3 -3 -3 3

Test 1 (public)

Group: 1, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 3

Group: 1, 3

Verdict: WRONG ANSWER

Test 4

Group: 1, 3

Verdict: WRONG ANSWER

Test 5

Group: 1, 3

Verdict: RUNTIME ERROR

terminate called after throwing an instance of 'std::out_of_range'
  what():  bitset::flip: __position (which is 8) >= _Nb (which is 8)

Test 6

Group: 3

Verdict: RUNTIME ERROR

Test 7

Group: 2, 3

Verdict: RUNTIME ERROR

Test 8

Group: 3

Verdict: RUNTIME ERROR

Test 9

Group: 2, 3

Verdict: RUNTIME ERROR

Test 10

Group: 2, 3

Verdict: RUNTIME ERROR

Test 11

Group: 3

Verdict: RUNTIME ERROR

Test 12

Group: 2, 3

Verdict: RUNTIME ERROR

Test 13

Group: 3

Verdict: RUNTIME ERROR

Test 14

Group: 3

Verdict: RUNTIME ERROR

Test 15

Group: 3

Verdict: RUNTIME ERROR

Test 16

Group: 1, 2, 3

Verdict: ACCEPTED

Test 17

Group: 1, 3

Verdict: WRONG ANSWER

Test 18

Group: 1, 3

Verdict: WRONG ANSWER

Test 19

Group: 3

Verdict: RUNTIME ERROR

Test 20

Group: 3

Verdict: RUNTIME ERROR