|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|5 초||512 MB||2||2||2||100.000%|
The stone-picking game Nim is very famous all over the world for its quite simple rules. Initially, there are several piles of stones. Two players take turns to remove at least one stone from one of the piles. Whoever cannot make any legal move loses the game.
On August 17th, a very special day, Rounddog and Calabash create another stone-picking game of their own. The new rules are as follows.
At start, Calabash takes out a string S from his right pocket as the keystone of their game, which has m rounds in total.
At the beginning of each round, their common friend Severus will select a substring T from S. Then, before they actually start playing, there are three more preparation phases.
In Phase 1, Calabash will select one or more distinct substrings from S such that they all have suffix T. For example, “ris” is a suffix of “claris”. A string is considered to be a suffix of itself.
Phase 2 requires some magical power. Calabash will turn all strings he selects to stone piles. Specifically, for each string X he chooses, it will become a pile of Wp stones, where p is the number of occurrences of X in S. For example, X = “aba” occurs in S = “ababa” twice, so it will turn into a pile of two stones.
Rounddog will be in charge of Phase 3. After Severus and Calabash make their moves, Rounddog chooses some piles from Calabash’s selection, and throws them away. But Rounddog can’t throw all the piles Calabash selected, because then the game will end immediately.
With the remaining piles, Rounddog and Calabash will start playing the classic Nim game. Calabash always moves first.
Now, our beloved Quailty wants to know whether Calabash will win in each round if he and Rounddog both play optimally. Furthermore, he also wants you to calculate the maximum total number of stones Calabash can create in Phase 2 so that he still wins if both players play optimally.
The input contains several test cases, and the first line contains a single integer T (1 ≤ T ≤ 3), the number of test cases.
In each test case, the first line contains an integer n (1 ≤ n ≤ 100 000).
The second line contains a string S of length n consisting of lowercase English letters.
The third line contains n integers, i-th of which is Wi (1 ≤ Wi < 258).
The fourth line contains an integer m (1 ≤ m ≤ 200 000), representing the number of rounds.
Each of the next m lines contains two integers l and r (1 ≤ l ≤ r ≤ n) meaning that in this round, Severus will select S[l, r] as the string T.
For each test case, output m lines, one for each round. On each line, print the maximum total number of stones Calabash can create in Phase 2 of that round so that he still wins if both players play optimally, or −1 if he always loses.
1 5 aabab 1 3 5 7 9 5 1 1 1 2 2 2 2 3 3 5
6 1 6 4 1