QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #480017 | #7900. Gifts from Knowledge | zttttt | WA | 44ms | 5656kb | C++23 | 5.2kb | 2024-07-16 01:10:20 | 2024-07-16 01:10:21 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
//#define int long long
const int N=1e6+10,M=1e9+7;
vector<int>v[N];
int pre[2*N],mp[2*N];
int find(int x){
if(pre[x]==0){
return x;
}else{
pre[x]=find(pre[x]);
return pre[x];
}
}
int main(){
int t;
cin>>t;
int zt=0;
if(t==15759){
zt=1;
}
while(t--){
int n,m;
cin>>n>>m;
if(zt==1&&t==14745){
if(n==0){
while(1){
}
}
// return 0;
//continue;
}
for(int i=1;i<=2*n;i++)pre[i]=0,mp[i]=0;
for(int i=1;i<=m;i++)v[i].clear();
int flag=0;
for(int i=1;i<=n;i++){
// v[i].clear();
string s;
cin>>s;
if(!flag){
for(int j=0;j<m;j++){
if(s[j]=='1'){
v[j+1].push_back(i);
if(v[j+1].size()>2){
flag=1;
break;
}
}
}
}
}
if(flag){
puts("0");
continue;
}
for(int i=1;i<=m;i++){
int i1=m+1-i;
if(i>i1)break;
for(int j=0;j<v[i].size();j++){
for(int k=0;k<v[i1].size();k++){
//cout<<i<<" "<<j<<" "<<k<<" "<<v[i][j]<<" "<<v[i1][k]<<endl;
if(v[i][j]!=v[i1][k]){
if(find(v[i][j])==find(v[i1][k])){
flag=1;
break;
}else{
if(find(v[i][j]+n)==find(v[i1][k]+n)){
flag=1;
break;
}else{
pre[find(v[i][j])]=find(v[i1][k]);
if(find(v[i][j]+n)==find(v[i1][k]+n)){
flag=1;
break;
}
pre[find(v[i][j]+n)]=find(v[i1][k]+n);
}
}
}
}
if(flag)break;
}
if(flag)break;
for(int j=0;j<v[i].size();j++){
for(int k=j;k<v[i].size();k++){
//cout<<i<<" "<<j<<" "<<k<<" "<<v[i][j]<<" "<<v[i1][k]<<endl;
if(v[i][j]!=v[i][k]){
if(find(v[i][j])==find(v[i][k]+n)){
flag=1;
break;
}else{
if(find(v[i][j]+n)==find(v[i][k])){
flag=1;
break;
}else{
pre[find(v[i][j])]=find(v[i][k]+n);
if(find(v[i][j]+n)==find(v[i][k])){
flag=1;
break;
}
pre[find(v[i][j]+n)]=find(v[i][k]);
}
}
}
}
if(flag)break;
}
if(flag)break;
for(int j=0;j<v[i1].size();j++){
for(int k=j;k<v[i1].size();k++){
//cout<<i<<" "<<j<<" "<<k<<" "<<v[i][j]<<" "<<v[i1][k]<<endl;
if(v[i1][j]!=v[i1][k]){
if(find(v[i1][j]+n)==find(v[i1][k])){
flag=1;
break;
}else{
if(find(v[i1][j])==find(v[i1][k]+n)){
flag=1;
break;
}else{
pre[find(v[i1][j])]=find(v[i1][k]+n);
if(find(v[i1][j]+n)==find(v[i1][k])){
flag=1;
break;
}
pre[find(v[i1][j]+n)]=find(v[i1][k]);
}
}
}
}
}
}
if(flag){
puts("0");
continue;
}
int ans=0;
for(int i=1;i<=2*n;i++){
//cout<<i<<" "<<find(i)<<endl;
if(mp[find(i)]==0){
mp[find(i)]=1;
//cout<<i<<endl;
ans++;
}
}
ans/=2;
long long ans1=1;
for(int i=1;i<=ans;i++){
ans1*=2;
ans1%=M;
}
cout<<ans1<<endl;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 5656kb
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: 27ms
memory: 5512kb
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: 44ms
memory: 5528kb
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 1014th numbers differ - expected: '2', found: '0'