# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
225207 | baoduytran0104 | Programiranje (COCI17_programiranje) | C++14 | 197 ms | 6564 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int a[50005][30], n, t, e, b,c , d;
string s;
int main()
{
cin >> s;
n = s.size();
s = ' ' + s;
for(int i = 1; i <= n; ++i) {
for(int j = 0; j < 26; ++j) {
a[i][j] = a[i - 1][j] + (s[i] - 'a' == j);
}
}
cin >> t;
while(t--) {
cin >> e >> b >> c >> d;
if(b - e != d - c) {
cout << "NE\n";
continue;
}
bool check = 1;
for(int i = 0; i < 26; ++i) {
if (a[b][i] - a[e - 1][i] != a[d][i] - a[c - 1][i]) {
check = 0;
break;
}
}
cout << (check ? "DA" : "NE") << '\n';
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |