# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
98022 | dalgerok | Programiranje (COCI17_programiranje) | C++17 | 38 ms | 7112 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;
const int N = 5e5 + 5;
int n, m, a[26][N];
string s;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> s;
n = (int)s.size();
s = '#' + s;
for(int i = 1; i <= n; i++){
for(int j = 0; j < 26; j++){
a[j][i] = a[j][i - 1];
}
a[s[i] - 'a'][i] += 1;
}
cin >> m;
while(m--){
int l1, r1, l2, r2;
cin >> l1 >> r1 >> l2 >> r2;
bool p = true;
for(int i = 0; i < 26; i++){
if(a[i][r1] - a[i][l1 - 1] != a[i][r2] - a[i][l2 - 1]){
p = false;
break;
}
}
if(p){
cout << "DA\n";
}
else{
cout << "NE\n";
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |