QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#613930 | #7900. Gifts from Knowledge | wsxcb# | WA | 22ms | 3616kb | C++17 | 2.0kb | 2024-10-05 15:04:59 | 2024-10-05 15:10:04 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb push_back
#define fi first
#define se second
const int N = 1e6 + 5, mod = 1e9 + 7;
int fa[N];
int find(int x) {
return fa[x] == x ? x : fa[x] = find(fa[x]);
}
void solve() {
int n, m;
cin >> n >> m;
vector<string> s(n + 1);
vector<vector<int>>e(n + 1);
vector<vector<bool>>vis(n + 1, vector<bool>(m + 1));
for (int i = 1 ; i <= n ; i++) {
fa[i] = i;
cin >> s[i];
s[i] = " " + s[i];
for (int j = 1; j <= m; j++) {
if (s[i][j] == '1') {
e[i].pb(j);
}
}
}
vector<int>v(m + 1);
for (int i = 1; i <= n; i++) {
int ok = 1;
for (auto x : e[i]) {
if (v[x]) {
ok = 0;
break;
}
}
if (ok) {
for (auto x : e[i]) {
v[x] = 1;
vis[i][x] = 1;
}
} else {
for (auto &x : e[i]) {
x = m - x + 1;
if (v[x]) {
cout << "0\n";
return ;
}
v[x] = 1;
vis[i][x] = 1;
}
}
}
// for (int i = 1; i <= n; i++) {
// for (int j = 1; j <= m; j++)
// cout << vis[i][j] << ' ';
// cout << '\n';
// }
set<int>qe;
ll ans = 1;
for (int i = 1; i <= n; i++) {
vector<int>tt;
if (e[i].size() == 0) {
ans = ans * 2 % mod;
continue;
}
for (auto j : qe) {
int x = find(i), y = find(j);
if (x == y)
continue;
if (e[x].size() > e[y].size())
swap(x, y);
int ok = 0;
for (auto t : e[x]) {
t = m - t + 1;
if (vis[y][t]) {
ok = 1;
break;
}
}
if (ok) {
for (auto t : e[x]) {
if (!vis[y][t]) {
e[y].pb(t);
vis[y][t] = 1;
}
}
fa[x] = y;
tt.pb(x);
}
}
qe.insert(find(i));
for (auto x : tt) {
auto it = qe.find(x);
if (it != qe.end())
qe.erase(it);
}
}
for (int i = 1; i <= (int)qe.size(); i++)
ans = ans * 2 % mod;
cout << ans << '\n';
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
cin >> t;
while (t--)
solve();
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3580kb
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: 15ms
memory: 3508kb
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: 0
Accepted
time: 13ms
memory: 3556kb
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:
ok 15759 numbers
Test #4:
score: -100
Wrong Answer
time: 22ms
memory: 3616kb
input:
15734 3 6 000101 010000 001110 5 7 0010010 1000000 0101000 0000000 0000000 10 9 000000000 100000000 000000000 000000000 000010000 000000001 000000000 000000000 000000000 000000000 5 14 10000000000000 00001001000000 00000100000000 00000000000000 00000100000000 5 14 00000000000000 00010000000100 00000...
output:
0 16 512 16 32 4096 0 256 0 0 0 0 4096 8 1024 128 8192 0 128 0 2 0 0 32 64 0 0 0 4096 64 8 8 32 128 64 4096 2 512 16384 4 2 0 0 32 0 4096 8 0 8192 256 256 64 0 32 0 32 0 256 4 16384 1024 4 0 16 256 0 2048 64 8 0 0 32768 2048 512 2048 2 0 8192 0 2 2048 16 512 256 1024 0 0 2 32 512 16384 0 32 1024 102...
result:
wrong answer 102nd numbers differ - expected: '64', found: '0'