QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #723316 | #7900. Gifts from Knowledge | Stelor | ML | 13ms | 5684kb | C++17 | 3.7kb | 2024-11-07 21:48:27 | 2024-11-07 21:48:27 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const ll mod=1e9+7;
const int N=1e6+10;
int n,m,pre[N*2];
bitset<N*2> vis;
ll qui(ll a,ll b,ll c){
ll ret=1;
while(b){
if(b&1) ret=ret*a%c;
b>>=1;
a=a*a%c;
}
return ret;
}
int root(int x){
if(x==pre[x]) return x;
return pre[x]=root(pre[x]);
}
void solve(){
cin >> n >> m;
vector<string> a(n+1);
for(int i=1;i<=2*n;++i) {
pre[i]=i;
vis[i]=false;
}
for(int i=1;i<=n;++i){
string t;
cin >> t;
t="#"+t;
a[i]=t;
}
if(m==1){
int p=0;
for(int j=1;j<=n;++j){
if(a[j][1]=='1') p++;
}
if(p>1) {
cout<<"0\n";
return;
}else{
cout<<qui(2,n,mod)<<'\n';
return;
}
}
for(int l=1,r=m;l<=r;++l,--r){
int now=0;
for(int j=1;j<=n;++j){
if(a[j][l]=='1'){
now++;
}
if(l!=r){
if(a[j][r]=='1'){
now++;
}
}
}
if(l!=r){
if(now>2){
cout<<"0\n";return;
}
}else{
if(now>1){
cout<<"0\n";return;
}
}
}
for(int l=1,r=m;l<r;++l,--r){
int num1=0,num2=0;
for(int j=1;j<=n;++j){
if(a[j][l]=='1'){
num1++;
}
if(a[j][r]=='1'){
num2++;
}
}
if(num1==2&&num2==0){
int p1,p2,_=0;
for(int j=1;j<=n;++j){
if(a[j][l]=='1'){
if(_==0){
_++;
p1=j;
}else{
p2=j;
break;
}
}
}
int a1=root(p1);
int b1=root(p2);
int a2=root(p1+n);
int b2=root(p2+n);
pre[a1]=b2;
pre[b1]=a2;
}
else if(num1==0&&num2==2){
int p1,p2,_=0;
for(int j=1;j<=n;++j){
if(a[j][r]=='1'){
if(_==0){
_++;
p1=j;
}else{
p2=j;
break;
}
}
}
int a1=root(p1);
int b1=root(p2);
int a2=root(p1+n);
int b2=root(p2+n);
pre[a1]=b2;
pre[b1]=a2;
}else if(num1==1&&num2==1){
int p1,p2;
for(int j=1;j<=n;++j){
if(a[j][l]=='1'){
p1=j;
}
if(a[j][r]=='1'){
p2=j;
}
}
if(p1==p2) continue;
int a1=root(p1);
int b1=root(p2);
int a2=root(p1+n);
int b2=root(p2+n);
pre[a1]=b1;
pre[a2]=b2;
}
}
int num=0;
for(int i=1;i<=2*n;++i){
int p=root(i);
if(i<=n){
int y=root(i+n);
if(p==y){
cout<<"0\n";return;
}
}
if(vis[p]) continue;
vis[p]=true;
num++;
}
num>>=1;
ll ans=qui(2,num,mod);
cout<<ans<<"\n";
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin>>t;
while(t--){
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3540kb
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: 13ms
memory: 5684kb
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: 10ms
memory: 3804kb
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
Memory Limit Exceeded
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...