Submission #529976

#TimeUsernameProblemLanguageResultExecution timeMemory
529976c28dnv9q3Crossing (JOI21_crossing)C++17
0 / 100
288 ms2416 KiB
#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"; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...