oj.uz

답안 #147115

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
147115 2019-08-27T14:19:23 Z SeekingOblivion Mate (COCI18_mate) C++14
80 / 100
 2000 ms 28992 KB 
//#include<fstream>
#include<queue>
#include<iostream>
#include<algorithm>
#define mod 1000000007
#define fin cin
#define fout cout
using namespace std;
//ifstream fin("date.in");
//ofstream fout("date.out");
char c[2010],a,b;
int q,i,j,n,l,s,v[2010][2010],d[2010][26],sol[2010][26][26],f[26];
int main()
{
    fin>>c;
    for(i=0;c[i]!=0;i++);n=i;
    for(i=n-1;i>=0;i--)
    {
        for(j=0;j<='z'-'a';j++) d[i][j]=f[j];
        f[c[i]-'a']++;
    }
    for(i=0;i<=n;i++)
    {
        v[i][0]=1;
        for(j=1;j<=i;j++)
        {
            v[i][j]=v[i-1][j]+v[i-1][j-1];
            if(v[i][j]>=mod) v[i][j]-=mod;
        }
    }
    for(s=2;s<=n;s++)
        for(i=s-2;i<n;i++)
            for(j=0;j<='z'-'a';j++)
                {
                    sol[s][c[i]-'a'][j]+=(1LL*v[i][s-2]*d[i][j])%mod;
                    if(sol[s][c[i]-'a'][j]>=mod) sol[s][c[i]-'a'][j]-=mod;
                }
    fin>>q;
    for(i=1;i<=q;i++)
    {
        fin>>l;
        fin>>a>>b;
        fout<<sol[l][a-'a'][b-'a']<<"\n";
    }
    return 0;
}

Compilation message

mate.cpp: In function 'int main()':
mate.cpp:16:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
     for(i=0;c[i]!=0;i++);n=i;
     ^~~
mate.cpp:16:26: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
     for(i=0;c[i]!=0;i++);n=i;
                          ^

Subtask #1
80.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 91 ms 1016 KB Output is correct
2 Correct 59 ms 760 KB Output is correct
3 Correct 70 ms 888 KB Output is correct
4 Correct 118 ms 988 KB Output is correct
5 Correct 423 ms 3576 KB Output is correct
6 Correct 484 ms 3916 KB Output is correct
7 Correct 370 ms 3396 KB Output is correct
8 Correct 330 ms 3272 KB Output is correct
9 Execution timed out 2023 ms 28992 KB Time limit exceeded
10 Execution timed out 2013 ms 28824 KB Time limit exceeded