# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
81231 | ngot23 | Programiranje (COCI17_programiranje) | C++11 | 60 ms | 11916 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>
#define rep(i, a, b) for(int i=(a) ; i<=(b) ; ++i)
#define Task ""
using namespace std;
const int N=50005;
int bit[26][N], n;
string s;
void update(int t, int node) {
while(node<=n) {
++bit[t][node];
node+=node&(-node);
}
}
int get(int t, int node) {
int ret=0;
while(node>0) {
ret+=bit[t][node];
node-=node&(-node);
}
return ret;
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//freopen(Task".inp", "r", stdin);
//freopen(Task".out", "w", stdout);
cin >> s;
n=s.size();
rep(i, 0, s.size()-1) {
int xx=s[i]-'a';
update(xx, i+1);
}
int Q;
cin >> Q;
while(Q--) {
int x, y, u, v;
cin >> x >> y >> u >> v;
if(y-x!=v-u) { cout << "NE" << '\n'; continue; }
bool ok=1;
rep(i, 0, 25) {
int num1=get(i, y)-get(i, x-1);
int num2=get(i, v)-get(i, u-1);
if(num1!=num2) { ok=0; break; }
}
cout << (ok?"DA":"NE") << '\n';
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |