QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#695989#7900. Gifts from KnowledgeKotomiRE 10ms3844kbC++201.6kb2024-10-31 21:14:022024-10-31 21:14:04

Judging History

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

  • [2024-10-31 21:14:04]
  • 评测
  • 测评结果:RE
  • 用时:10ms
  • 内存:3844kb
  • [2024-10-31 21:14:02]
  • 提交

answer

#include <bits/stdc++.h>

#define multi_test 1
#define DEBUG 0

using LL = long long;
using PII = std::pair<int, int>;

constexpr int mod = 1e9 + 7;

LL fpow(LL a, LL b, LL mod) {
  LL res = 1;
  for (; b; b >>= 1) {
    if (b & 1) {
      res = res * a % mod;
    }
    a = a * a % mod;
  }
  return res;
}

int solve() {
  int n, m;
  std::cin >> n >> m;

  std::vector<std::string> a(n);
  std::vector<std::vector<int>> pos(m);

  int cnt1 = 0;
  for (int i = 0; i < n; ++i) {
    std::cin >> a[i];
    for (int j = 0; j < m; ++j) {
      if (a[i][j] == '1') {
        ++cnt1;
        pos[j].push_back(i);
        if (cnt1 > m or (LL)pos[j].size() + pos[m - 1 - j].size() > 2)
          return 0;
      }
    }
  }

  int cnt = 0;
  std::vector<bool> vis(n);
  for (int i = 0; i < n; ++i) {
    if (vis[i])
      continue;
    cnt++;
    vis[i] = true;

    auto &s = a[i];
    for (int j = 0; j < m; ++j) {
      if (s[j] == '0')
        continue;

      std::vector<int> tmp;
      for (auto x : pos[j])
        if (x != i)
          tmp.push_back(x);
      for (auto x : pos[m - 1 - j])
        if (x != i)
          tmp.push_back(x);

      if (tmp.size() == 1) {
        vis[tmp[0]] = true;
      }
    }
  }

  return fpow(2, cnt, mod);
}

int main() {
  std::cin.tie(nullptr)->sync_with_stdio(false);
  if constexpr (DEBUG) {
    std::cerr.tie(nullptr);
    freopen("data.in", "r", stdin);
  }

  int T = 1;
  if constexpr (multi_test) {
    std::cin >> T;
  }

  while (T--) {
    std::cout << solve() << '\n';
  }
}

详细

Test #1:

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

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: 10ms
memory: 3624kb

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
Runtime Error

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:


result: