Submission #1114019

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1114019	2024-11-18 06:22:30	NotLinux	Bliskost (COI23_bliskost)	C++17	57 / 100	1050 ms	8256 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
// Author : FatihCihan
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin() , v.end()
#define sz(a) (int)a.size()
void solve(){
  int n,q;
  cin >> n >> q;
  string s1 , s2;
  cin >> s1 >> s2;
  int arr[n] , sum[2] = {0,0};
  for(int i = 0;i<n;i++){
    arr[i] = s2[i] - s1[i];
    if(arr[i] < 0)arr[i] += 26;
    if(i < (n-1))sum[i & 1] += arr[i];
  }
  // cout << "arr : ";for(int i = 0;i<n;i++)cout << arr[i] << " ";cout << endl;
  auto get = [&]{
    int value = ((sum[n&1] - sum[(n&1)^1]) % 26 + 26) % 26;
    if(value == arr[n-1])return "da";
    else return "ne";
  };
  cout << get() << endl;
  while(q--){
    int pos;
    char ch;
    cin >> pos >> ch;
    pos--;
    if(pos < (n-1))sum[pos&1] -= arr[pos];
    s1[pos] = ch;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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