Submission #1221895

#TimeUsernameProblemLanguageResultExecution timeMemory
1221895slivajanCrossing (JOI21_crossing)C++20
3 / 100
7091 ms1716 KiB
#include <bits/stdc++.h>
using namespace std;

using un = long long;
using vuc = vector<un>;
using vol = vector<bool>;

#define REP(i, a, b) for (un i = (un)a ; i < (un)b; i++)
#define FEAC(i, a) for (auto&& i : a)
#define vec vector
#define ALL(x) (x).begin(), (x).end()


int main(){
    un N; cin >> N;

    string A; cin >> A;

    string trash;
    cin >> trash >> trash;

    un Q; cin >> Q;
    string current; cin >> current;

    if (A == current) cout << "Yes\n";
    else cout << "No\n";

    REP(q, 0, Q){
        un L, R; cin >> L >> R;
        char c; cin >> c;

        L--; R--;

        REP(i, L, R+1) current[i] = c;


        if (A == current) cout << "Yes\n";
        else cout << "No\n";

    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...