QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#619151#7900. Gifts from KnowledgeCreditWA 15ms28952kbC++172.1kb2024-10-07 13:18:022024-10-07 13:18:06

Judging History

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

  • [2024-10-07 13:18:06]
  • 评测
  • 测评结果:WA
  • 用时:15ms
  • 内存:28952kb
  • [2024-10-07 13:18:02]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
const int mod = 1e9 + 7;
ll n,m;
vector<char>a[1000006];
int fa[10000005];
// 初始化
void init(int n)
{
    for (int i = 1; i <= n; i++)
        fa[i] = i;
}

// 找父节点,路径压缩
int find(int i)
{
    if (fa[i] == i)
        return i;
    else
    {
        fa[i] = find(fa[i]); // 路径压缩
        return fa[i];
    }
}
// 合并
void bing(int i, int j)
{
    int i_fa = find(i);
    int j_fa = find(j);
    fa[i_fa] = j_fa;
}
ll quickp(ll a,ll b){
    ll ans = 1;
    while(b > 0){
        if(b&1){
            ans = ans * a %mod;
        }
        b >>= 1;
        a = a*a%mod;
    }
    return ans%mod;
}
void solve()
{

    cin >> n >> m;
    init(n);
    for(int i = 1;i <= n;i++){
        a[i].clear();
        a[i].push_back(0);
        for(int j = 1;j <= m;j++){
            char x;cin >> x;
            a[i].push_back(x);
        }
    }   
    // cout << a[1][2] << "?";

    for(int j = 1;j <= (m-1)/2+1;j++){
        ll cnt1 = 0;
        ll x,y;
        for(int i = 1;i <= n;i++){
            if(a[i][j] == '1'){
                cnt1++;
                if(cnt1 == 1)x = i;
                if(cnt1 == 2)y = i;
                if(cnt1 > 2){
                    cout << "0\n";
                    return ;
                }
            }
        }
        // cout << "cnt " << cnt1 << "\n";
        for(int i = 1;i <= n;i++){
            if(a[i][m-j+1] == '1'){
                cnt1++;
                if(cnt1 == 1)x = i;
                if(cnt1 == 2)y = i;
                if(cnt1 > 2){
                    cout << "0\n";
                    return ;
                }
            }
        }
        if(cnt1 == 2)
            bing(x,y);
    }
    ll cnt2=0;
    for(int i = 1;i <= n;i++){
        if(fa[i] == i){
            cnt2++;
        }
    }
    cout << quickp(2,cnt2) << "\n";
   
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
 int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}

详细

Test #1:

score: 100
Accepted
time: 8ms
memory: 28952kb

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: 15ms
memory: 28384kb

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: 15ms
memory: 28248kb

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'