QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#622434#7900. Gifts from KnowledgeyangrunWA 27ms62856kbC++172.3kb2024-10-08 21:42:192024-10-08 21:42:20

Judging History

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

  • [2024-10-08 21:42:20]
  • 评测
  • 测评结果:WA
  • 用时:27ms
  • 内存:62856kb
  • [2024-10-08 21:42:19]
  • 提交

answer

#include <bits/stdc++.h>
#define maxn 1000007
#define int long long
#define dl long double
#define mod 1000000007
using namespace std;
inline int pls(int a, int b) {int m = a + b; return m < mod ? m : m - mod;}
inline int dec(int a, int b) {int m = a - b; return m < 0 ? m + mod : m;}
inline int mul(int a, int b) {return 1ll * a * b % mod;}
inline int fpow(int a, int b) {
  int ans = 1;
  for(; b; b >>= 1,a = mul(a, a)) if(b & 1) ans = mul(ans, a);
  return ans;
}
inline int inv(int a) {return fpow(a, mod - 2);}
inline int dvi(int a, int b) {return mul(a, inv(b));};
inline int qread() {
  char c = getchar(); int num = 0, f = 1;
  for(; !isdigit(c); c=getchar()) if(c == '-') f = -1;
  for(; isdigit(c); c=getchar()) num = num * 10 + c - '0';
  return num * f;
}

int fa[maxn], fi[maxn];
char in[maxn];
int find(int u) {
  return (u == fa[u]) ? u : fa[u] = find(fa[u]);
} 
void cmb(int a, int b) {
  a = find(a), b = find(b);
  fa[a] = b;
}

string s[maxn];
vector<int> v[maxn];
int check(int u) {
  string base(s[1].size(), '0');
  for(int i : v[u]) {
    int flg = 1;
    for(int j = 0; s[i][j]; j++) {
      if(s[i][j] == '1' && base[j] == '1') {
        flg = 0; break;
      }
    }
    if(!flg) {
      flg = 1;
      reverse(s[i].begin(), s[i].end());
      for(int j = 0; s[i][j]; j++) {
        if(s[i][j] == '1' && base[j] == '1') {
          flg = 0; break;
        }
      }
    }
    if(!flg) return 0;
    for(int j = 0; s[i][j]; j++) {
      if(s[i][j] == '1') base[j] = '1';
    }
  }
  return 2;
}
int r, c;
void solve() {
  r = qread(), c = qread();
  
  int res = 1;
  for(int i = 1; i <= r; ++i) {
    fa[i] = i;
    v[i].clear();
  }
  for(int i = 0; i <= c; ++i) {
    fi[i] = 0;
  }
  
  for(int i = 1; i <= r; ++i) {
    cin >> s[i];
    for(int j = 0, id; j < c; j++) {
      if(s[i][j] == '0') continue; 
      id = min(j, c - j + 1);
      if(fi[id]) cmb(fi[id], i);
      else fi[id] = i;
    }
  }
  for(int i = 1; i <= r; i++) v[find(i)].push_back(i);
  for(int i = 1; i <= r; i++) {
    if(find(i) == i) res = res * check(i) % mod;
  }
  cout << res << '\n';
}
int t;
signed main() {
  t = qread();
  while(t--) {
    solve();
  }
  return 0;
}
/*
5
5 6
100001
010000
000010
000100
001000
*/

詳細信息

Test #1:

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

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: 27ms
memory: 62288kb

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: 27ms
memory: 62856kb

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
2048
32768
4
2
512
512
512
512
8
2
256
16
4096
512
64
16
4096
512
32
32768
8192
32
2048
128
32
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
256
256
32
2
2048
8192
8
64
8
2
16384
32768
32768
1024
4096
16384
16384
128
256
4...

result:

wrong answer 6th numbers differ - expected: '4096', found: '2048'