Submission #3022833
Source Code Expand
#include <iostream> #include <cstdio> #include <algorithm> #include <cstring> #include <cmath> #include <map> using namespace std; const int Mo=998244353; map <string,int> f; inline int solve(string s) { if(s.empty()) return 1; if(f.count(s)) return f[s]; int &ret=f[s],n=s.size(); ret=solve(s.substr(1)); if(s[0]=='1') ret=(ret+ret)%Mo; for(int i=1;i<n;i++) { string x=s.substr(0,i); for(int j=i;j+i<=n;j+=i) { for(int k=0;k<i;k++) if(s[j+k]=='0') x[k]='0'; ret=(ret+1LL*solve(x)*solve(s.substr(j+i)))%Mo; } } return ret; } int main() { string s; cin>>s; cout<<solve(s); return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Encoding Subsets |
User | Anson |
Language | C++14 (GCC 5.4.1) |
Score | 1400 |
Code Size | 676 Byte |
Status | AC |
Exec Time | 1597 ms |
Memory | 5632 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1400 / 1400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_30.txt, subtask_1_31.txt, subtask_1_32.txt, subtask_1_33.txt, subtask_1_34.txt, subtask_1_35.txt, subtask_1_36.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
sample_04.txt | AC | 4 ms | 256 KB |
subtask_1_01.txt | AC | 1 ms | 256 KB |
subtask_1_02.txt | AC | 1 ms | 256 KB |
subtask_1_03.txt | AC | 1 ms | 256 KB |
subtask_1_04.txt | AC | 1 ms | 256 KB |
subtask_1_05.txt | AC | 1 ms | 256 KB |
subtask_1_06.txt | AC | 1 ms | 256 KB |
subtask_1_07.txt | AC | 1 ms | 256 KB |
subtask_1_08.txt | AC | 1 ms | 256 KB |
subtask_1_09.txt | AC | 1 ms | 256 KB |
subtask_1_10.txt | AC | 7 ms | 256 KB |
subtask_1_11.txt | AC | 9 ms | 384 KB |
subtask_1_12.txt | AC | 71 ms | 640 KB |
subtask_1_13.txt | AC | 44 ms | 512 KB |
subtask_1_14.txt | AC | 63 ms | 640 KB |
subtask_1_15.txt | AC | 37 ms | 384 KB |
subtask_1_16.txt | AC | 666 ms | 2432 KB |
subtask_1_17.txt | AC | 826 ms | 3328 KB |
subtask_1_18.txt | AC | 781 ms | 2560 KB |
subtask_1_19.txt | AC | 1368 ms | 4736 KB |
subtask_1_20.txt | AC | 11 ms | 256 KB |
subtask_1_21.txt | AC | 11 ms | 256 KB |
subtask_1_22.txt | AC | 51 ms | 384 KB |
subtask_1_23.txt | AC | 10 ms | 256 KB |
subtask_1_24.txt | AC | 41 ms | 384 KB |
subtask_1_25.txt | AC | 16 ms | 256 KB |
subtask_1_26.txt | AC | 55 ms | 384 KB |
subtask_1_27.txt | AC | 1343 ms | 4608 KB |
subtask_1_28.txt | AC | 1397 ms | 4864 KB |
subtask_1_29.txt | AC | 1472 ms | 5248 KB |
subtask_1_30.txt | AC | 1263 ms | 4352 KB |
subtask_1_31.txt | AC | 1351 ms | 4736 KB |
subtask_1_32.txt | AC | 1575 ms | 5632 KB |
subtask_1_33.txt | AC | 1553 ms | 5632 KB |
subtask_1_34.txt | AC | 1563 ms | 5632 KB |
subtask_1_35.txt | AC | 1552 ms | 5632 KB |
subtask_1_36.txt | AC | 1597 ms | 5632 KB |