QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#694298 | #7900. Gifts from Knowledge | test_algth# | WA | 20ms | 81860kb | C++14 | 2.9kb | 2024-10-31 17:40:17 | 2024-10-31 17:40:18 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
typedef pair <int, int> pii;
inline int read() {
int x = 0, f = 0;
char c = getchar();
while (!isdigit(c)) {if (c == '-') f = 1; c = getchar();}
while (isdigit(c)) x = (x << 1) + (x << 3) + (c & 15), c = getchar();
return f? -x : x;
}
const int MAXN = 1e6;
const int Mod = 1e9 + 7;
vector <int> G[MAXN*2 + 10];
vector <int> pos[MAXN + 10];
int vis[MAXN + 10], p2[MAXN + 10];
void clear(int n, int m) {
for (int i = 1; i <= n; ++i) {
vis[i] = 0;
G[i].clear();
//vis[i] = vis[i + n] = 0;
//G[i][0].clear(), G[i][1].clear();
}
for (int i = 1; i <= m; ++i)
pos[i].clear();
}
void dfs(int x) {
if (vis[x]) return;
vis[x] = 1;
for (auto v : G[x])
dfs(v);
}
inline void add(int x, int y) {
G[x].pb(y); G[y].pb(x);
}
int main() {
int T = read(); p2[0] = 1;
for (int i = 1; i <= MAXN; ++i)
p2[i] = (p2[i - 1] + p2[i - 1]) % Mod;
while (T--) {
int n, m;
n = read(), m = read();
for (int i = 1; i <= n; ++i) {
static char str[MAXN + 10];
scanf("\n%s", str + 1);
for (int j = 1; j <= m; ++j)
if (str[j] == '1')
pos[j].pb(i);
}
bool ok = 1;
for (int j = 1; j <= (m + 1) / 2; ++j) {
int k = m - j + 1;
if (j == k) {
ok = pos[j].size() <= 1;
continue;
}
int cc = pos[j].size() + pos[k].size();
if (cc > 2) {
ok = 0;
break;
}
else {
if (cc <= 1) continue;
if (pos[j].size() ^ pos[k].size()) {
int p = pos[j].size()? j : k;
add(pos[p][0], pos[p][1]);
/*
G[pos[p][0]].pb(pos[p][1] + n);
G[pos[p][0] + n].pb(pos[p][1]);
G[pos[p][1]].pb(pos[p][0] + n);
G[pos[p][1] + n].pb(pos[p][0]);
*/
}
else {
add(pos[j][0], pos[k][0]);
/*
G[pos[j][0]].pb(pos[k][0]);
G[pos[j][0] + n].pb(pos[k][0] + n);
G[pos[k][0]].pb(pos[j][0]);
G[pos[k][0] + n].pb(pos[j][0] + n);
*/
}
}
}
if (!ok) {
printf("0\n");
}
else {
int cnt = 0;
for (int i = 1; i <= n; ++i)
if (!vis[i]) ++cnt, dfs(i);
printf("%d\n", p2[cnt]);
}
clear(n, m);
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 12ms
memory: 79924kb
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: 20ms
memory: 81860kb
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: 15ms
memory: 79964kb
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 2380th numbers differ - expected: '0', found: '4'