# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
471508 | rainboy | Programiranje (COCI17_programiranje) | C11 | 33 ms | 6616 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>
#define N 50000
#define A 26
int main() {
static char cc[N + 1];
static int kk[A][N];
int n, q, a, i;
scanf("%s", cc), n = strlen(cc);
for (a = 0; a < A; a++)
for (i = 0; i < n; i++)
kk[a][i] = (i == 0 ? 0 : kk[a][i - 1]) + (cc[i] == a + 'a' ? 1 : 0);
scanf("%d", &q);
while (q--) {
int l1, r1, l2, r2, da;
scanf("%d%d%d%d", &l1, &r1, &l2, &r2), l1--, r1--, l2--, r2--;
da = 1;
for (a = 0; a < A; a++)
if (kk[a][r1] - (l1 == 0 ? 0 : kk[a][l1 - 1]) != kk[a][r2] - (l2 == 0 ? 0 : kk[a][l2 - 1])) {
da = 0;
break;
}
printf(da ? "DA\n" : "NE\n");
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |