Passionate Palindromes
Time Limit: 2 sec
Memory Limit: 256 MB
Attempts: 77
Accuracy: 2.60%
Author: Abhishek Sajwan
You are given a string S.
There are Q queries of the type -
i j - Print the total number of palindromic substrings in the string S[i]S[i+1]....S[j-1]S[j]
Constraints:
1<=Size of String S<=1000
1<=Q<=50000
Input:
First line contains S.
Next line contains Q(number of queries)
Next Q lines contain i and j
Note: String 'S' contains only small case alphabets and 'i' and 'j' are 0-indexed
Output:
Q lines should contain the answers to the corresponding queries
Sample Input:
abaaba
2
0 2
4 4
Sample Output:
4
1
ID
SUBMITTED AT
STATUS
LANGUAGE
TIME
MEMORY USED
USER
TIME
STATUS
LANGUAGE
TIME
MEMORY USED
2 years ago
cpp14
0.00 sec
0 KB
2 years ago
cpp14
0.00 sec
0 KB
3 years ago
c
0.00 sec
0 KB
3 years ago
java
0.00 sec
0 KB
3 years ago
java
0.00 sec
0 KB
3 years ago
java
0.00 sec
0 KB
3 years ago
java
0.00 sec
0 KB
3 years ago
java
0.00 sec
0 KB
3 years ago
java
0.00 sec
0 KB
3 years ago
java
0.00 sec
0 KB
3 years ago
java
0.00 sec
0 KB
3 years ago
java
0.00 sec
0 KB
3 years ago
java
0.00 sec
0 KB
3 years ago
java
0.00 sec
0 KB
4 years ago
java
0.14 sec
448 KB
4 years ago
cpp
0.07 sec
64 KB
4 years ago
cpp
0.00 sec
0 KB
4 years ago
cpp
0.32 sec
8200 KB
4 years ago
cpp
0.07 sec
64 KB
4 years ago
cpp
0.07 sec
64 KB
4 years ago
cpp
0.07 sec
64 KB
4 years ago
cpp
0.07 sec
64 KB
4 years ago
cpp14
0.07 sec
64 KB
4 years ago
cpp14
0.07 sec
64 KB
4 years ago
cpp14
0.07 sec
64 KB
4 years ago
java
0.14 sec
428 KB
4 years ago
java
0.00 sec
0 KB
4 years ago
java
0.12 sec
428 KB
4 years ago
java
0.00 sec
0 KB
4 years ago
java
0.00 sec
0 KB
4 years ago
java
0.00 sec
0 KB
4 years ago
java
0.12 sec
428 KB
4 years ago
cpp
0.16 sec
31804 KB