QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#624527 | #7900. Gifts from Knowledge | Zeoy# | WA | 12ms | 3652kb | C++20 | 2.2kb | 2024-10-09 16:02:12 | 2024-10-09 16:02:12 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
#define endl "\n"
const int N = 1e6 + 10;
const ll inf = 1ll << 60, mod = 1e9 + 7;
ll ksm(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1) res = res * a % mod;
b >>= 1;
a = a * a % mod;
}
return res;
}
void solve() {
int n, m; cin >> n >> m;
vector<string> a(n + 10);
int cnt = 0;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
a[i] = " " + a[i];
for (int j = 1; j <= m; ++j) {
if (a[i][j] == '1') cnt += 1;
}
}
if (cnt > m) {
cout << 0 << endl;
return;
}
vector<int> val(n + 10);
vector<int> b(m + 10);
for (int i = 1; i <= n; ++i) {
int x = 0, y = 0;
for (int j = 1; j <= m; ++j) {
if (a[i][j] == '1') {
y += 1;
if (!b[j] && !b[m - j + 1]) x += 1;
else if (b[j] && b[m - j + 1]) {
cout << 0 << endl;
return;
}
}
}
if (x == y) val[i] += 1;
for (int j = 1; j <= m; ++j) {
b[j] |= (a[i][j] == '1');
}
}
b = vector<int>(m + 10, 0);
for (int i = n; i >= 1; --i) {
int x = 0, y = 0;
for (int j = 1; j <= m; ++j) {
if (a[i][j] == '1') {
y += 1;
if (!b[j] && !b[m - j + 1]) x += 1;
else if (b[j] && b[m - j + 1]) {
cout << 0 << endl;
return;
}
}
}
if (x == y) val[i] += 1;
for (int j = 1; j <= m; ++j) {
b[j] |= (a[i][j] == '1');
}
}
int ans = 0;
for (int i = 1; i <= n; ++i) {
ans += (val[i] == 2);
}
if (ans == n) cout << ksm(2, ans) << endl;
else cout << ksm(2, ans + 1) << endl;
}
/*
3
3 5
01100
10001
00010
2 1
1
1
2 3
001
001
1
3 3
100
010
001
1
4 5
01100
00011
10000
00000
1
2 3
010
010
*/
signed main() {
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int _ = 1;
cin >> _;
while(_--) solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3564kb
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: 12ms
memory: 3652kb
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: 8ms
memory: 3532kb
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 521st numbers differ - expected: '4', found: '2'