oj.uz

답안 #972496

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
972496 2024-04-30T13:57:10 Z stefanopulos Bliskost (COI23_bliskost) C++17
0 / 100
 0 ms 348 KB 
#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];
int r[mxN];

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

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

    ff(i,1,n){
        r[i] = s[i] - t[i];
        d[i + 1] = r[i] - d[i];
    }

    cout << (d[n] == r[n] ? "da" : "ne") << '\n';

    while(q--){
        int pos; char c;
        cin >> pos >> c;

        s[pos] = c;
        r[pos] = s[pos] - t[pos];

        ff(i,pos,n - 1){
            d[i + 1] = r[i] - d[i];
        }

        cout << (d[n] == r[n] ? "da" : "ne") << '\n';

    }

    return 0;
}
/*

3 1
bbc
ced
1 a

6 0
berlio
pjesni

// probati bojenje sahovski
*/

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -