Submission #1129667

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1129667	2024-12-26 04:36:18	gyg	Bliskost (COI23_bliskost)	C++20	28 / 100	123 ms	15972 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;
#define int long long 
#define arr array 
const int N = 1e6 + 6;
int n, q;
arr<int, N> a, b;
int md(int x) { return (x + 26) % 26; }
int fnl;
void prcmp() {
    for (int i = 1; i <= n; i++)
        fnl = (i % 2 == n % 2) ? md(fnl + a[i]) : md(fnl - a[i]);
    for (int i = 1; i < n; i++)
        fnl = (i % 2 == n % 2) ? md(fnl - b[i]) : md(fnl + b[i]);
}
void prnt() {
    // cout << fnl << endl;
    cout << ((fnl == b[n]) ? "da" : "ne") << '\n';  
}
void cmp() {
    prnt();
    for (int i = 1; i <= q; i++) {
        int j; char x; cin >> j >> x;
        int y = x - 'a';
        int df = md(y - a[i]);
        a[i] = y;
        fnl = (j % 2 == n % 2) ? md(fnl + df) : md(fnl - df);
        prnt();
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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