QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #696075 | #7900. Gifts from Knowledge | aa1234521# | WA | 35ms | 36560kb | C++20 | 991b | 2024-10-31 21:28:54 | 2024-10-31 21:28:55 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
constexpr int M = 1e6 + 10;
constexpr int MOD = 1e9 + 7;
string s[M];
int a[M];
void solve() {
int r, c;
cin >> r >> c;
for (int i = 1; i <= r; ++i) {
cin >> s[i];
a[i] = 0;
}
int ans = 1;
for (int j = 0; j < (c+1) / 2; ++j) {
int cnt = 0;
bool flag = true;
for (int i = 1; i <= r; ++i) {
if (s[i][j] != s[i][c - j - 1]) {
if (flag && a[i] == 0) {
ans = ans * 2 % MOD;
flag = false;
}
++cnt;
a[i] = 1;
} else {
if (s[i][j] == '1') {
cnt += 2;
}
}
if (cnt > 2) {
cout << "0\n";
return;
}
}
}
for (int i = 1; i <= r; ++i) {
if (a[i] == 0) {
ans = ans * 2 % MOD;
}
}
cout << ans << '\n';
}
int main() {
int T;
cin >> T;
while (T--)
solve();
}
/*
3
6
2 3 4 6 5 1
5
1 2 3 4 5
3
2 3 1
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 9ms
memory: 35968kb
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: 28ms
memory: 36560kb
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: 35ms
memory: 36004kb
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 215th numbers differ - expected: '32', found: '64'