QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#702566#7900. Gifts from KnowledgeXiaoYang3WA 40ms34888kbC++231.4kb2024-11-02 16:12:552024-11-02 16:12:57

Judging History

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

  • [2024-11-02 16:12:57]
  • 评测
  • 测评结果:WA
  • 用时:40ms
  • 内存:34888kb
  • [2024-11-02 16:12:55]
  • 提交

answer

#include <bits/stdc++.h>
using ll = long long;
using namespace std;
using pii = pair<int, int>;
const int N = 1e6 + 5;
const int P = 1e9 + 7;
ll n, m, ans;
string s[N];
void solve() {
    cin >> n >> m;

    vector<vector<int>> a(n + 2, vector<int>(m + 2));
    for (int i = 1; i <= n; i++) {
        cin >> s[i];
        s[i] = ' ' + s[i];
        for (int j = 1; j <= (m + 1) / 2; j++) {
            if (s[i][j] == '1') {
                a[i][j]++;
            }
            if (s[i][m - j + 1] == '1') {
                a[i][j]++;
            }
            // cout << a[i][j] << " ";
        }
    }

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= (m + 1) / 2; j++) {
            a[i][j] += a[i - 1][j];
            if (a[i][j] > 2) {
                cout << "0\n";
                return;
            }
        }
    }
    auto b = a;
    ans = 2;
    for (int i = 2; i <= n; i++) {
        int res = 0;
        for (int j = 1; j <= (m + 1) / 2; j++) {
            //  cout << b[i - 1][j] << '\n';
            if (b[i - 1][j] == 1 && b[i][j] == 2) {
                res = 1;
            }
        }
        if (!res) {
            ans *= 2;
            ans %= P;
        }
    }
    cout << ans << '\n';
}

int main() {
    // std::ios::sync_with_stdio(false);

    // std::cin.tie(nullptr);

    int _ = 1;
    cin >> _;

    while (_--) {
        solve();
    }

    return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 2ms
memory: 34868kb

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: 29ms
memory: 34832kb

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: 40ms
memory: 34888kb

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'