QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #686297 | #9463. 基础 ABC 练习题 | Flamire | 20 | 1768ms | 521316kb | C++17 | 4.1kb | 2024-10-29 10:45:08 | 2024-10-29 10:45:09 |
Judging History
answer
#include<iostream>
using namespace std;
const int N=60;
int T,Task,n,m;
char s[200],S1[65],S2[65];
unsigned int dp[N+2][N+2][40000];
int num=0,id[N+2][N+2][N+2];
int main()
{
cin>>T>>Task;
while(T--)
{
cin>>m>>S1>>S2>>s;
if(m!=N)
{
cout<<-1<<endl;
continue;
}
for(int i=0;i<=m;i++)
{
for(int j=0;i+j<=m;j++)
{
for(int k=0;i+j+k<=m;k++)
{
id[i][j][k]=++num;
}
}
}
n=m*3,dp[0][0][1]=1;
for(int i=0;i<n;i++)
{
char ch=s[i];
for(int a=min(i,m);a>=0;a--)
{
for(int b=min(m,i-a);i-a-b<=m;b--)
{
int c=i-a-b;
int X=max(0,a-c),X1=max(0,a+1-c);
int Y=max(0,b-a),Y1=max(0,b+1-a);
int Z=max(0,c-b),Z1=max(0,c+1-b);
if(ch=='?')
{
for(int x=min(a,m-Y-Z);x>=X;x--)
{
for(int y=min(b,m-x-Z);y>=Y;y--)
{
for(int z=min(c,m-x-y);z>=Z;z--)
{
dp[a+1][b][id[x][y][z]]
+=dp[a][b][id[x][y][z]];
dp[a][b+1][id[x][y][z]]
+=dp[a][b][id[x][y][z]];
}
}
}
if(X<X1)
{
int x=X;
for(int y=min(b,m-x-Z);y>=Y;y--)
{
for(int z=min(c,m-x-y);z>=Z;z--)
{
dp[a+1][b][id[x][y][z]]-=
dp[a][b][id[x][y][z]];
dp[a+1][b][id[x+1][y][z]]+=
dp[a][b][id[x][y][z]];
}
}
}
if(Y<Y1)
{
int y=Y;
for(int x=min(a,m-y-Z);x>=X;x--)
{
for(int z=min(c,m-x-y);z>=Z;z--)
{
dp[a][b+1][id[x][y][z]]-=
dp[a][b][id[x][y][z]];
dp[a][b+1][id[x][y+1][z]]+=
dp[a][b][id[x][y][z]];
}
}
}
if(Z<Z1)
{
int z=Z;
for(int x=min(a,m-z-Y);x>=X;x--)
{
for(int y=min(b,m-z-x);y>=Y;y--)
{
dp[a][b][id[x][y][z+1]]+=
dp[a][b][id[x][y][z]];
dp[a][b][id[x][y][z]]=0;
}
}
}
continue;
}
if(a<m&&ch=='A')
{
for(int x=min(a,m-Y-Z);x>=X1;x--)
{
for(int y=min(b,m-x-Z);y>=Y;y--)
{
for(int z=min(c,m-x-y);z>=Z;z--)
{
dp[a+1][b][id[x][y][z]]+=
dp[a][b][id[x][y][z]];
}
}
}
if(X<X1)
{
int x=X;
for(int y=min(b,m-1-x-Z);y>=Y;y--)
{
for(int z=min(c,m-1-x-y);z>=Z;z--)
{
dp[a+1][b][id[x+1][y][z]]+=
dp[a][b][id[x][y][z]];
}
}
}
}
if(b<m&&ch=='B')
{
for(int x=min(a,m-Y1-Z);x>=X;x--)
{
for(int y=min(b,m-x-Z);y>=Y1;y--)
{
for(int z=min(c,m-x-y);z>=Z;z--)
{
dp[a][b+1][id[x][y][z]]+=
dp[a][b][id[x][y][z]];
}
}
}
if(Y<Y1)
{
int y=Y;
for(int x=min(a,m-1-y-Z);x>=X;x--)
{
for(int z=min(c,m-1-x-y);z>=Z;z--)
{
dp[a][b+1][id[x][y+1][z]]+=
dp[a][b][id[x][y][z]];
}
}
}
}
if(c<m&&ch=='C')
{
if(Z<Z1)
{
int z=Z;
for(int x=min(a,m-1-z-Y);x>=X;x--)
{
for(int y=min(b,m-1-z-x);y>=Y;y--)
{
dp[a][b][id[x][y][z+1]]+=
dp[a][b][id[x][y][z]];
dp[a][b][id[x][y][z]]=0;
}
}
}
}
else
{
for(int x=min(a,m-Y-Z);x>=X;x--)
{
for(int y=min(b,m-x-Z);y>=Y;y--)
{
for(int z=min(c,m-x-y);z>=Z;z--)
{
dp[a][b][id[x][y][z]]=0;
}
}
}
}
}
}
}
unsigned int ans=0;
for(int x=0;x<=m;x++)
{
for(int y=0;x+y<=m;y++)
{
for(int z=0;x+y+z<=m;z++)
{
unsigned int v=dp[m][m][id[x][y][z]];
if(v)
{
bool flag=0;
for(int i=x;!flag&&i+y+z<=m;i++)
{
for(int j=y;i+j+z<=m;j++)
{
if(S1[i]=='1'&&S2[j]=='1')
{
flag=1;
break;
}
}
}
if(flag)
{
ans+=v;
}
}
}
}
}
cout<<ans<<endl;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 20
Accepted
Test #1:
score: 20
Accepted
time: 1383ms
memory: 499780kb
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:
ok Accepted!!!
Test #2:
score: 20
Accepted
time: 1606ms
memory: 515676kb
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:
ok Accepted!!!
Test #3:
score: 20
Accepted
time: 1477ms
memory: 505304kb
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:
ok Accepted!!!
Test #4:
score: 20
Accepted
time: 1580ms
memory: 502380kb
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:
ok Accepted!!!
Test #5:
score: 20
Accepted
time: 1405ms
memory: 517724kb
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 0
result:
ok Accepted!!!
Test #6:
score: 20
Accepted
time: 1396ms
memory: 521316kb
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 -1 -1 -1 -1 -1 1
result:
ok Accepted!!!
Test #7:
score: 20
Accepted
time: 1495ms
memory: 520464kb
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 -1 -1 -1 -1 -1 1
result:
ok Accepted!!!
Test #8:
score: 20
Accepted
time: 1740ms
memory: 497060kb
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 0
result:
ok Accepted!!!
Test #9:
score: 20
Accepted
time: 1706ms
memory: 503816kb
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 -1 -1 -1 -1 -1 1
result:
ok Accepted!!!
Test #10:
score: 20
Accepted
time: 1301ms
memory: 520688kb
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 -1 -1 -1 -1 -1 1
result:
ok Accepted!!!
Test #11:
score: 20
Accepted
time: 1768ms
memory: 466768kb
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:
ok Accepted!!!
Subtask #2:
score: 0
Memory Limit Exceeded
Dependency #1:
100%
Accepted
Test #12:
score: 20
Accepted
time: 1474ms
memory: 510488kb
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:
ok Accepted!!!
Test #13:
score: 20
Accepted
time: 1394ms
memory: 509324kb
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:
ok Accepted!!!
Test #14:
score: 20
Accepted
time: 1456ms
memory: 514964kb
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:
ok Accepted!!!
Test #15:
score: 20
Accepted
time: 1514ms
memory: 507668kb
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:
ok Accepted!!!
Test #16:
score: 20
Accepted
time: 1651ms
memory: 479880kb
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:
ok Accepted!!!
Test #17:
score: 0
Memory Limit Exceeded
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 0
result:
Subtask #3:
score: 0
Memory Limit Exceeded
Test #22:
score: 0
Memory Limit Exceeded
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 -1 -1 -1 -1 -1 2103642368
result:
Subtask #4:
score: 0
Skipped
Dependency #1:
100%
Accepted
Dependency #3:
0%
Subtask #5:
score: 0
Skipped
Dependency #1:
100%
Accepted
Dependency #2:
0%