QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#614882#7900. Gifts from KnowledgewzxtslWA 17ms11828kbC++233.5kb2024-10-05 17:05:492024-10-05 17:05:51

Judging History

你现在查看的是最新测评结果

  • [2024-10-05 17:05:51]
  • 评测
  • 测评结果:WA
  • 用时:17ms
  • 内存:11828kb
  • [2024-10-05 17:05:49]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define int long long
#define PII pair<int,int>
int r,c,x,cnt,ii,jj,iii,jjj;
const int N=1e6+7;
const int mod=1e9+7;
int f[N],f1[N],f2[N],vis[N],a[N];
string s;
vector<int> v[N];
void init(){
    for(int i=1;i<=r;i++)
        f[i]=f1[i]=f2[i]=i,v[i].clear(),vis[i]=0;
}
int qpow(int a,int m){
    int res=1,x=a;
    while(m)
    {
        if(m&1) res=res*x%mod;//
        x=x*x%mod;m>>=1;
    }
    return (res+mod)%mod;
}
void solve(){
    cin>>r>>c;
    init();
    for(int i=1;i<=r;i++)
    {
        cin>>s;
        for(int j=0;j<s.length();j++)
        {
            x=s[j]-'0';
            v[i].push_back(x);
        }        
    }

    //cout<<r<<"!"<<c<<endl;
    /*for(int i=1;i<=r;i++){
        for(int j=1;j<=c;j++)
        {
            cout<<v[i][j-1];
        }
        cout<<endl;
    }*/
    for(int j=1;j<=c/2;j++)
    {
        cnt=0;
        for(int i=1;i<=r;i++)
        {
            if(v[i][j-1]==1) cnt++;//,cout<<i<<"!"<<j<<"!!"
            if(v[i][c-j]==1) cnt++;//,cout<<i<<"!"<<c-i+1<<"!!"
        }
        if(cnt>=3) 
        {
            cout<<0<<endl;return ;
        }
    }
    cnt=0;
    if(c&1)
    {
        for(int i=1;i<=r;i++)
        {
            if(v[i][c/2]==1) cnt++;
        }
        if(cnt>=2)
        {
            cout<<0<<endl;return ;
        }
    }
    for(int j=1;j<=c/2;j++)
    {
        cnt=0;ii=jj=iii=jjj=0;
        for(int i=1;i<=r;i++)
        {
            if(v[i][j-1]==1)
            {
                cnt++;
                if(cnt==1)
                {
                    ii=i,jj=j;
                }
                else 
                {
                    iii=i,jjj=j;
                }
            }
            if(v[i][c-j]==1)
            {
                cnt++;
                if(cnt==1)
                {
                    ii=i,jj=c-j+1;
                }
                else 
                {
                    iii=i,jjj=c-j+1;
                }                
            }
            if(cnt==2) break;
        }
        if(cnt<2) continue;
        else{            
            if(ii>iii) swap(ii,iii);
            if(jj>jjj) swap(jj,jjj);

            if(ii==iii) continue;
            else{//if(j==1)cout<<ii<<"!"<<jj<<"!!"; 
                if(jj==jjj)
                {
                    if(f2[iii]==ii) 
                    {
                        cout<<0<<endl;return;
                    }
                    f1[iii]=ii; //
                }
                else{
                    if(f1[iii]==ii) 
                    {
                        cout<<0<<endl;return;
                    }
                    f2[iii]=ii;                  
                }
            }
        }
    }
    //int tp=0;
    for(int i=1;i<=r;i++)
    {      

        int tp=f2[i],flg=0,tmp=f1[i];
        while(f2[i+1]==tp&&i<=r-1) 
        {
            i++;
            if(f1[i]==tmp) 
            {
                cout<<0<<endl;return;
            }
            tmp=f1[i];
        }
    }
    for(int i=1;i<=r;i++)
    {
        f[i]=min(f1[f2[i]],f2[f1[i]]);
        vis[f[i]]=1;
    }
    cnt=0;
    for(int i=1;i<=r;i++)
    {
        if(vis[i]) cnt++;
    }
    //cout<<f[2]<<"!"<<endl;
    cout<<qpow(2ll,cnt)<<endl;
}
signed main(){
    fast;
    int t=1;
    cin>>t;
    while(t--){
        solve();
    }
}

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 11776kb

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: 12ms
memory: 11828kb

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: 17ms
memory: 11752kb

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'