#include<bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define ii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define INF 100000000000000000
#define modulo 1000000007
#define mod 998244353
#define int long long int
using namespace std;
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// freopen("q.gir","r",stdin);
// freopen("q.cik","w",stdout);
string s;
cin>>s;
int n=s.length();
vector<vector<int> >data(n+1,vector<int>(26,0));
for(int i=1;i<=n;i++){
data[i]=data[i-1];
data[i][s[i-1]-'a']++;
}
int q;
cin>>q;
while(q--){
int a,b,c,d;
cin>>a>>b>>c>>d;
vector<int>X(26,0),Y(26,0);
for(int i=0;i<26;i++){
X[i]=data[b][i]-data[a-1][i];
Y[i]=data[d][i]-data[c-1][i];
}
if(X==Y)cout<<"DA\n";
else cout<<"NE\n";
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
632 KB |
Output is correct |
2 |
Correct |
3 ms |
632 KB |
Output is correct |
3 |
Correct |
3 ms |
632 KB |
Output is correct |
4 |
Correct |
3 ms |
632 KB |
Output is correct |
5 |
Correct |
3 ms |
632 KB |
Output is correct |
6 |
Correct |
56 ms |
13816 KB |
Output is correct |
7 |
Correct |
61 ms |
13816 KB |
Output is correct |
8 |
Correct |
61 ms |
13944 KB |
Output is correct |
9 |
Correct |
57 ms |
13816 KB |
Output is correct |
10 |
Correct |
56 ms |
13816 KB |
Output is correct |