# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
863896 | vjudge1 | Crossing (JOI21_crossing) | C++17 | 7083 ms | 5620 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;
using ll = long long;
void check(string &a, string &b)
{
for (int i = 0; i < a.size(); i++)
{
if (a[i] != b[i])
{
cout << "No" << endl;
return;
}
}
cout << "Yes" << endl;
}
void solve()
{
ios::sync_with_stdio(false);
int n, q;
string s1, s2, s3, t0;
cin >> n >> s1 >> s2 >> s3 >> q >> t0;
check(s1, t0);
for (int i = 0; i < q; i++)
{
int l, r;
char c;
cin >> l >> r >> c;
for (int i = l - 1; i < r; i++)
{
t0[i] = c;
}
check(s1, t0);
}
}
int main()
{
int t = 1;
// cin >> t;
for (int i = 1; i <= t; i++)
{
// cout << "Case #" << i << ": ";
solve();
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |