Submission details
Task:Hiitdromes
Sender:"Selvästi nähdään"
Submission time:2025-11-08 16:07:12 +0200
Language:C++ (C++20)
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.00 sdetails
#7ACCEPTED0.00 sdetails
#8ACCEPTED0.00 sdetails
#9ACCEPTED0.00 sdetails
#10ACCEPTED0.00 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.00 sdetails
#14ACCEPTED0.01 sdetails
#15ACCEPTED0.01 sdetails
#16ACCEPTED0.01 sdetails
#17ACCEPTED0.01 sdetails
#18ACCEPTED0.01 sdetails
#19ACCEPTED0.01 sdetails
#20ACCEPTED0.01 sdetails
#21ACCEPTED0.01 sdetails

Code

#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
#define F first
#define S second
#define X real()
#define Y imag()

int dp[1010][1010];

int check(char c1, char c2) {
    if (c1=='H' || c1=='I' || c1=='T') {
        if (c2==c1) return 0;
        else return 1;
    }
    if (c2=='H' || c2=='I' || c2=='T') return 1;
    return 2;
}

int main() {
    int n;
    cin>>n;
    string s;
    cin>>s;
    for (int i=0;i<n;i++) {
        dp[i][i]=0;
        if (s[i]=='H' || s[i]=='I' || s[i]=='T') dp[i][i+1]=0;
        else dp[i][i+1]=1;
    }
    for (int i=n-2;i>=0;i--) {
        for (int j=i+2;j<=n;j++) {
            dp[i][j]=dp[i+1][j]+1;
            dp[i][j]=min(dp[i][j],dp[i][j-1]+1);
            dp[i][j]=min(dp[i][j],dp[i+1][j-1]+check(s[i],s[j-1]));
        }
    }
    cout<<dp[0][n]<<"\n";
}

Test details

Test 1

Verdict: ACCEPTED

input
6
HEITTO

correct output
3

user output
3

Test 2

Verdict: ACCEPTED

input
1
I

correct output
0

user output
0

Test 3

Verdict: ACCEPTED

input
1
A

correct output
1

user output
1

Test 4

Verdict: ACCEPTED

input
1
O

correct output
1

user output
1

Test 5

Verdict: ACCEPTED

input
1
Z

correct output
1

user output
1

Test 6

Verdict: ACCEPTED

input
10
HHTTHITTIH

correct output
2

user output
2

Test 7

Verdict: ACCEPTED

input
10
TTAHTHHAHT

correct output
3

user output
3

Test 8

Verdict: ACCEPTED

input
10
BFUJMZSMZJ

correct output
10

user output
10

Test 9

Verdict: ACCEPTED

input
10
WAZGWJNVGK

correct output
10

user output
10

Test 10

Verdict: ACCEPTED

input
100
HIIIIHHHHHHTIHHHHIIIHHTITTHTTT...

correct output
24

user output
24

Test 11

Verdict: ACCEPTED

input
100
TAHAIAITAIHHHITAHAHHIITTHAITTH...

correct output
34

user output
34

Test 12

Verdict: ACCEPTED

input
100
EBARMESYLCNFAXNWYCWXSSCNXVWPDS...

correct output
100

user output
100

Test 13

Verdict: ACCEPTED

input
100
ELTWGCNSAJXAXHACYSDJHRPZYMWXAE...

correct output
87

user output
87

Test 14

Verdict: ACCEPTED

input
1000
TIHTTTTHTTITIITTIITIHIHTHTTIII...

correct output
222

user output
222

Test 15

Verdict: ACCEPTED

input
1000
ITTITAHHAHTHIAAAIIHITIAHITHHIH...

correct output
342

user output
342

Test 16

Verdict: ACCEPTED

input
1000
WVEPBCKVGYOAJVJSCEFXYAGNSOWZVL...

correct output
1000

user output
1000

Test 17

Verdict: ACCEPTED

input
1000
FINBOIBDJSFERQEWBVYROECPSOESGJ...

correct output
888

user output
888

Test 18

Verdict: ACCEPTED

input
1000
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
1000

user output
1000

Test 19

Verdict: ACCEPTED

input
1000
HHHHHHHHHHHHHHHHHHHHHHHHHHHHHH...

correct output
0

user output
0

Test 20

Verdict: ACCEPTED

input
1000
IIIIIIIIIIIIIIIIIIIIIIIIIIIIII...

correct output
0

user output
0

Test 21

Verdict: ACCEPTED

input
1000
TTTTTTTTTTTTTTTTTTTTTTTTTTTTTT...

correct output
0

user output
0