Submission #972490

#	Time	Username	Problem	Language	Result	Execution time	Memory
972490		stefanopulos	Bliskost (COI23_bliskost)	C++17	57 / 100	1054 ms	7612 KiB

Main

#pragma GCC optimization("Ofast")

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ldb;
 
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ldb,ldb> pdd;

#define ff(i,a,b) for(int i = a; i <= b; i++)
#define fb(i,b,a) for(int i = b; i >= a; i--)
#define trav(a,x) for(auto& a : x)
 
#define sz(a) (int)(a).size()
#define fi first
#define se second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

const int mod = 1000000007;
const int inf = 1e9 + 5;
const int mxN = 1000005; 

int n, q;
string s, t;

int d[mxN];
bool calc(){

    ff(i,1,n - 1){
        int x = s[i] - 'a';
        int y = t[i] - 'a';
        y = (y + d[i]) % 26;

        int r = (x - y + 26) % 26;
        d[i + 1] = r;
    }

    return (d[n] == (s[n] - t[n] + 26) % 26);

}

int main(){
    cin.tie(0)->sync_with_stdio(0);

    cin >> n >> q >> s >> t;
    s = ' ' + s; t = ' ' + t;

    cout << (calc() == 1 ? "da" : "ne") << '\n';
    while(q--){
        int pos; char c;
        cin >> pos >> c;

        s[pos] = c;
        cout << (calc() == 1 ? "da" : "ne") << '\n';
    }

    return 0;
}
/*

3 1
bbc
ced
1 a

6 0
berlio
pjesni

// probati bojenje sahovski
*/
 
 
 
 
 

Compilation message (stderr)

Main.cpp:1: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    1 | #pragma GCC optimization("Ofast")
      |

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