제출 #940406

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
940406		Rifal	Crossing (JOI21_crossing)	C++14	3 / 100	7030 ms	5624 KiB

Main

#include <bits/stdc++.h>
#include <fstream>
#define endl '\n'
#define mod 1000000007
#define INF 2000000000
#define INF2 1000000000000000000
///#define cin fin
///#define cout fout
using namespace std;
double const EPS = 1e-14;
typedef long long ll;
///ofstream fout("herding.out");
///ifstream fin("herding.in");
const int N = 2e5 + 5;
int cnt[3][N];
int main()
{
    ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
    int n, q; cin >> n; string s1, s2, s3, t; cin >> s1 >> s2 >>s3;
    cin >> q >> t ;
    if(t == s1) cout << "Yes" << endl;
    else cout << "No" << endl;
    while(q--) {
        int l, r; char c; cin >> l >> r >> c;
        l--; r--;
        for(int i = l; i <= r; i++) {
            t[i] = c;
        }
        if(t == s1) cout << "Yes" << endl;
        else cout << "No" << endl;
    }
    return 0;
}

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