QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#678409#7900. Gifts from Knowledgeenar#WA 8ms3628kbC++202.1kb2024-10-26 14:51:312024-10-26 14:51:31

Judging History

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

  • [2024-10-26 14:51:31]
  • 评测
  • 测评结果:WA
  • 用时:8ms
  • 内存:3628kb
  • [2024-10-26 14:51:31]
  • 提交

answer

#include <bits/stdc++.h>

const int64_t MOD = 1E9 + 7;

struct DSU {
    int siz;
    std::vector<int> v;
    DSU(int n) {
        siz = n;
        v.resize(n + 1);
        std::iota(v.begin(), v.end(), 0);
    }
    int find(int x) {
        return (v[x] == x ? x : (v[x] == find(v[x])));
    }
    bool merge(int x, int y) {
        if (find(x) != find(y)) {
            v[find(x)] = find(y);
            siz--;
            return true;
        }
        return false;
    }
    bool query(int x, int y) {
        return find(x) == find(y);
    }
};

int64_t power(int64_t a, int64_t b)
{
    int64_t res = 1;
    while (b > 0) {
        if (b & 1) res = res * a % MOD;
        a = a * a % MOD;
        b >>= 1;
    }
    return res;
}

void solve()
{
    int n, m;
    std::cin >> n >> m;
    std::vector<std::string> v(n);
    for (int i = 0; i < n; ++i) {
        std::cin >> v[i];
    }
    DSU dsu(n);
    for (int j = 0; j <= m / 2; ++j) {
        int cnt = 0;
        int a = -1, b = -1;
        for (int i = 0; i < n; ++i) {
            if (v[i][j] == '1') {
                cnt++;
                if (a == -1) {
                    a = i;
                } else {
                    b = i;
                }
            }
            if (v[i][m - j - 1] == '1' && m - j - 1 != j) {
                cnt++;
                if (a == -1) {
                    a = i;
                } else {
                    b = i;
                }
            }
        }
        if (cnt > 2) {
            std::cout << "0\n";
            return;
        }
        if (m % 2 == 1 && j == m / 2 && cnt > 1) {
            std::cout << "0\n";
            return;
        }
        // std::cout << a << ":" << b << " ";
        if (a != b && a != -1 && b != -1) {
            dsu.merge(a + 1, b + 1);
        }
    }
    std::cout << power(2, dsu.siz) << "\n";
}

int main()
{
    std::cin.tie(nullptr)->std::ios::sync_with_stdio(false);

    int T;
    std::cin >> T;
    while (T--) {
        solve();
    }

    return 0;
}

詳細信息

Test #1:

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

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: 8ms
memory: 3628kb

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: 4ms
memory: 3616kb

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 494th numbers differ - expected: '4', found: '2'