#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3dSgv16 ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}
// e
signed main(){
_3dSgv16;
string s;cin>>s;
const int n=sz(s),m=26;
vec(vi) cnt(n,vi(m));
rep(i,n){
if(i)cnt[i]=cnt[i-1];
cnt[i][s[i]-'a']+=1;
}
int q;cin>>q;
rep(_,q){
int sl,sr,tl,tr;
cin>>sl>>sr>>tl>>tr;
sl-=1,sr-=1,tl-=1,tr-=1;
bool pok=1;
rep(j,m){
if(cnt[sr][j]-(sl==0?0:cnt[sl-1][j])!=cnt[tr][j]-(tl==0?0:cnt[tl-1][j]))pok=0;
}
cout<<(pok?"DA":"NE")<<"\n";
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
468 KB |
Output is correct |
2 |
Correct |
1 ms |
468 KB |
Output is correct |
3 |
Correct |
1 ms |
468 KB |
Output is correct |
4 |
Correct |
1 ms |
468 KB |
Output is correct |
5 |
Correct |
2 ms |
456 KB |
Output is correct |
6 |
Correct |
25 ms |
8236 KB |
Output is correct |
7 |
Correct |
26 ms |
8192 KB |
Output is correct |
8 |
Correct |
26 ms |
8256 KB |
Output is correct |
9 |
Correct |
26 ms |
8268 KB |
Output is correct |
10 |
Correct |
26 ms |
8276 KB |
Output is correct |