제출 #143649

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
143649	2019-08-14 19:44:10	vladciuperceanu	Mate (COCI18_mate)	C++14	10 / 100	2069 ms	57608 KiB

mate

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <iostream>
#include <cstring>
#define MOD 1000000007
using namespace std;
long long Q,d,i,j,comb[2005][2005],D[2005][30][30];
long long r[2005][30],poz[30][2005],sol[2005][30][30];
char s[2005],x,y;
int main()
{
    cin >> (s+1);
    int n = strlen((s+1));
    comb[0][0] = 1;
    for (i=1; i<=n; i++)
    {
        comb[i][0] = comb[i][i] = 1;
        for (j=1; j<i; j++)
            comb[i][j] = (comb[i-1][j-1]+comb[i-1][j])%MOD;
    }
    for (i=1; i<=n; i++)
        poz[s[i]-'a'][++poz[s[i]-'a'][0]] = i;
    for (i=n; i>=1; i--)
        for (j=0; j<26; j++)
            if (s[i] == 'a'+j)
                r[i][j] = 1+r[i+1][j];
            else
                r[i][j] = r[i+1][j];
    for (i=n; i>=1; i--)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 100