Programiranje
레이팅 미적용의견: 0
Little Leticija is preparing for a programming exam. Even though she has solved a lot of
tasks, there’s one still left unsolved, so she is asking you for help. You are given the word S
and Q queries. In each query, you are given positive integers A, B, C and D. Let’s say that
word X consists of letters between positions A and B in word S, and word Y from letters
between positions C and D in word S. For each query, you must answer if it is possible to
somehow rearrange the letters in word Y and obtain word X.
In test cases worth 50% of total points, it will hold: 1 ≤ |\(S\)| ≤ 1000 and \(1 \le Q \le 1000\).
The first line of input contains the word S (1 ≤|S| ≤50 000). |S| denotes the number of
characters in word S, which consists of lowercase letters of the English alphabet. The
second line of input contains the positive integer Q (\(1 \le Q \le 50\,000\)).
Each of the following Q lines contains four integers A, B, C i D (\(1 \le A \le B\) ≤ |S| and \(1 \le C \le D\)
≤ |\(S\)| ) from the task.
For each query, output “DA” (Croatian for yes) if it is possible, and “NE” (Croatian for no) if it
is not.
kileanimal
2
2 2 7 7
1 4 6 7
DA
NE
abababba
2
3 5 1 3
1 2 7 8
DA
DA
vodevovode
2
5 8 3 6
2 5 3 6
NE
DA
평가 및 의견
Programiranje
Log in to rate problems.
아직 의견이 없습니다. 자격이 된다면 위 양식에서 가장 먼저 평가해 보세요.
풀이 제출
Programiranje