Submission #529977

#	Time	Username	Problem	Language	Result	Execution time	Memory
529977		c28dnv9q3	Crossing (JOI21_crossing)	C++17	0 / 100	323 ms	4400 KiB

Main

#include <iostream>

using namespace std;

const int MAX_Q = 200'005;

int n, q;
string str1, str2, str3, t;

int l[MAX_Q], r[MAX_Q];
char c[MAX_Q];

char cross(char a, char b) {
    if(a == b) {
        return a;
    }
    if('J' != a && 'J' != b) {
        return 'J';
    }
    if('O' != a && 'O' != b) {
        return 'O';
    }
    return 'I';
}

int main() {
    cin >> n;
    cin >> str1 >> str2 >> str3;
    cin >> q >> t;

    cout << ((str1 == t) ? "Yes" : "No") << "\n";

    for(int i = 0; i < q; ++i) {
        cin >> l[i] >> r[i] >> c[i];

        fill(t.begin() + l[i] - 1, t.begin() + r[i] - 1, c[i]);
        cout << ((str1 == t) ? "Yes" : "No") << "\n";
    }
}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 23
• Subtask 3: 0 / 23
• Subtask 4: 0 / 51