제출 #1122877

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1122877		SulA	Crossing (JOI21_crossing)	C++20	3 / 100	7089 ms	1940 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
//#pragma GCC target("popcnt")
using namespace __gnu_pbds;
using namespace std;
using ordered_set = tree<int, null_type, less_equal<>, rb_tree_tag, tree_order_statistics_node_update>;
#define popcount __builtin_popcountll
#define all(a) (a).begin(), (a).end()

const int MOD = 1e9+7;

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int n; cin >> n;
    string A,B,C; cin >> A >> B >> C;
    string T; int q;
    cin >> q >> T;
    auto solve = [&]() {
        cout << (T == A ? "Yes" : "No") << "\n";
    };
    solve();
    while (q--) {
        int l,r; char c; cin >> l >> r >> c;
        for (int i = l-1; i <= r-1; i++)
            T[i] = c;
        solve();
    }
}

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