Submission details
Task:Bittijono
Sender:alli
Submission time:2026-01-17 14:57:53 +0200
Language:C++ (C++20)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 3details
#20.00 s1, 2, 3details
#3ACCEPTED0.00 s1, 3details
#40.00 s1, 3details
#5ACCEPTED0.00 s1, 3details
#6ACCEPTED0.01 s3details
#70.01 s2, 3details
#8ACCEPTED0.01 s3details
#90.01 s2, 3details
#100.01 s2, 3details
#110.01 s3details
#120.01 s2, 3details
#130.01 s3details
#140.01 s3details
#150.01 s3details
#16ACCEPTED0.00 s1, 2, 3details
#17ACCEPTED0.00 s1, 3details
#180.00 s1, 3details
#190.01 s3details
#200.01 s3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:20:13: warning: unused variable 's' [-Wunused-variable]
   20 |         int s = 0, l = 0;
      |             ^
input/code.cpp:20:20: warning: unused variable 'l' [-Wunused-variable]
   20 |         int s = 0, l = 0;
      |                    ^

Code

#include<bits/stdc++.h>
 
typedef long long ll;
using namespace std;
 
int n, a, b;
string s1, s2;

int x[101010];
 
int main(){
    cin >> n >> a >> b >> s1 >> s2;
    for (int i = 0; i < n; i++){
        if (s1[i] == s2[i]) x[i+1] = x[i]-a;
        else x[i+1] = x[i]+a;
        //cout << x[i+1] << " ";
    } //cout << "\n";
    int r = 0;
    for (int i = 0; i < n; i++){
        int s = 0, l = 0;
        pair<int, int> mi = {0,0}, ma = {0,0};
        for (int j = 1; j <= n; j++){
            ma = max(ma, {x[j],j});
            mi = min(mi, {x[j],j});
        }
        //cout << mi.first << " " << mi.second << "\n";
        //cout << ma.first << " " << ma.second << "\n";
        if (ma.first + mi.first < b) break;
        for (int j = mi.second+1; j <= ma.second; j++){
            //cout << "s1 before " << s1[j-1] << "\n";
            s1[j-1] = s1[j-1] == '0' ? '1' : '0';
            //cout << "s1 after " << s1[j-1] << "\n";
            x[j] = -x[j];
        }
        //cout << "ma second: " <<  x[ma.second] << "\n";
        for (int j = ma.second; j < n; j++){
            if (s1[j] == s2[j]) x[j+1] = x[j]-a;
            else x[j+1] = x[j]+a;
            //cout << x[j+1] << " ";
        } //cout << "\n";
        r += b;
    }
    for (int i = 0; i < n; i++){
        if (s1[i] != s2[i]){
            r += a;
        }
    }
    cout << r << "\n";
}

Test details

Test 1 (public)

Group: 1, 3

Verdict: ACCEPTED

input
8 3 5
10110001
01101000

correct output
11

user output
11

Test 2

Group: 1, 2, 3

Verdict:

input
10 644 644
0111000100
0000010111

correct output
1932

user output
2576

Feedback: Incorrect character on line 1 col 1: expected "1932", got "2576"

Test 3

Group: 1, 3

Verdict: ACCEPTED

input
10 493 986
0001110000
0001100001

correct output
986

user output
986

Test 4

Group: 1, 3

Verdict:

input
10 240 720
1011001110
1000000001

correct output
1200

user output
1440

Feedback: Incorrect character on line 1 col 2: expected "1200", got "1440"

Test 5

Group: 1, 3

Verdict: ACCEPTED

input
10 3 7
1110111111
0010010101

correct output
15

user output
15

Test 6

Group: 3

Verdict: ACCEPTED

input
100000 1 1000000000
001100110010101001010111000110...

correct output
50252

user output
50252

Test 7

Group: 2, 3

Verdict:

input
100000 1000000000 1
110010000110110100110110101011...

correct output
25055

user output
666884608

Feedback: Incorrect character on line 1 col 1: expected "25055", got "666884608"

Test 8

Group: 3

Verdict: ACCEPTED

input
100000 1000 1000000000
001001101010100000011110000101...

correct output
50001000

user output
50001000

Test 9

Group: 2, 3

Verdict:

input
100000 1000000000 1000
101010110001010011011011101110...

correct output
24939000

user output
84400104

Feedback: Incorrect character on line 1 col 1: expected "24939000", got "84400104"

Test 10

Group: 2, 3

Verdict:

input
100000 1000000000 1000000000
001000000001000000000010110111...

correct output
25023000000000

user output
-1649521664

Feedback: Incorrect character on line 1 col 1: expected "25023000000000", got "-1649521664"

Test 11

Group: 3

Verdict:

input
100000 123456789 987654321
100010110100011000001111001110...

correct output
5475678967593

user output
893384691

Feedback: Incorrect character on line 1 col 1: expected "5475678967593", got "893384691"

Test 12

Group: 2, 3

Verdict:

input
100000 987654321 123456789
000100110000010110111101111101...

correct output
3071481453531

user output
393426378

Feedback: Incorrect character on line 1 col 2: expected "3071481453531", got "393426378"

Test 13

Group: 3

Verdict:

input
100000 1000000 1000000000
001100110010100011000111101100...

correct output
49916000000

user output
-1623607552

Feedback: Incorrect character on line 1 col 1: expected "49916000000", got "-1623607552"

Test 14

Group: 3

Verdict:

input
100000 10000000 1000000000
110111101101111110100101011000...

correct output
494930000000

user output
533793664

Feedback: Incorrect character on line 1 col 1: expected "494930000000", got "533793664"

Test 15

Group: 3

Verdict:

input
100000 100000000 1000000000
111110000010100011011100110010...

correct output
4547300000000

user output
-1521801728

Feedback: Incorrect character on line 1 col 1: expected "4547300000000", got "-1521801728"

Test 16

Group: 1, 2, 3

Verdict: ACCEPTED

input
1 1 1
1
1

correct output
0

user output
0

Test 17

Group: 1, 3

Verdict: ACCEPTED

input
10 600 800
0000000000
1110111111

correct output
1400

user output
1400

Test 18

Group: 1, 3

Verdict:

input
10 300 599
1101001010
0011010110

correct output
1198

user output
1199

Feedback: Incorrect character on line 1 col 4: expected "1198", got "1199"

Test 19

Group: 3

Verdict:

input
100000 300000000 500000000
010011101001001010010101101101...

correct output
10000000000000

user output
-207937536

Feedback: Incorrect character on line 1 col 1: expected "10000000000000", got "-207937536"

Test 20

Group: 3

Verdict:

input
100000 60000 1000000000
110110111011010100001000011011...

correct output
3000000000

user output
-1294927296

Feedback: Incorrect character on line 1 col 1: expected "3000000000", got "-1294927296"