Submission #2525208
Source Code Expand
#include <iostream>
#include <climits>
#include <stack>
#include <queue>
#include <iomanip>
#include <limits>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
long long int INF = 1e18;
double Pi = 3.141592653589;
const int mod = 1000000007;
// memset(a,0,sizeof(a)); →全部0にする
vector<int> G[100005];
std::vector<P> tree[100010];
int dx[8]={1,0,-1,0,1,1,-1,-1};
int dy[8]={0,1,0,-1,1,-1,-1,1};
#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<x<<" ";
#define re(i,a,b) for(i=a;i<=b;i++)
ll i,j,ii,jj;
ll n,m;
ll kaisi,k,hazime,owari;
ll a,b,c,d;
char s[100005],t[100005];
ll ss[100005],tt[100005];
int main(){
cin>>s>>t;
n=strlen(s);
m=strlen(t);
ss[0]=tt[0]=0;
for(i=1;i<=n;i++){
if(s[i-1]=='A'){
ss[i]=ss[i-1]+1;
}else{
ss[i]=ss[i-1]+2;
}
}
for(i=1;i<=n;i++){
if(t[i-1]=='A'){
tt[i]=tt[i-1]+1;
}else{
tt[i]=tt[i-1]+2;
}
}
ll q;
cin>>q;
for(i=0;i<q;i++){
cin>>a>>b>>c>>d;
if((ss[b]-ss[a-1]-tt[d]+tt[c-1])%3==0){
p("YES");
}else{
p("NO");
}
}
return 0;
}
Submission Info
Submission Time |
|
Task |
E - TrBBnsformBBtion |
User |
enjapma |
Language |
C++14 (GCC 5.4.1) |
Score |
600 |
Code Size |
1459 Byte |
Status |
AC |
Exec Time |
284 ms |
Memory |
7040 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
600 / 600 |
Status |
|
|
Set Name |
Test Cases |
Sample |
0_000.txt, 0_001.txt |
All |
0_000.txt, 0_001.txt, bound_0.txt, bound_1.txt, bound_2.txt, bound_3.txt, min.txt, rnd_10000_10.txt, rnd_10000_10000.txt, rnd_10000_2.txt, rnd_10_10.txt, rnd_10_10000.txt, rnd_10_2.txt, rnd_2_10.txt, rnd_2_10000.txt, rnd_2_2.txt |
Case Name |
Status |
Exec Time |
Memory |
0_000.txt |
AC |
3 ms |
4992 KB |
0_001.txt |
AC |
3 ms |
4992 KB |
bound_0.txt |
AC |
254 ms |
7040 KB |
bound_1.txt |
AC |
270 ms |
7040 KB |
bound_2.txt |
AC |
271 ms |
7040 KB |
bound_3.txt |
AC |
284 ms |
7040 KB |
min.txt |
AC |
3 ms |
4992 KB |
rnd_10000_10.txt |
AC |
281 ms |
7040 KB |
rnd_10000_10000.txt |
AC |
278 ms |
7040 KB |
rnd_10000_2.txt |
AC |
278 ms |
7040 KB |
rnd_10_10.txt |
AC |
276 ms |
7040 KB |
rnd_10_10000.txt |
AC |
276 ms |
7040 KB |
rnd_10_2.txt |
AC |
275 ms |
7040 KB |
rnd_2_10.txt |
AC |
279 ms |
7040 KB |
rnd_2_10000.txt |
AC |
278 ms |
7040 KB |
rnd_2_2.txt |
AC |
277 ms |
7040 KB |