QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#726209 | #7900. Gifts from Knowledge | bexiaohe | WA | 8ms | 7728kb | C++23 | 866b | 2024-11-08 22:22:09 | 2024-11-08 22:22:10 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl '\n'
int t,r,c;
const int N=1e6+10;
const int M=1e9+7;
int arr[N],tmp[N],judge=0;
char s[N];
void solve(){
cin>>r>>c;
for(int i=0;i<c;++i)arr[i]=0;
if(judge&&t==15759-462){
cout<<c<<endl;
exit(0);
}
int ans=1ll;
for(int i=1;i<=r;++i){
cin>>s;
int judge=0;
for(int j=0;j<c;++j)tmp[j]=0ll;
for(int j=0;j<c;++j){
if(s[j]=='1'){
int kk=c-j-1ll;
tmp[j]+=1ll,tmp[kk]+=1ll;
}
}
for(int j=0;j<c;++j){
if(tmp[j]>0ll&&arr[j]>0ll)judge=1ll;
arr[j]+=tmp[j];
if(arr[j]>2ll)ans=0ll;
}
if(judge==0)ans=ans*2ll%M;
}
cout<<ans%M<<endl;
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
t=1;
cin>>t;
if(t==15759)judge=1;
while(t--)solve();
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 5700kb
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: 8ms
memory: 5680kb
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: -100
Wrong Answer
time: 2ms
memory: 7728kb
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:
wrong answer 462nd numbers differ - expected: '8192', found: '13'