QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #723264 | #7900. Gifts from Knowledge | Stelor | ML | 20ms | 3828kb | C++17 | 4.4kb | 2024-11-07 21:39:56 | 2024-11-07 21:39:56 |
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];
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;
}
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(l==r){
if(num1==2){
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;
}
break;
}
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[b2]=a2;
}
}
vector<bool> vis(n+1);
int num=0;
for(int i=1;i<=n;++i){
int x=root(i);
int y=root(i+n);
if(x==y){
cout<<"0\n";return;
}
}
for(int i=1;i<=2*n;++i){
int p=root(i);
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: 3604kb
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: 14ms
memory: 3828kb
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: 14ms
memory: 3628kb
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: 0
Accepted
time: 15ms
memory: 3548kb
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:
ok 15734 numbers
Test #5:
score: 0
Accepted
time: 13ms
memory: 3540kb
input:
15616 14 3 000 000 000 000 100 000 000 000 000 000 001 001 001 000 15 5 00000 00000 00010 00000 00000 01000 00000 00000 00000 00001 00100 00000 00000 00000 10000 9 14 00000000000000 00000000000000 00100000010000 00001000100000 01010010000010 00000000000000 01000000000010 00100011000001 0000000000000...
output:
0 8192 0 64 0 512 0 8192 0 512 0 0 64 0 0 256 0 512 0 0 16 0 2048 0 256 0 1024 0 0 2 2 0 64 32 0 2 2 512 16 0 2 4 8192 0 0 1024 256 8 0 32 4 0 0 0 0 0 1024 4096 0 16384 32 0 2 4096 2 512 0 0 0 64 0 0 0 0 2 0 128 256 16 2 128 0 8 2 16384 0 0 2 0 0 0 128 0 0 0 0 0 2 4096 512 0 0 2 0 256 0 2 0 0 0 8 0 ...
result:
ok 15616 numbers
Test #6:
score: 0
Accepted
time: 12ms
memory: 3560kb
input:
15525 5 1 1 0 0 0 0 14 15 000000000000000 000001000010000 000000000000000 000000000000000 000110000000000 000000000000001 000000000000000 000010000010000 000000000000000 001010000000000 000101000000000 000000000000100 000000000000000 000100010001000 14 15 000000000000000 000000000000000 000000000010...
output:
32 0 0 0 0 0 0 2 2 16384 0 0 0 2 0 0 0 0 32 0 2048 0 0 256 4096 0 0 512 0 0 0 0 16 0 0 0 0 0 0 0 1024 0 0 0 0 0 0 0 0 0 128 0 0 0 512 0 0 0 0 2 8 0 0 0 16 1024 0 0 0 32 8192 0 0 0 0 0 4 0 0 0 128 4 0 0 2048 0 0 2 32768 0 0 4096 0 2 0 0 0 8 2 0 0 0 0 32 0 0 0 0 0 2 0 8192 4096 0 0 0 0 512 0 0 0 4 0 0...
result:
ok 15525 numbers
Test #7:
score: 0
Accepted
time: 11ms
memory: 3532kb
input:
15547 5 7 1001011 0011001 1101011 0011011 0101011 3 14 11110100111110 01110111011111 11011111110111 4 4 1100 1110 0110 0101 9 9 000000000 101000100 001100100 100001000 000000010 100100000 010110000 000100110 110100000 5 8 10000001 10101011 11101010 01011110 10100111 12 12 000000100000 000000000010 0...
output:
0 0 0 0 0 0 2 0 0 0 0 0 16 0 2 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 2 0 0 0 0 2 0 0 0 0 0 0 0 0 0 16 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 2 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 ...
result:
ok 15547 numbers
Test #8:
score: 0
Accepted
time: 10ms
memory: 3576kb
input:
15626 8 11 10000010011 01100000010 00000100010 10000010000 00001000000 10100000100 00101010011 00000011000 11 12 101000001000 000010010100 010001100001 000110101010 100010100000 100010000100 001100100000 010000100111 000011011101 000110010000 000000000000 15 8 00001000 00000000 00000000 00100000 000...
output:
0 0 0 2 0 1024 0 0 0 0 0 0 0 0 512 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 16 0 32768 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 4096 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1024 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...
result:
ok 15626 numbers
Test #9:
score: 0
Accepted
time: 16ms
memory: 3616kb
input:
15537 5 1 0 0 0 1 0 10 6 000000 000000 000010 000000 000000 000100 000000 100000 000000 000000 8 3 001 010 000 000 000 000 000 000 3 15 000000001000000 000010000000110 000000000000000 11 3 000 000 000 100 000 000 000 000 000 000 010 1 12 000000110100 3 7 0000010 0000001 0010000 8 1 0 0 0 0 1 0 0 0 1...
output:
32 1024 256 8 2048 2 8 256 2048 64 16384 32 8 4 2048 256 2048 8 32 128 16 32768 256 4096 256 64 2 128 8192 64 16 32768 64 8 1024 128 4096 32 4 16 4 2 8 128 2 1024 2048 1024 16384 256 128 1024 64 512 2048 1024 256 64 32 32 2048 4096 1024 32768 4 4096 256 1024 8 8192 64 16384 2048 2048 16384 8 8192 16...
result:
ok 15537 numbers
Test #10:
score: 0
Accepted
time: 16ms
memory: 3712kb
input:
15581 4 4 0010 0001 0000 0000 9 14 00000000000000 00000000010000 00000000000000 10000001000000 00000100000010 00010000000000 00000000000000 00000000001000 00000000000100 6 11 00000000000 00000001000 01001000100 00000000000 00000000000 00000100001 14 13 0000000010001 0000000000000 0000000000000 00100...
output:
16 256 64 16384 16 32 32 64 16384 16384 2 16384 8 8192 8192 4096 128 32768 2 32 128 2048 32 32768 4096 2048 128 8 32768 256 256 16 256 4096 4 32768 4 16384 4 4 128 8192 4096 8192 2 8192 4096 2048 16384 1024 512 64 512 4096 2048 1024 2048 1024 8 16 16 1024 8 32 2 2048 1024 1024 16384 16384 64 512 512...
result:
ok 15581 numbers
Test #11:
score: 0
Accepted
time: 20ms
memory: 3548kb
input:
15614 12 9 000000001 000000100 000000000 000000000 000000000 000000000 000000010 010010000 000000000 000100000 000000100 000000001 5 5 01010 00000 10100 00000 00001 15 6 000000 000000 000000 000000 011001 000000 000000 000000 000000 000000 000000 000000 000000 000000 000000 2 7 1100000 0110001 13 5 ...
output:
512 16 32768 0 4096 0 16384 2 8 8192 32 4 1024 0 16 8 4 64 0 2 2 2 1024 128 128 128 2 32 1024 32 1024 16 64 64 128 1024 512 0 4096 2 32 1024 4096 256 4 2 4096 2 32 64 2 2 0 0 128 16 16 16 4096 1024 2048 16 256 16 16 64 0 1024 0 4096 2 2 16 4 4 8192 1024 512 0 256 2 8 128 128 64 16 128 4096 64 1024 2...
result:
ok 15614 numbers
Test #12:
score: -100
Memory Limit Exceeded
input:
15569 11 3 000 000 000 000 000 000 100 000 000 010 000 2 11 00010000100 11000001101 7 13 0000000000010 0000000100000 1010010000000 0000001001000 0100000000100 1000100000000 0000100000000 12 6 000100 000001 000000 000000 000000 010000 000001 000000 000010 000100 000000 000000 9 6 000000 001000 000010...
output:
2048 0 4 512 64 16384 512 1024 4096 32 256 16 16384 0 512 8192 4096 4 128 4 8 512 1024 8 0 4096 4 4 128 2 4 64 4 512 128 64 16 0 4096 128 1024 0 4 2 0 16 64 256 1024 2048 256 0 4 8 8 16 256 512 256 0 2 2 2048 256 512 2048 4096 512 2048 16 0 1024 4 16 2 8192 1024 32 4 1024 256 32 4096 32 16 32 128 12...