#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define endl '\n'
#define MASK(i) (1LL << (i))
#define ull unsigned long long
#define ld long double
#define pb push_back
#define all(x) (x).begin() , (x).end()
#define BIT(x , i) ((x >> (i)) & 1)
#define TASK "task"
#define sz(s) (int) (s).size()
using namespace std;
const int mxN = 1007;
const int inf = 1e9 + 277;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 7;
const int base = 307;
const int LOG = 20;
template <typename T1, typename T2> bool minimize(T1 &a, T2 b) {
if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b) {
if (a < b) {a = b; return true;} return false;
}
int n , q;
string s;
int pre[mxN][26];
void solve()
{
cin >> s;
for(int i = 1 ; i <= sz(s) ; i++) pre[i][s[i] - 'a']++;
for(int j = 0 ; j < 26 ; j++)
for(int i = 1 ; i <= sz(s) ; i++) pre[i][j] += pre[i - 1][j];
cin >> q;
while(q--) {
int l , r , u , v;
cin >> l >> r >> u >> v;
bool ok = true;
for(int i = 0 ; i < 26 ; i++) {
if(pre[r] - pre[l - 1] != pre[v] - pre[u - 1]) ok = false;
}
if(ok) cout << "DA" << endl;
else cout << "NE" << endl;
}
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
//freopen(TASK".in" , "r" , stdin);
//freopen(TASK".out" , "w" , stdout);
int tc = 1;
//cin >> tc;
while(tc--) {
solve();
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
2 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
3 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
4 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
5 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
6 |
Runtime error |
1 ms |
844 KB |
Execution killed with signal 11 |
7 |
Runtime error |
1 ms |
856 KB |
Execution killed with signal 11 |
8 |
Runtime error |
1 ms |
844 KB |
Execution killed with signal 11 |
9 |
Runtime error |
1 ms |
844 KB |
Execution killed with signal 11 |
10 |
Runtime error |
1 ms |
844 KB |
Execution killed with signal 11 |