QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #619740 | #7900. Gifts from Knowledge | qz2003 | WA | 9ms | 3656kb | C++20 | 1.3kb | 2024-10-07 15:13:34 | 2024-10-07 15:13:34 |
Judging History
answer
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int t;
ll r,c;
string s;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin>>t;
ll mod=1e9+7;
ll ans;
while(t--){
cin>>r>>c;
map<ll,ll> mp;
ans=1;
ll ff=1;
for(int i=1;i<=r;i++){
cin>>s;
if(ff==0) continue;
ll ok=2;
bool now=0;
for(int j=0;j<c;j++){
if(s[j]=='1'&&mp[j]==1){
ok--;
break;
}
}
if(ok==1){
now=1;
}
for(int j=c-1;j>=0;j--){
if(s[j]=='1'&&mp[c-j-1]==1){
ok--;
break;
}
}
if(ok){
if(!now){
for(int j=0;j<c;j++){
if(s[j]=='1')
mp[j]++;
}
}
else{
for(int j=c-1;j>=0;j--){
if(s[j]=='1')
mp[c-j-1]++;
}
}
}
ans=ans*ok;
ans=ans%mod;
if(ok==0) ff=0;
}
cout<<ans<<"\n";
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3580kb
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: 3ms
memory: 3556kb
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: 9ms
memory: 3656kb
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: '16384'