# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
500442 | kappa | Programiranje (COCI17_programiranje) | C++14 | 594 ms | 65080 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 q, a, b, c, d;
string str;
map<char,int> mp[50005];
map<char,int> del(map<char,int> a, map<char,int> b){
map<char,int> r;
for (int i = 0; i < 26; i++)
{
r['a' + i] = a['a' + i] - b['a' + i];
}
return r;
}
int main(){
cin >> str;
for (int i = 1; i <= str.length(); i++)
{
mp[i] = mp[i - 1];
mp[i][str[i - 1]]++;
}
cin >> q;
while(q--){
cin >> a >> b >> c >> d;
if(del(mp[b], mp[a - 1]) == del(mp[d], mp[c - 1])){
cout << "DA\n";
}else{
cout << "NE\n";
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |