#include<bits/stdc++.h>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string s;
cin >> s;
int n = s.size();
vector <vector <int> > pref(n, vector <int> (26));
for(int i = 0; i < n; i++)
{
if(i != 0){
for(int j = 0; j < 26; j++)
{
pref[i][j] = pref[i - 1][j];
}
}
pref[i][s[i] - 'a']++;
}
int q;
cin >> q;
while(q--)
{
int a, b, c, d;
cin >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
bool flag = true;
for(int i = 0; i < 26; i++)
{
int cnt1 = pref[b][i];
if(a != 0)
{
cnt1 -= pref[a - 1][i];
}
int cnt2 = pref[d][i];
if(c != 0)
{
cnt2 -= pref[c - 1][i];
}
if(cnt1 != cnt2)
{
flag = false;
}
}
if(flag)
{
cout << "DA\n";
}
else
{
cout << "NE\n";
}
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
512 KB |
Output is correct |
2 |
Correct |
5 ms |
512 KB |
Output is correct |
3 |
Correct |
5 ms |
512 KB |
Output is correct |
4 |
Correct |
5 ms |
512 KB |
Output is correct |
5 |
Correct |
5 ms |
512 KB |
Output is correct |
6 |
Correct |
37 ms |
8312 KB |
Output is correct |
7 |
Correct |
38 ms |
8320 KB |
Output is correct |
8 |
Correct |
38 ms |
8440 KB |
Output is correct |
9 |
Correct |
37 ms |
8320 KB |
Output is correct |
10 |
Correct |
43 ms |
8464 KB |
Output is correct |