# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
36520 | adamczh1 | Programiranje (COCI17_programiranje) | C++14 | 39 ms | 7228 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;
typedef long long ll;
typedef pair<int,int> pii;
#define SIZE(x) (int)((x).size())
inline int readi(){
int x=0,f=1;char ch;ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int pre[26][50005];
int main(){
string S; cin >> S;
pre[S[0]-'a'][1]++;
for(int i=1; i<SIZE(S); i++){
for(int j=0;j<26;j++)pre[j][i+1]=pre[j][i];
pre[S[i]-'a'][i+1]++;
}
int Q=readi();
while(Q--){
int A=readi(), B=readi(), C=readi(), D=readi();
bool bad = 0;
for(int i=0; i<26; i++){
if(pre[i][B]-pre[i][A-1] != pre[i][D]-pre[i][C-1]){
bad = 1;
}
}
if(bad) puts("NE");
else puts("DA");
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |