QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#626236 | #7900. Gifts from Knowledge | Dixiky_215 | WA | 35ms | 100108kb | C++17 | 2.9kb | 2024-10-10 00:50:53 | 2024-10-10 00:50:54 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double eps=1e-9;
const int MAXN=2e6+7;;
int t;
int n,m,fa[MAXN];
vector< int > id[MAXN],a[MAXN];
string b;
ll mod=1e9+7LL;
int find_fa(int x)
{
if(x==fa[x]) return x;
fa[x]=find_fa(fa[x]);
return fa[x];
}
bool vis[MAXN];
ll ksm(ll x,ll y)
{
ll res=1LL;
while(y)
{
if(y&1LL) res=(res*x)%mod;
y=y>>1LL;x=(x*x)%mod;
}
return res;
}
int main()
{
cin.tie(nullptr) ->sync_with_stdio(false);
cin>>t;
while(t--)
{
cin>>n>>m;
for(int i=1;i<=n*2;i++) fa[i]=i;
for(int i=1;i<=n;i++)
{
cin>>b;
b=' '+b;
a[i].push_back(0);
for(int j=1;j<=m;j++)
{
int idk=min(j,m+1-j);
if(b[j]=='1')
{
if(j>idk)
{
if(b[idk]!='1') id[idk].push_back(i);
}
else id[idk].push_back(i);
}
a[i].push_back(b[j]-'0');
}
}
bool flag=1;
if(m%2)
{
if(id[(m+1)/2].size()>1) flag=0;
}
for(int i=1;i<=m/2;i++)
{
if(id[i].size()>2) {flag=0;break;}
if(id[i].size()==2)
{
int k1=a[id[i][0]][i],k2=a[id[i][0]][m+1-i];
int k11=a[id[i][1]][i],k22=a[id[i][1]][m+1-i];
if(k1==k2&&k1==1) {flag=0;break;}
if(k11==k22&&k11==1) {flag=0;break;}
assert(id[i][1]!=id[i][0]);
if((k1==1&&k11==1)||(k1==0&&k11==0))
{
int fa1=find_fa(id[i][0]),fa2=find_fa(id[i][1]);
if(fa1!=fa2) fa[fa2]=fa1;
fa1=find_fa(id[i][0]+n);fa2=find_fa(id[i][1]+n);
if(fa1!=fa2) fa[fa2]=fa1;
}
else
{
int fa1=find_fa(id[i][0]),fa2=find_fa(id[i][1]+n);
if(fa1!=fa2) fa[fa2]=fa1;
fa1=find_fa(id[i][0]+n);fa2=find_fa(id[i][1]);
if(fa1!=fa2) fa[fa2]=fa1;
}
}
}
ll num=0LL;
for(int i=1;i<=n;i++)
{
int fa1=find_fa(i),fa2=find_fa(i+n);
if(fa1==fa2) {flag=0;break;}
if(!vis[fa1])
{
vis[fa1]=1;
num++;
}
if(!vis[fa2])
{
vis[fa2]=1;
num++;
}
}
if(flag) cout<<ksm(2LL,num/2LL)<<'\n';
else cout<<"0\n";
for(int i=0;i<=n;i++) a[i].clear();
for(int i=0;i<=2*n;i++) vis[i]=0;
for(int i=0;i<=m;i++) id[i].clear();
}
return 0;
}
/*
*/
詳細信息
Test #1:
score: 100
Accepted
time: 21ms
memory: 97712kb
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: 19ms
memory: 99856kb
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: 20ms
memory: 100108kb
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: 35ms
memory: 99832kb
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'