# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
40080 | Hebisuke | Programiranje (COCI17_programiranje) | C++14 | 48 ms | 6448 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 "stdio.h"
#include "string.h"
int q,l,co[50100][27],a,b,c,d;
char w[50500];
main()
{
scanf("%s",w);
l = strlen(w);
scanf("%d",&q);
for(int i=1;i<=l;i++)
{
for(int j=0;j<26;j++) co[i][j]=co[i-1][j];
co[i][w[i-1]-'a']++;
}
for(int i=0;i<q;i++)
{
scanf("%d %d %d %d",&a,&b,&c,&d);
int ch=1;
for(int j=0;j<26;j++)
if(co[b][j]-co[a-1][j]!=co[d][j]-co[c-1][j]) {ch=0;break;}
if(ch) printf("DA\n");
else printf("NE\n");
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |