Submission #2125191
Source Code Expand
#include <iostream> #include <cstdio> #include <cstring> #include <vector> #define MOD (1000000007) using namespace std; const int MAXN = 105; typedef long long LL; int N, M, A[MAXN], minLen[MAXN], Belong[MAXN], Last[MAXN],KK,LLL; char S[MAXN]; LL Data[MAXN][MAXN], C[MAXN][MAXN], Fact[MAXN], factIne[MAXN], Ine[MAXN], Ans; inline void Init() { for(int I = 0; I <= 70; ++I)C[I][0] = 1; for(int I = 1; I <= 70; ++I) for(int J = 1; J <= I; ++J){ C[I][J] = C[I - 1][J] + C[I - 1][J - 1]; if(C[I][J] >= MOD)C[I][J] -= MOD; } Fact[1] = 1; Ine[1] = Ine[0] = 1; factIne[1] = factIne[0] = 1; for(int I = 2; I <= 70; ++I){ Fact[I] = Fact[I - 1] * I % MOD; Ine[I] = (LL)(MOD - MOD / I) * Ine[MOD % I] % MOD; factIne[I] = (LL)factIne[I - 1] * Ine[I] % MOD; } } inline bool Check(vector<int> Seq) { memset(Belong, -1, sizeof(Belong)); memset(Last, 0, sizeof(Last)); int Size = Seq.size(), P = 0; if(!Size)return false; for(int I = 1; I <= M; ++I){ if(S[I] == 'r'){ Belong[I] = P; Last[P] = I; ++P; if(P == Size)break; } } if(P < Size)return false; P = 0; while(!Seq[Size - 1])--Size; if(!Size)return true; for(int I = 1; I <= M; ++I){ if(S[I] == 'b' && I > Last[P]){ Belong[I] = P; ++P; if(P == Size)break; } } if(P < Size)return false; int Free = 0; for(int I = M; I; --I){ if(Belong[I] == -1)++Free; else if(S[I] == 'b'){ int Need = Seq[Belong[I]] + 1 - 2; if(Need > Free)return false; Free -= Need; } } return true; } inline void Calc(int Len, vector<int> Seq, vector<LL> V) { /* cout<<"Working..."<<endl; for(int I = 1; I <= N; ++I)cout<<V[I]<<" "; cout<<endl;*/ LL Now = 0; int Size = Seq.size(); for(int X = Len; X <= N; ++X){ int Left = N - (Size - 1) - X; Now += (LL)V[X] * C[Left + Size][Size] % MOD; if(Now >= MOD) Now -= MOD; } int Cnt[MAXN] = {0}; for(int I = 0; I < Size; ++I)++Cnt[Seq[I]]; Now = Now * Fact[Size] % MOD; for(int I = 0; I <= M; ++I) if(Cnt[I] > 1)Now = Now * factIne[Cnt[I]] % MOD; Ans += Now; if(Ans >= MOD)Ans -= MOD; } void Dfs(int Len, int Rest, int maxSpace, vector<int> Seq, vector<LL> V, bool needCalc, int Tot) { if(needCalc && Check(Seq))Calc(Tot, Seq, V),++KK; if(Len < 0)return; Dfs(Len - 1, Rest, maxSpace, Seq, V, 0, Tot); if(Len + 1 > Rest || minLen[Len] > maxSpace)return; vector<LL> newV(MAXN); for(int I = 0; I <= 70; ++I){ if(V[I]){ for(int J = I + minLen[Len]; J <= N; ++J){ newV[J] += (LL)V[I] * Data[Len][J - I] % MOD; if(newV[J] >= MOD)newV[J] -= MOD; } } } Seq.push_back(Len); Dfs(Len, Rest - Len - 1, maxSpace - minLen[Len] - 1, Seq, newV, 1, Tot + minLen[Len]); } int main() { Init(); scanf("%d%d", &N, &M); scanf("%s", S + 1); for(int I = 1; I <= N; ++I) Data[0][I] = 1; minLen[0] = 1; for(int I = 1; I <= N; ++I){ int T[5] = {I * 2 - 1, I * 2, I * 2, I * 2 + 1}; minLen[I] = T[0]; if(T[0] > N)break; for(int J = 0; J < 5; ++J) for(int K = T[J]; K <= N; ++K){ Data[I][K] += C[K - 1][T[J] - 1]; if(Data[I][K] >= MOD) Data[I][K] -= MOD; } } vector<int> V1; vector<LL> V2(MAXN); V2[0] = 1; Dfs(N, M, N, V1, V2, 0, 0); cout << (Ans + 1) % MOD; return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - ColoringBalls |
User | DFPMTS |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 3291 Byte |
Status | WA |
Exec Time | 1192 ms |
Memory | 512 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:107:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d", &N, &M); ^ ./Main.cpp:108:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%s", S + 1); ^
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 1100 | ||||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt |
All | 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt, 1_021.txt, 1_022.txt, 1_023.txt, 1_024.txt, 1_025.txt, 1_026.txt, 1_027.txt, 1_028.txt, 1_029.txt, 1_030.txt, 1_031.txt, 1_032.txt, 1_033.txt, 1_034.txt, 1_035.txt, 1_036.txt, 1_037.txt, 1_038.txt, 1_039.txt, 1_040.txt, 1_041.txt, 1_042.txt, 1_043.txt, 1_044.txt, 1_045.txt, 1_046.txt, 1_047.txt, 1_048.txt, 1_049.txt, 1_050.txt, 1_051.txt, 1_052.txt, 1_053.txt, 1_054.txt, 1_055.txt, 1_056.txt, 1_057.txt, 1_058.txt, 1_059.txt, 1_060.txt, 1_061.txt, 1_062.txt, 1_063.txt, 1_064.txt, 1_065.txt, 1_066.txt, 1_067.txt, 1_068.txt, 1_069.txt, 1_070.txt, 1_071.txt, 1_072.txt, 1_073.txt, 1_074.txt, 1_075.txt, 1_076.txt, 1_077.txt, 1_078.txt, 1_079.txt, 1_080.txt, 1_081.txt, 1_082.txt, 1_083.txt, 1_084.txt, 1_085.txt, 1_086.txt, 1_087.txt, 1_088.txt, 1_089.txt, 1_090.txt, 1_091.txt, 1_092.txt, 1_093.txt, 1_094.txt, 1_095.txt, 1_096.txt, 1_097.txt, 1_098.txt, 1_099.txt, 1_100.txt, 1_101.txt, 1_102.txt, 1_103.txt, 1_104.txt, 1_105.txt, 1_106.txt, 1_107.txt, 1_108.txt, 1_109.txt, 1_110.txt, 1_111.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_000.txt | AC | 1 ms | 384 KB |
0_001.txt | AC | 1 ms | 384 KB |
0_002.txt | AC | 1 ms | 384 KB |
0_003.txt | WA | 1158 ms | 512 KB |
1_004.txt | AC | 1 ms | 384 KB |
1_005.txt | AC | 1 ms | 384 KB |
1_006.txt | AC | 1 ms | 384 KB |
1_007.txt | AC | 1 ms | 384 KB |
1_008.txt | AC | 1 ms | 384 KB |
1_009.txt | AC | 1 ms | 384 KB |
1_010.txt | AC | 1 ms | 384 KB |
1_011.txt | AC | 1 ms | 384 KB |
1_012.txt | AC | 1 ms | 384 KB |
1_013.txt | WA | 1 ms | 384 KB |
1_014.txt | WA | 1 ms | 384 KB |
1_015.txt | AC | 1 ms | 384 KB |
1_016.txt | AC | 1 ms | 384 KB |
1_017.txt | WA | 1 ms | 384 KB |
1_018.txt | WA | 1 ms | 384 KB |
1_019.txt | WA | 1 ms | 384 KB |
1_020.txt | AC | 1 ms | 384 KB |
1_021.txt | AC | 1 ms | 384 KB |
1_022.txt | WA | 1 ms | 384 KB |
1_023.txt | WA | 1 ms | 384 KB |
1_024.txt | AC | 1 ms | 384 KB |
1_025.txt | AC | 1 ms | 384 KB |
1_026.txt | WA | 1 ms | 384 KB |
1_027.txt | WA | 1 ms | 384 KB |
1_028.txt | WA | 1 ms | 384 KB |
1_029.txt | WA | 1 ms | 384 KB |
1_030.txt | AC | 1 ms | 384 KB |
1_031.txt | AC | 1 ms | 384 KB |
1_032.txt | AC | 1 ms | 384 KB |
1_033.txt | AC | 1 ms | 384 KB |
1_034.txt | AC | 1 ms | 384 KB |
1_035.txt | AC | 1 ms | 384 KB |
1_036.txt | AC | 1 ms | 384 KB |
1_037.txt | AC | 1 ms | 384 KB |
1_038.txt | AC | 1 ms | 384 KB |
1_039.txt | AC | 1 ms | 384 KB |
1_040.txt | WA | 10 ms | 384 KB |
1_041.txt | WA | 9 ms | 384 KB |
1_042.txt | AC | 8 ms | 384 KB |
1_043.txt | AC | 8 ms | 384 KB |
1_044.txt | WA | 9 ms | 384 KB |
1_045.txt | WA | 10 ms | 384 KB |
1_046.txt | WA | 10 ms | 384 KB |
1_047.txt | AC | 10 ms | 384 KB |
1_048.txt | AC | 8 ms | 384 KB |
1_049.txt | WA | 256 ms | 384 KB |
1_050.txt | WA | 198 ms | 384 KB |
1_051.txt | AC | 176 ms | 384 KB |
1_052.txt | AC | 160 ms | 384 KB |
1_053.txt | WA | 241 ms | 384 KB |
1_054.txt | WA | 255 ms | 384 KB |
1_055.txt | WA | 221 ms | 384 KB |
1_056.txt | WA | 231 ms | 384 KB |
1_057.txt | AC | 165 ms | 384 KB |
1_058.txt | AC | 1 ms | 384 KB |
1_059.txt | AC | 1 ms | 384 KB |
1_060.txt | AC | 1 ms | 384 KB |
1_061.txt | AC | 1 ms | 384 KB |
1_062.txt | AC | 1 ms | 384 KB |
1_063.txt | AC | 1 ms | 384 KB |
1_064.txt | AC | 1 ms | 384 KB |
1_065.txt | AC | 1 ms | 384 KB |
1_066.txt | AC | 1 ms | 384 KB |
1_067.txt | WA | 69 ms | 512 KB |
1_068.txt | WA | 61 ms | 512 KB |
1_069.txt | AC | 55 ms | 512 KB |
1_070.txt | AC | 53 ms | 512 KB |
1_071.txt | WA | 59 ms | 512 KB |
1_072.txt | WA | 67 ms | 512 KB |
1_073.txt | WA | 69 ms | 512 KB |
1_074.txt | AC | 62 ms | 512 KB |
1_075.txt | AC | 54 ms | 512 KB |
1_076.txt | WA | 735 ms | 512 KB |
1_077.txt | WA | 533 ms | 512 KB |
1_078.txt | AC | 521 ms | 512 KB |
1_079.txt | AC | 462 ms | 512 KB |
1_080.txt | WA | 558 ms | 512 KB |
1_081.txt | WA | 707 ms | 512 KB |
1_082.txt | WA | 729 ms | 512 KB |
1_083.txt | WA | 732 ms | 512 KB |
1_084.txt | AC | 474 ms | 512 KB |
1_085.txt | AC | 1 ms | 384 KB |
1_086.txt | AC | 1 ms | 512 KB |
1_087.txt | AC | 1 ms | 384 KB |
1_088.txt | AC | 1 ms | 384 KB |
1_089.txt | AC | 1 ms | 512 KB |
1_090.txt | AC | 1 ms | 384 KB |
1_091.txt | AC | 1 ms | 512 KB |
1_092.txt | AC | 1 ms | 384 KB |
1_093.txt | AC | 1 ms | 384 KB |
1_094.txt | WA | 248 ms | 512 KB |
1_095.txt | WA | 224 ms | 512 KB |
1_096.txt | AC | 215 ms | 512 KB |
1_097.txt | AC | 211 ms | 512 KB |
1_098.txt | WA | 227 ms | 512 KB |
1_099.txt | WA | 244 ms | 512 KB |
1_100.txt | WA | 244 ms | 512 KB |
1_101.txt | WA | 245 ms | 512 KB |
1_102.txt | AC | 213 ms | 512 KB |
1_103.txt | WA | 1192 ms | 512 KB |
1_104.txt | WA | 1112 ms | 512 KB |
1_105.txt | AC | 931 ms | 512 KB |
1_106.txt | AC | 874 ms | 512 KB |
1_107.txt | WA | 1158 ms | 512 KB |
1_108.txt | WA | 1188 ms | 512 KB |
1_109.txt | WA | 1176 ms | 512 KB |
1_110.txt | WA | 1164 ms | 512 KB |
1_111.txt | AC | 895 ms | 512 KB |