Submission #1060006

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1060006	2024-08-15 10:00:49	aymanrs	Bliskost (COI23_bliskost)	C++17	100 / 100	132 ms	24300 KiB

Main

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<bits/stdc++.h>
using namespace std;
void solve(){
    int n, q;cin >> n >> q;
    string s, t;cin >> s >> t;
    int aemo = 0, bemo = 0;
    int a[n],b[n];for(int i = 0;i < n;i++){
        a[i]=s[i]-'a';
        b[i]=t[i]-'a';
        if(i&1) aemo += 26-a[i];
        else aemo += a[i];
        if(i&1) bemo += 26-b[i];
        else bemo += b[i];
    }
    if(aemo%26 == bemo%26) cout << "da\n";
    else cout << "ne\n";
    while(q--){
        int p;char c;cin >> p >> c;
        p--;c -= 'a';
        if(p&1){
            aemo -= 26-a[p];
            aemo += 26-c;
        } else {
            aemo -= a[p];
            aemo += c;
        }
        a[p]=c;
        if(aemo%26 == bemo%26) cout << "da\n";
        else cout << "ne\n";
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 7 / 7
• Subtask 2: 8 / 8
• Subtask 3: 13 / 13
• Subtask 4: 12 / 12
• Subtask 5: 17 / 17
• Subtask 6: 43 / 43