Submission #1690726


Source Code Expand

#include <bits/stdc++.h>
 
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
 
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)
 
#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
 
// #define DEBUG
 
#ifdef DEBUG
    #define dump(...) fprintf(stderr, __VA_ARGS__)
#else
    #define dump(...)
#endif
 
template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}
 
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
 
const double EPS = 1e-10;
const double PI = acos(-1.0);
const ll inf =1LL << 62;
const ll mod=1000000007LL;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
 
 
ll extgcd(ll a,ll b,ll& x,ll& y){x=1,y=0;ll g=a;if(b!=0) g=extgcd(b,a%b,y,x),y-=a/b*x;return g;}
ll ADD(const ll &a, const ll &b,const ll &mod) { return (a+b)%mod;}
ll SUB(const ll &a, const ll &b,const ll &mod) { return (a-b+mod)%mod;}
ll MUL(const ll &a, const ll &b,const ll &mod) { return (1LL*a*b)%mod;}
ll DIV(const ll &a, const ll &b,const ll &mod) {ll x,y; extgcd(b,mod,x,y);return MUL(a,(x+mod)%mod,mod);}
 
random_device rd;
mt19937 mt(rd());
uniform_int_distribution<int> dice(1,6);
uniform_real_distribution<double> score(0.0,10.0);

// [l, r)
int calc(vi& sum, int l, int r){
    return sum[r] - sum[l];
}

int main(void){
    cin.tie(0);
    ios::sync_with_stdio(false);

    string S, T; cin >> S >> T;
    int ns = S.size(), nt = T.size();
    vi sums(ns + 1), sumt(nt + 1);
    rep(i, ns){
        sums[i + 1] = sums[i] + (S[i] == 'B' ? 1:2);
    }
    rep(i, nt){
        sumt[i + 1] = sumt[i] + (T[i] == 'B' ? 1:2);
    }

    int Q; cin >> Q;
    rep(loop, Q){
        int a, b, c, d; cin >> a >> b >> c >> d;
        int vs = calc(sums, a - 1, b) % 3;
        int vt = calc(sumt, c - 1, d) % 3;
        cout << (vs == vt ? "Yes":"No") << endl;
    }

    return 0;
}

Submission Info

Submission Time
Task E - TrBBnsformBBtion
User nokoTaro
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2429 Byte
Status WA
Exec Time 202 ms
Memory 1744 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 600
Status
WA × 2
WA × 16
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 WA 2 ms 380 KB
0_001.txt WA 1 ms 256 KB
bound_0.txt WA 186 ms 1744 KB
bound_1.txt WA 191 ms 1744 KB
bound_2.txt WA 188 ms 1744 KB
bound_3.txt WA 202 ms 1744 KB
min.txt WA 1 ms 256 KB
rnd_10000_10.txt WA 190 ms 1744 KB
rnd_10000_10000.txt WA 192 ms 1744 KB
rnd_10000_2.txt WA 197 ms 1744 KB
rnd_10_10.txt WA 191 ms 1744 KB
rnd_10_10000.txt WA 193 ms 1744 KB
rnd_10_2.txt WA 192 ms 1744 KB
rnd_2_10.txt WA 196 ms 1744 KB
rnd_2_10000.txt WA 190 ms 1744 KB
rnd_2_2.txt WA 190 ms 1744 KB