# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
549745 | MilosMilutinovic | Crossing (JOI21_crossing) | C++14 | 7014 ms | 6292 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 <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string sa, sb, sc;
cin >> sa >> sb >> sc;
auto Cross = [&](string s, string t) {
string res = "";
for (int i = 0; i < n; i++) {
if (s[i] == t[i]) {
res += s[i];
} else {
res += (s[i] ^ t[i] ^ 'J' ^ 'O' ^ 'I');
}
}
return res;
};
vector<string> a;
a.push_back(sa);
a.push_back(sb);
a.push_back(sc);
a.push_back(Cross(sa, sb));
a.push_back(Cross(sa, sc));
a.push_back(Cross(sb, sc));
a.push_back(Cross(sa, Cross(sb, sc)));
int q;
cin >> q;
string t;
cin >> t;
function<void()> Answer = [&]() {
for (int i = 0; i < a.size(); i++) {
if (t == a[i]) {
cout << "Yes" << '\n';
return;
}
}
cout << "No" << '\n';
};
Answer();
while (q--) {
int l, r;
char foo;
cin >> l >> r >> foo;
--l; --r;
for (int i = l; i <= r; i++) {
t[i] = foo;
}
Answer();
}
return 0;
}
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... |