CF1111D.Destroy the Colony

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

There is a colony of villains with several holes aligned in a row, where each hole contains exactly one villain.

Each colony arrangement can be expressed as a string of even length, where the ii -th character of the string represents the type of villain in the ii -th hole.

Iron Man can destroy a colony only if the colony arrangement is such that all villains of a certain type either live in the first half of the colony or in the second half of the colony.

His assistant Jarvis has a special power. It can swap villains of any two holes, i.e. swap any two characters in the string; he can do this operation any number of times.

Now Iron Man asks Jarvis qq questions. In each question, he gives Jarvis two numbers xx and yy . Jarvis has to tell Iron Man the number of distinct colony arrangements he can create from the original one using his powers such that all villains having the same type as those originally living in xx -th hole or yy -th hole live in the same half and the Iron Man can destroy that colony arrangement.

Two colony arrangements are considered to be different if there exists a hole such that different types of villains are present in that hole in the arrangements.

输入格式

The first line contains a string ss ( 2s1052 \le |s| \le 10^{5} ), representing the initial colony arrangement. String ss can have both lowercase and uppercase English letters and its length is even.

The second line contains a single integer qq ( 1q1051 \le q \le 10^{5} ) — the number of questions.

The ii -th of the next qq lines contains two integers xix_i and yiy_i ( 1xi,yis1 \le x_i, y_i \le |s| , xiyix_i \ne y_i ) — the two numbers given to the Jarvis for the ii -th question.

输出格式

For each question output the number of arrangements possible modulo 109+710^9+7 .

输入输出样例

  • 输入#1

    abba
    2
    1 4
    1 2
    

    输出#1

    2
    0
    
  • 输入#2

    AAaa
    2
    1 2
    1 3
    

    输出#2

    2
    0
    
  • 输入#3

    abcd
    1
    1 3
    

    输出#3

    8
    

说明/提示

Consider the first example. For the first question, the possible arrangements are "aabb" and "bbaa", and for the second question, index 11 contains 'a' and index 22 contains 'b' and there is no valid arrangement in which all 'a' and 'b' are in the same half.

首页