QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#622308#7900. Gifts from KnowledgeyangrunWA 9ms5908kbC++171.8kb2024-10-08 20:48:082024-10-08 20:48:10

Judging History

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

  • [2024-10-08 20:48:10]
  • 评测
  • 测评结果:WA
  • 用时:9ms
  • 内存:5908kb
  • [2024-10-08 20:48:08]
  • 提交

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 num[maxn];
char in[maxn];
int check(int l) {
  for(int i = 1; i <= l / 2; ++i) {
    if(in[i] != in[l - i + 1]) return 0;
  }
  return 1;
}
int r, c;
void solve() {
  r = qread(), c = qread();
  
  int res = 1, has = 1;
  for(int i = 1; i <= c; ++i) {
    num[i] = 0;
  }
  
  for(int i = 1, cur; i <= r; ++i) {
    scanf("%s", in + 1);
    
    cur = 2;
    for(int j = 1, id; j <= c; j++) {
      if(in[j] == '0') continue; 
      id = min(j, c - j + 1);
      if(num[id] + 1 == 2) {
        cur = 1;
      }
    }
    for(int j = 1, id; j <= c; j++) {
      if(in[j] == '0') continue; 
      id = min(j, c - j + 1);
      num[id]++;
      if(num[id] >= 3 || (id == (c + 1) / 2 && (c % 2) && num[id] >= 2)) {
        has = 0;
        break;
      }
    }
    
    res = res * cur % mod;
  }
  if(has) cout << res << '\n';
  else {
    cout << 0 << '\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: 1ms
memory: 3832kb

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: 3664kb

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: 9ms
memory: 5908kb

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'