oj.uz

Submission #83628

# Submission time Handle Problem Language Result Execution time Memory
83628 2018-11-09T13:52:41 Z charlies_moo Mate (COCI18_mate) PyPy
0 / 100
 36 ms 11696 KB 
s = raw_input()
q = input()


def combination(n, d):
    k = d - 2
    if n - k < k:
        k = n - k
    result = 1
    for i in range(k):
        result *= n
        n -= 1
    w = k
    for i in range(w):
        result /= k
        k -= 1
    return result


def mod(num):
    return num % (10**9+7)


def lst_id(letter):
    return ord(letter) - ord("a")



arr = [[0 for i in range(26)] for i in range(len(s))]
arr_c = [0 for i in range(26)]



try:
    for i in range(len(s)-1, -1, -1):
        for j in range(26):
            arr[i][j] = arr_c[j]
        arr_c[lst_id(s[i])] += 1



    arr_r = []
    for i in range(q):
        d, xy = raw_input().split()
        total = 0
        d = int(d)
        x = xy[0]
        y = xy[1]
        for i in range(len(s)):
            if s[i] == x and i >= d - 2:
                total += combination(i, d) * arr[i][lst_id(y)]
        arr_r.append(mod(total))

    for ans in arr_r:
        print ans


except:
    pass

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 33 ms 11240 KB Output isn't correct
2 Incorrect 33 ms 11300 KB Output isn't correct
3 Incorrect 33 ms 11416 KB Output isn't correct
4 Incorrect 34 ms 11456 KB Output isn't correct
5 Incorrect 34 ms 11552 KB Output isn't correct
6 Incorrect 34 ms 11552 KB Output isn't correct
7 Incorrect 34 ms 11556 KB Output isn't correct
8 Incorrect 34 ms 11556 KB Output isn't correct
9 Incorrect 36 ms 11696 KB Output isn't correct
10 Incorrect 35 ms 11696 KB Output isn't correct