#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007;
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}
//freopen("problemname.in", "r", stdin);
//freopen("problemname.out", "w", stdout);
string merge(string s , string t){
for(int i = 0; i < (int)s.size(); i++){
if(s[i] != t[i]){
if(s[i]!='J' && t[i] != 'J')s[i] = 'J';
else if(s[i]!='O' && t[i] != 'O')s[i] = 'O';
else s[i] = 'I';
}
}
return s;
}
void solve(){
int n;
cin >> n;
string a,b,c;
cin >> a >> b >> c;
map<string,int> m;
m[a] = 1;
m[b] = 1;
m[c] = 1;
vector<string> v;
v.pb(a);
v.pb(b);
v.pb(c);
for(int i = 0; i < (int)v.size(); i++){
for(int j = 0; j < (int)v.size(); j++){
string s = merge(v[i],v[j]);
if(m[s] == 1)continue;
v.pb(s);
m[s] = 1;
}
}
assert(v.size() < 50);
int q;
cin >> q;
string s;
cin >> s;
string ans = "No";
for(int i = 0; i < (int)v.size(); i++){
if(s == v[i]){
ans = "Yes";
break;
}
}
while(q--){
int l , r;
cin >> l >> r;
char tp;
cin >> tp;
for(int i = l - 1; i <= r - 1; i++){
s[i] = tp;
}
ans = "No";
for(int i = 0; i < n; i++){
if(s == v[i]){
ans = "Yes";
break;
}
}
cout << ans << '\n';
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
//int t;cin >> t;while(t--)
solve();
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
57 ms |
844 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
57 ms |
844 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
57 ms |
844 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
57 ms |
844 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
