QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #554475 | #7900. Gifts from Knowledge | liqingyang# | WA | 8ms | 36644kb | C++14 | 1.2kb | 2024-09-09 11:27:13 | 2024-09-09 11:27:14 |
Judging History
answer
#include<iostream>
using namespace std;
const unsigned int mod=1e9+7;
int T,n,m,f[2000010];
string s[1000010];
int find(int x)
{
return f[x]==x?x
:f[x]=find(f[x]);
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>T;
while(T--)
{
cin>>n>>m;
for(int i=1;i<=n;i++)
{
cin>>s[i];
f[i]=i,f[n+i]=n+i;
}
int ans=1;
for(int i=0;ans&&i<(m+1>>1);i++)
{
int x=0,y=0;
bool flag;
for(int j=1;j<=n;j++)
{
if(s[j][i]=='1'&&s[j][m-1-i]=='1')
{
if(x||y)
{
ans=0;
break;
}
x=y=j;
continue;
}
if(s[j][i]=='1'||s[j][m-1-i]=='1')
{
if(x)
{
if(y)
{
ans=0;
break;
}
y=j;
if(flag==(s[j][i]=='0'))
{
f[find(x)]=find(y);
f[find(n+x)]=find(n+y);
continue;
}
f[find(x)]=find(n+y);
f[find(n+x)]=find(y);
continue;
}
x=j,flag=(s[j][i]=='0');
}
}
}
for(int i=1;i<=n;i++)
{
if(find(i)==find(n+i))
{
ans=0;
break;
}
}
for(int i=1,j=0;i<=(n<<1);i++)
{
if(f[i]==i)
{
if(j^=1)
{
ans=ans*2%mod;
}
}
}
cout<<ans<<'\n';
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 4ms
memory: 35628kb
input:
3 3 5 01100 10001 00010 2 1 1 1 2 3 001 001
output:
4 0 2
result:
ok 3 number(s): "4 0 2"
Test #2:
score: 0
Accepted
time: 7ms
memory: 35284kb
input:
15613 10 10 0000000000 0000000000 0000000000 0000000000 0000000000 0000000000 0000000000 0000000000 0000000000 0000000000 15 8 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 1 5 00000 5 9 000000000 000000000 0000...
output:
1024 32768 2 32 32768 128 32 16 16 2 16384 16384 128 128 32768 8192 128 64 16384 2 4 2 4096 16 4096 1024 32768 32768 16384 8 128 2 16 4096 8192 32768 8192 8192 16 16384 16384 256 128 8 256 8 4096 512 2 4 32 32 2 64 512 1024 32768 32768 2 64 16384 16 8192 16 256 16 64 8192 8192 64 1024 2 32768 2 4 51...
result:
ok 15613 numbers
Test #3:
score: 0
Accepted
time: 7ms
memory: 35616kb
input:
15759 9 6 000000 000000 000000 000000 000000 000000 000000 000000 000000 5 15 010000000000000 000000000000000 000000000000000 000100000000000 000100000000000 14 12 000000000000 000000000000 000000000000 000000000000 000000000000 000000000000 000000000000 000000000000 000000000000 000000000000 000000...
output:
512 16 16384 512 1024 4096 32768 4 2 512 512 512 512 8 2 256 16 4096 512 64 16 4096 512 32 32768 8192 32 2048 128 16 4096 64 32768 256 32 16384 8 512 32 2048 8 16 1024 2048 128 64 32 8 512 8 8192 256 8192 32768 2 8 512 512 256 32 2 2048 8192 8 64 8 2 16384 32768 32768 1024 4096 16384 16384 128 256 4...
result:
ok 15759 numbers
Test #4:
score: -100
Wrong Answer
time: 8ms
memory: 36644kb
input:
15734 3 6 000101 010000 001110 5 7 0010010 1000000 0101000 0000000 0000000 10 9 000000000 100000000 000000000 000000000 000010000 000000001 000000000 000000000 000000000 000000000 5 14 10000000000000 00001001000000 00000100000000 00000000000000 00000100000000 5 14 00000000000000 00010000000100 00000...
output:
0 16 512 16 32 4096 0 256 0 0 0 0 4096 8 1024 128 8192 0 128 0 2 0 0 32 64 0 0 0 4096 64 8 8 32 128 64 4096 2 512 16384 4 2 0 0 32 0 4096 8 0 8192 256 256 64 0 32 0 32 0 256 4 16384 1024 4 0 16 256 0 2048 64 8 0 0 32768 2048 512 2048 2 0 8192 0 2 2048 16 512 256 1024 0 0 2 32 512 16384 0 32 1024 102...
result:
wrong answer 980th numbers differ - expected: '0', found: '2'