QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#645584 | #9463. 基础 ABC 练习题 | Nesraychan | 47.5 | 2990ms | 5024kb | C++14 | 2.2kb | 2024-10-16 19:04:30 | 2024-10-16 19:04:31 |
Judging History
answer
#include<bits/stdc++.h>
#define IL inline
#define reg register
#define N 65
#define u32 unsigned
IL int read()
{
reg int x=0; reg char ch=getchar();
while(ch<'0'||ch>'9')ch=getchar();
while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
return x;
}
int testid,testcnt,n,m;
char s1[N],s2[N],s[N*3];
int sa[N],sb[N],ma,mb;
u32 f[N][N][N],ans;
IL bool chk(reg int p,reg char c)
{
if(s[p]=='?')return 1;
return s[p]==c;
}
std::vector<std::pair<int,int>>limit;
IL void dp(reg u32 k)
{
bool ok=1;
for(auto &[x,y]:limit)ok&=x+y<=n;
if(!ok)return;
memset(f,0,sizeof(f));
u32 w; f[0][0][0]=k;
for(reg int a=0,b,c;a<=n;++a)for(b=0;b<=n;++b)for(c=0;c<=n;++c)if(w=f[a][b][c])
{
if(a<n&&chk(a+b+c+1,'A'))
{
bool ok=1;
for(auto &[x,y]:limit)
{
reg int z=n-x-y;
ok&=c>=a-x+1;
}
if(ok)f[a+1][b][c]+=w;
}
if(b<n&&chk(a+b+c+1,'B'))
{
bool ok=1;
for(auto &[x,y]:limit)
{
reg int z=n-x-y;
ok&=a>=b-y+1;
}
if(ok)f[a][b+1][c]+=w;
}
if(c<n&&chk(a+b+c+1,'C'))
{
bool ok=1;
for(auto &[x,y]:limit)
{
reg int z=n-x-y;
ok&=b>=c-z+1;
}
if(ok)f[a][b][c+1]+=w;
}
}
ans+=f[n][n][n];
}
IL void work()
{
n=read(),m=n*3,ans=ma=mb=0;
scanf("%s%s%s",s1,s2,s+1);
if(n!=55)
{
puts("-1");
return;
}
for(reg int i=0;i<=n;++i)
{
if(s1[i]=='1')sa[++ma]=i;
if(s2[i]=='1')sb[++mb]=i;
}
for(reg int i=1,j;i<=ma;++i)for(j=1;j<=mb;++j)
{
limit.clear();
limit.push_back({sa[i],sb[j]});
dp(1);
}
for(reg int i=1,j;i<=ma;++i)for(j=1;j<mb;++j)
{
limit.clear();
limit.push_back({sa[i],sb[j]});
limit.push_back({sa[i],sb[j+1]});
dp(-1);
}
for(reg int i=1,j;i<ma;++i)for(j=1;j<=mb;++j)
{
limit.clear();
limit.push_back({sa[i],sb[j]});
limit.push_back({sa[i+1],sb[j]});
dp(-1);
}
for(reg int i=1,j;i<ma;++i)for(j=1;j<mb;++j)
{
limit.clear();
limit.push_back({sa[i],sb[j]});
limit.push_back({sa[i],sb[j+1]});
limit.push_back({sa[i+1],sb[j]});
limit.push_back({sa[i+1],sb[j+1]});
dp(1);
}
printf("%u\n",ans);
}
main()
{
testcnt=read(),testid=read();
while(testcnt--)work();
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 19
Acceptable Answer
Test #1:
score: 19
Acceptable Answer
time: 764ms
memory: 4884kb
input:
60 1 1 11 11 ABC 2 111 111 CABABC 3 1111 1111 CAABBCBAC 4 11111 11111 BACBBACBACAC 5 111111 111111 CABCCBBAABCCBAA 6 1111111 1111111 ABABABCACBCBCCACBA 7 11111111 11111111 BCAABACBBCBBABCCAACAC 8 111111111 111111111 CCBCBBBCAABCBCAAAAACBCBA 9 1111111111 1111111111 CCCCACABCBABAABCCAABABBCBBA 10 1111...
output:
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1
result:
points 0.95 the max n you choose to answer is 55
Test #2:
score: 19
Acceptable Answer
time: 771ms
memory: 4896kb
input:
60 1 1 11 11 CBA 2 111 111 BACACB 3 1111 1111 BCBCACABA 4 11111 11111 CCBACABBBCAA 5 111111 111111 BCACBBABBCCAACA 6 1111111 1111111 BBCBACCAACBCBCAABA 7 11111111 11111111 ACBCCBBAABAABCACCACBB 8 111111111 111111111 BAACACBACCCBAACCBABABBCB 9 1111111111 1111111111 BABCBCAAAAABBCCCACBCBBABACC 10 1111...
output:
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1
result:
points 0.95 the max n you choose to answer is 55
Test #3:
score: 19
Acceptable Answer
time: 774ms
memory: 4920kb
input:
60 1 1 11 11 BCA 2 111 111 BCABCA 3 1111 1111 CBACCAABB 4 11111 11111 BACBCBBCCAAA 5 111111 111111 BCCCBABACCBABAA 6 1111111 1111111 ACAACBABABBCACBCCB 7 11111111 11111111 BBBCABCCCAABCACBACAAB 8 111111111 111111111 ACCACAABACBAABBCBCBBACBC 9 1111111111 1111111111 BCCBACBBACCCBCCAABAACABAABB 10 1111...
output:
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1
result:
points 0.95 the max n you choose to answer is 55
Test #4:
score: 19
Acceptable Answer
time: 781ms
memory: 4984kb
input:
60 1 1 11 11 BCA 2 111 111 ACABCB 3 1111 1111 BABCABCCA 4 11111 11111 CCABACABBACB 5 111111 111111 ABBBCBBCACCAACA 6 1111111 1111111 CACBABCABCCBABAACB 7 11111111 11111111 BACBCABACBBCCCBAAACAB 8 111111111 111111111 CABABBCAACABCBACBABACBCC 9 1111111111 1111111111 BCBAACBABABCBACBABABCCACACC 10 1111...
output:
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1
result:
points 0.95 the max n you choose to answer is 55
Test #5:
score: 19
Acceptable Answer
time: 765ms
memory: 4980kb
input:
60 1 1 11 11 ABC 2 111 111 BBCACA 3 1111 1111 ACBBCBAAC 4 11111 11111 ABACACCCABBB 5 111111 111111 ACCCCCAAABABBBB 6 1111111 1111111 ABAABBBBCCCCCCAABA 7 11111111 11111111 ACBBBACCCCCCAABABBBAA 8 111111111 111111111 CAAABAAACCCCBBCBBBCACBAB 9 1111111111 1111111111 ABAAACBBCCCCCCCBAAABAACBBBB 10 1111...
output:
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1
result:
points 0.95 the max n you choose to answer is 55
Test #6:
score: 19
Acceptable Answer
time: 767ms
memory: 4980kb
input:
60 1 1 11 11 BCA 2 111 111 ACCBAB 3 1111 1111 BACCACBBA 4 11111 11111 AAABBCBCBACC 5 111111 111111 AABBBBCCBCCAACA 6 1111111 1111111 AAACCBCCCAABACBBBB 7 11111111 11111111 AAACACCACBBAABBCBCCBB 8 111111111 111111111 AAACAAABBBBBBBCBACCCACCC 9 1111111111 1111111111 BBCCACCCACCACCBAABBAAAABBBB 10 1111...
output:
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 -1 -1 -1 -1
result:
points 0.95 the max n you choose to answer is 55
Test #7:
score: 19
Acceptable Answer
time: 772ms
memory: 4960kb
input:
60 1 1 11 11 BCA 2 111 111 ACCABB 3 1111 1111 CAABBBCAC 4 11111 11111 BBCCBCCABAAA 5 111111 111111 BAABBBCCCCCAABA 6 1111111 1111111 AACACCCCBABBBCAABB 7 11111111 11111111 AACBBCBBBCCCCCAAABBAA 8 111111111 111111111 AAAABBCBBBBCBBCCCCCCAAAA 9 1111111111 1111111111 ABBBBBBBBCCBCAACCACAACCAAAC 10 1111...
output:
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 -1 -1 -1 -1
result:
points 0.95 the max n you choose to answer is 55
Test #8:
score: 19
Acceptable Answer
time: 776ms
memory: 4984kb
input:
60 1 1 11 11 ABC 2 111 111 AABCBC 3 1111 1111 ABAACBBCC 4 11111 11111 AABCCBBBCACA 5 111111 111111 AAACCABBBACBCCB 6 1111111 1111111 AABBBBBBCCACAACACC 7 11111111 11111111 AAAABBBBBBCCACCCCCBAA 8 111111111 111111111 ACCBABBABBBBBCCCACCCAAAA 9 1111111111 1111111111 BAAAABCCCCCCCBBAABAACABCBBB 10 1111...
output:
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1
result:
points 0.95 the max n you choose to answer is 55
Test #9:
score: 19
Acceptable Answer
time: 778ms
memory: 4980kb
input:
60 1 1 11 11 CAB 2 111 111 CCAABB 3 1111 1111 ACCCABBAB 4 11111 11111 AAABBBBCCACC 5 111111 111111 BCACCCCBAAAABBB 6 1111111 1111111 CAAACABABACCCBCBBB 7 11111111 11111111 ACAAACBCCCCBCAABBABBB 8 111111111 111111111 ACCAACACCCCCABABAABBBBBB 9 1111111111 1111111111 AACAAAAAACBCCBCBACBBBBBBCCC 10 1111...
output:
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 -1 -1 -1 -1
result:
points 0.95 the max n you choose to answer is 55
Test #10:
score: 19
Acceptable Answer
time: 769ms
memory: 4840kb
input:
60 1 1 11 11 BCA 2 111 111 ACACBB 3 1111 1111 AABCCCABB 4 11111 11111 CBCCCABABABA 5 111111 111111 ACACCCAABBCBABB 6 1111111 1111111 BACAAAACCBABCBCBCB 7 11111111 11111111 AAAAABBBBCCBBCCCCACAB 8 111111111 111111111 AACCCCCCABAAACAABCBBBBBB 9 1111111111 1111111111 AABAAAABCCCCABCCCABBCCABBBB 10 1111...
output:
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 -1 -1 -1 -1
result:
points 0.95 the max n you choose to answer is 55
Test #11:
score: 19
Acceptable Answer
time: 769ms
memory: 4980kb
input:
60 1 1 11 11 BCA 2 111 111 CBBCAA 3 1111 1111 AABABCCCB 4 11111 11111 BABCBBCAAACC 5 111111 111111 AAACBBBBBCAACCC 6 1111111 1111111 BBBBBCCCCCCAABAAAA 7 11111111 11111111 BAAAABAACCCABBCCBBBCC 8 111111111 111111111 ABABBBBBCBCCCACCCCAAABAA 9 1111111111 1111111111 AAAABBAABCABACCCACCCBBCBCBB 10 1111...
output:
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1
result:
points 0.95 the max n you choose to answer is 55
Subtask #2:
score: 19
Acceptable Answer
Dependency #1:
95%
Acceptable Answer
Test #12:
score: 19
Acceptable Answer
time: 150ms
memory: 4980kb
input:
60 2 1 01 11 ABC 2 101 001 ACBABC 3 0011 1000 AAACBBCBC 4 11100 00100 BACABCABACBC 5 001101 110010 ACBABCCABBCCAAB 6 0101010 1000011 CABBAAACACBBCCABCB 7 10010111 10100111 CABAAACBBAACBCACBBBCC 8 100101000 100000110 BACBCACBBAABCCCABCBAACBA 9 1100010100 0111110011 CAABCBBABCACBCACABCABAACBBC 10 0001...
output:
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1
result:
points 0.95 the max n you choose to answer is 55
Test #13:
score: 19
Acceptable Answer
time: 167ms
memory: 4844kb
input:
60 2 1 01 01 CAB 2 011 101 ABCCBA 3 1111 0000 CBBAACCBA 4 00011 10011 BCCBCCABABAA 5 011111 111011 ACBBABCBCCAACBA 6 1011101 1101000 CBABBCACBAABABCACC 7 00001111 11010100 BCACAABCBBBCCABABCACA 8 110110100 010010100 ABAABCABCABAACCCCBBBBCCA 9 0000111111 1011100011 BAAABBCCABBBBCABACBACACCACC 10 0011...
output:
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1
result:
points 0.95 the max n you choose to answer is 55
Test #14:
score: 19
Acceptable Answer
time: 246ms
memory: 4820kb
input:
60 2 1 01 00 ABC 2 111 000 CAABBC 3 0101 0011 CAACBCBAB 4 11011 01001 CABBCAACBBCA 5 000010 010100 BCCCACAAACBBBBA 6 0011011 0011000 BCACCBAAAAABCBCBBC 7 11000001 11111111 AACBCABACCBBCABCCBAAB 8 111010100 111101010 CBABCACBABAACBABCCCBCAAB 9 1001111111 1011000111 CAABCACCABBBABBCACCABBCAACB 10 0011...
output:
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1
result:
points 0.95 the max n you choose to answer is 55
Test #15:
score: 19
Acceptable Answer
time: 245ms
memory: 4984kb
input:
60 2 1 00 10 BCA 2 110 000 BCAABC 3 0111 1001 CACAABBBC 4 10101 00000 ACCBCAABBACB 5 010001 100001 BBCBBAACCBACACA 6 0100101 0100010 CCAAAABCCAABBCBBBC 7 10010000 10010011 BCBCACBCBAAAABCABBCCA 8 001101111 110010111 CABACABCACBBABCBCABACABC 9 1000111100 1011101001 ACBCABABBCCBABCCAAACBBBACAC 10 1111...
output:
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1
result:
points 0.95 the max n you choose to answer is 55
Test #16:
score: 19
Acceptable Answer
time: 82ms
memory: 4840kb
input:
60 2 1 10 11 CAB 2 110 100 AABBCC 3 0100 0110 CAABCBABC 4 01010 01000 BCBCABACBCAA 5 001110 100000 AAABBCCCABCBABC 6 1000000 1101100 ACCBACBCAABCAABBCB 7 11011110 01000000 AAAAABABBBCBBBACCCCCC 8 101000000 010000000 ACBABBCCCCCCCABAAABAABBB 9 1000000000 1000000000 CCCCCCCCCAABAAABABBBABBAABB 10 0111...
output:
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1
result:
points 0.95 the max n you choose to answer is 55
Test #17:
score: 19
Acceptable Answer
time: 2ms
memory: 4940kb
input:
60 2 1 01 10 ABC 2 100 100 BCABCA 3 1000 1100 CABACCBAB 4 11001 10000 AABCBACABBCC 5 110000 101110 BACBCAABCABCBCA 6 1110000 1111100 AABBBBCABCCCCABAAC 7 10110000 11100000 AAACCABBCAABCBBABBCCC 8 001111100 011000000 ABAACAAAACABCBCBBBBBCCCC 9 0110000000 1111000000 AACBBACBBBCBCABACACBCAABCCA 10 1111...
output:
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1
result:
points 0.95 the max n you choose to answer is 55
Test #18:
score: 19
Acceptable Answer
time: 90ms
memory: 5016kb
input:
60 2 1 10 11 ABC 2 100 100 CABCAB 3 1000 1000 CCABCABAB 4 11100 10000 ACACBABCABCB 5 111101 100000 AABCABCBACABBCC 6 1000000 0100000 BCACCCCCABAAABBBBA 7 10101110 11000000 AAABBCBBCACCCABBAACBC 8 111110000 001100000 ACBBCBBCABACCACBBABAACCA 9 1110000000 1111110000 CAAACBCCBBAAABCCBACABACCBBB 10 1100...
output:
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1
result:
points 0.95 the max n you choose to answer is 55
Test #19:
score: 19
Acceptable Answer
time: 32ms
memory: 4980kb
input:
60 2 1 11 10 ABC 2 100 110 BCABCA 3 1000 1111 BBCBACCAA 4 10000 10011 BCABCABCABCA 5 011111 100000 AABCBCABACABCBC 6 1110000 1000000 CAAACCCBBBCAACABBB 7 10000000 01000000 ABBCACCCABBACABACBBAC 8 110100011 100000000 AABBCABCCAABBCABCABCABCC 9 1111011100 1100000000 AAACABBBBBCACABCCBABCACBCCA 10 0111...
output:
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1
result:
points 0.95 the max n you choose to answer is 55
Test #20:
score: 19
Acceptable Answer
time: 35ms
memory: 4984kb
input:
60 2 1 10 10 CAB 2 110 100 ABCACB 3 1000 1000 CABCABCAB 4 10111 10000 CABCABCABCAB 5 100000 110000 BCCAABCBCABACAB 6 1000000 1111000 CCCABACAABBCABCABB 7 10000000 11000110 BBCBBBCCACCCBABAAACAA 8 110000000 100000000 AACBCABCABBACCABCBCAABBC 9 1000000000 1100000000 BBCCACACCCBBACBCCABABAAAABB 10 1111...
output:
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1
result:
points 0.95 the max n you choose to answer is 55
Test #21:
score: 19
Acceptable Answer
time: 25ms
memory: 4840kb
input:
60 2 1 10 10 CAB 2 110 100 CABCAB 3 0111 1000 CABCABCAB 4 11010 11000 AAABBBCBACCC 5 110000 100000 ACBACABCBABCABC 6 1111000 1111000 AAABBBBBCACCCAABCC 7 11011100 01000000 AAAAACCBCBCBBBCACACBB 8 111000000 111010000 AAABBBBBCCCCCCCABACABABA 9 1011100010 1000000000 AAABAABAABBABBCCCCBCCCCBACB 10 1111...
output:
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1
result:
points 0.95 the max n you choose to answer is 55
Subtask #3:
score: 9.5
Acceptable Answer
Test #22:
score: 9.5
Acceptable Answer
time: 2990ms
memory: 4984kb
input:
60 3 1 11 11 ??? 2 111 111 ?????? 3 1111 1111 ????????? 4 11111 11111 ???????????? 5 111111 111111 ??????????????? 6 1111111 1111111 ?????????????????? 7 11111111 11111111 ????????????????????? 8 111111111 111111111 ???????????????????????? 9 1111111111 1111111111 ??????????????????????????? 10 1111...
output:
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 2641385472 -1 -1 -1 -1 -1
result:
points 0.95 the max n you choose to answer is 55
Subtask #4:
score: 0
Time Limit Exceeded
Dependency #1:
95%
Acceptable Answer
Dependency #3:
95%
Acceptable Answer
Test #23:
score: 19
Acceptable Answer
time: 1487ms
memory: 4924kb
input:
60 4 1 11 11 AC? 2 111 111 ?ACAAA 3 1111 1111 AA?A?CCCC 4 11111 11111 ??BBB?CBBACA 5 111111 111111 ?CC?CCCAA?BCB?? 6 1111111 1111111 ?B?BBCCABBCBA?A?BC 7 11111111 11111111 AAA?B??C?CBABACCCA?AA 8 111111111 111111111 CBBB?AAC?B?A???BABAC?ACB 9 1111111111 1111111111 A?A?BAA?BCBC??ABBBBAAA?ACBB 10 1111...
output:
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 3004544656 -1 -1 -1 -1 -1
result:
points 0.95 the max n you choose to answer is 55
Test #24:
score: 19
Acceptable Answer
time: 1352ms
memory: 5024kb
input:
60 4 1 11 11 CCA 2 111 111 BBAABC 3 1111 1111 ?BACB?B?B 4 11111 11111 B??ACBBCBBA? 5 111111 111111 ABBBBC?CABCABA? 6 1111111 1111111 ?ACAB?CAA?AB?C?AAC 7 11111111 11111111 ?BAAA?BCAAA??AB?BABAC 8 111111111 111111111 BCBCC?ACACA?AAAC??BACACA 9 1111111111 1111111111 ACCCBCBAA?BABBA??BBBBACAA?A 10 1111...
output:
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1782433216 -1 -1 -1 -1 -1
result:
points 0.95 the max n you choose to answer is 55
Test #25:
score: 19
Acceptable Answer
time: 1360ms
memory: 4964kb
input:
60 4 1 11 11 A?B 2 111 111 BABBBB 3 1111 1111 ?ABBABBCC 4 11111 11111 CBABBBCBABAB 5 111111 111111 AABCBA?CBBCCBBA 6 1111111 1111111 AB????CCBCC?BCBBB? 7 11111111 11111111 C?BBBC?BABCC?CC?A?BAC 8 111111111 111111111 CCAAACA?C?A??AAAABC?CAC? 9 1111111111 1111111111 BAABBBCA?A?BA?CA??CAAABBBAB 10 1111...
output:
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1497731824 -1 -1 -1 -1 -1
result:
points 0.95 the max n you choose to answer is 55
Test #26:
score: 19
Acceptable Answer
time: 2963ms
memory: 4848kb
input:
60 4 1 11 11 ??? 2 111 111 ???C?? 3 1111 1111 ????????? 4 11111 11111 ?C???????AAA 5 111111 111111 ??????????????? 6 1111111 1111111 ?????B???C?A?B?BC? 7 11111111 11111111 ??????B??????A????C?? 8 111111111 111111111 ???????????C?CB????????? 9 1111111111 1111111111 ??????B??CC?????B??C??????? 10 1111...
output:
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 177121948 -1 -1 -1 -1 -1
result:
points 0.95 the max n you choose to answer is 55
Test #27:
score: 19
Acceptable Answer
time: 2636ms
memory: 4960kb
input:
60 4 1 11 11 ??? 2 111 111 ?????? 3 1111 1111 ????????? 4 11111 11111 ???AC?????A? 5 111111 111111 ????????C??A??? 6 1111111 1111111 ?A???????????????C 7 11111111 11111111 BC?C??????B??A?B?A??? 8 111111111 111111111 ???????C?????A?????????? 9 1111111111 1111111111 ??????????????????????????? 10 1111...
output:
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 3548181663 -1 -1 -1 -1 -1
result:
points 0.95 the max n you choose to answer is 55
Test #28:
score: 0
Time Limit Exceeded
input:
60 4 1 11 11 ??? 2 111 111 ?B???? 3 1111 1111 ???????B? 4 11111 11111 ???????????? 5 111111 111111 ?C??????????AA? 6 1111111 1111111 ?????????????????A 7 11111111 11111111 ?AA??????AB?CBC?????? 8 111111111 111111111 ???????????????????????? 9 1111111111 1111111111 ??A??????B?????A?????B????A 10 1111...
output:
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 782998719 -1 -1 -1 -1 -1
result:
Subtask #5:
score: 0
Skipped
Dependency #1:
95%
Acceptable Answer
Dependency #2:
95%
Acceptable Answer
Dependency #3:
95%
Acceptable Answer
Dependency #4:
0%