Submission #1697260

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
typedef pair<double,int>Q;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
string str;
int q;
int main(){
	cin>>str>>q;
	rep(i,q){
		int x,y;cin>>x>>y;
		stack<ll>S;
		for(int i=x-1;i<y;i++){
			if(S.empty()){
				S.push(1LL<<(str[i]-'a'));
			}
			else{
				ll f = S.top();
				if(f % (1LL<<(str[i]-'a')) != 0){
					S.push(1LL<<(str[i]-'a'));
				}
				else{
					S.top() += 1LL<<(str[i]-'a');
					if(S.top() == (1LL<<26)){
						S.pop();
					}
					else if(S.top() > (1LL<<26)){
						break;
					}
				}
			}
		}
		puts(S.empty()?"Yes":"No");
	}
}

Submission Info

Judge Result