QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #721941 | #7900. Gifts from Knowledge | ref | WA | 14ms | 42620kb | C++20 | 4.8kb | 2024-11-07 17:15:09 | 2024-11-07 17:15:12 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
#define int long long
const int N=1e6+10;
string b[N];
int cnt[N];
int p[N];
int ans[N];
int ch[N];
const int mod=1e9+7;
int qpow(int t,int n)
{
int y=1;
while(n)
{
if(n&1)
{
y=(y*t)%mod;
}
t=(t*t)%mod;
n>>=1;
}
return y;
}
void solve()
{
int r,c;
cin>>r>>c;
for(int i=1;i<=r;i++)
{
ans[i]=0;
}
for(int i=1;i<=c;i++)
{
cnt[i]=0;
ch[i]=0;
p[i]=0;
}
for(int i=1;i<=r;i++)
{
cin>>b[i];
b[i]=" "+b[i];
}
for(int i=1;i<=r;i++)
{
for(int j=1;j<=c;j++)
{
if(b[i][j]=='1')
{
ch[j]++;
if(c%2==1)
{
if(j==(c+1)/2)
{
if(ch[j]>1)
{
cout<<0<<endl;
return ;
}
}
else
{
if(ch[j]+ch[c-j+1]>2)
{
cout<<0<<endl;
return ;
}
}
}
else
{
if(ch[j]+ch[c-j+1]>2)
{
cout<<0<<endl;
return ;
}
}
}
}
}
for(int i=1;i<=r;i++)
{
vector<int>sb;
vector<int>sb1;
int flag=0;
for(int j=1;j<=c;j++)
{
if(b[i][j]=='1')
{
sb.push_back(j);
cnt[j]++;
if(cnt[j]>1)
{
flag=1;
}
}
}
if(flag==0)
{
for(int j=0;j<(int)sb.size();j++)
{
cnt[sb[j]]--;
cnt[c-sb[j]+1]++;
sb1.push_back(c-sb[j]+1);
}
for(int j=0;j<(int)sb1.size();j++)
{
if(cnt[sb1[j]]>1)
{
flag=2;
break;
}
}
if(flag==0)
{
for(int j=0;j<(int)sb1.size();j++)
{
p[sb1[j]]=i;
}
ans[i]=1;
}
}
if(flag!=0)
{
if(flag==1)
{
ans[i]=1;
for(int j=0;j<(int)sb.size();j++)
{
cnt[sb[j]]--;
ans[p[sb[j]]]=0;
if(p[sb[j]]!=0)
{
p[sb[j]]=i;
}
cnt[c-sb[j]+1]++;
p[c-sb[j]+1]=i;
}
// for(int j=0;j<(int)sb.size();j++)
// {
// if(cnt[c-sb[j]+1]>1)
// {
// cout<<0<<endl;
// return ;
// }
// }
for(int j=1;j<=c;j++)
{
if(ans[p[j]]==0&&p[j]!=0)
{
p[j]=i;
}
}
}
else
{
ans[i]=1;
for(int j=0;j<(int)sb1.size();j++)
{
cnt[sb1[j]]--;
ans[p[sb1[j]]]=0;
if(p[sb1[j]]!=0)
{
p[sb1[j]]=i;
}
cnt[c-sb1[j]+1]++;
p[c-sb1[j]+1]=i;
}
// for(int j=0;j<(int)sb1.size();j++)
// {
// if(cnt[c-sb1[j]+1]>1)
// {
// cout<<0<<endl;
// return ;
// }
// }
for(int j=1;j<=c;j++)
{
if(ans[p[j]]==0&&p[j]!=0)
{
p[j]=i;
}
}
}
ans[i]=1;
}
}
int res=0;
for(int i=1;i<=r;i++)
res+=ans[i];
cout<<qpow(2,res)<<endl;
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
while(cin>>t)
{
while(t--)
{
solve();
}
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 3ms
memory: 42508kb
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: 41780kb
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: 12ms
memory: 42620kb
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 2380th numbers differ - expected: '0', found: '4'