QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #619948 | #7900. Gifts from Knowledge | REN5511 | WA | 52ms | 3824kb | C++14 | 4.3kb | 2024-10-07 16:07:25 | 2024-10-07 16:07:25 |
Judging History
answer
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
typedef long long ll;
ll qpow(ll x, ll b,ll mod = 1e9 + 7)
{
ll ans = 1,k = x;
while (b != 0)
{
if (b & 1)ans = ans * k;
ans %= mod;
k = k * k;
b = b / 2;
}
return ans;
}
int fa[1000000 + 100];
int find(int x) {
if (fa[x] == x)return x;
return fa[x] = find(fa[x]);
}
void merge(int a, int b) {
fa[find(a)] = fa[find(b)];
}
int main()
{
int t;
cin >> t;
while (t--) {
int r, c;
cin >> r >> c;
vector<vector<int>>m(r + 1);
vector<int>vis(c + 1, 0);
for (int i = 0; i <= r+1; i++) {
fa[i] = i;
}
int now = 0;
for (int i = 1; i <= r; i++) {
for (int j = 1; j <= c; j++) {
char temp;
cin >> temp;
if (temp == '1') {
m[i].push_back(j);
}
}
}
int cnt = 0;
for (int i = 1; i <= r; i++) {
if (m[i].size() == 0) {
cnt++;
}
}
int bad = 0;
for (int i = 1; i <= r; i++) {
if (m[i].size() == 0)continue;
int org=0,t=0;
now++;
vector<int>orglist, tlist;
for (auto v : m[i]) {
if (vis[v] != 0) {
org = vis[v];
orglist.push_back(org);
merge(org, now);
}
//if (vis[v] != 0&&org==0) {
// org = vis[v];
//}
/*else if (vis[v] != org&&org!=0) {
vis[v] = org;
}*/
}
for (auto v : m[i]) {
if (vis[c - v + 1] != 0) {
t = vis[c - v + 1];
tlist.push_back(t);
//for (auto to : orglist) {
if (find(vis[c - v + 1]) == find(now) && t != 0) {
bad = 1;
break;
}
//}
}
//if (vis[c - v + 1] != 0&&t==0) {
// t = vis[c - v + 1];
//}
/*else if (vis[c - v + 1] != t&&t!=0) {
vis[c - v + 1] = t;
}*/
}
for (auto to : tlist) {
merge(to, now);
}
if (bad == 1)break;
if (org == 0&&t==0) {
for (auto v : m[i]) {
vis[v] = now;
}
}
else if(t==0){
//for (auto v : m[i]) {
// vis[v] = org;
//}
//merge(org, now);
for (auto v : m[i]) {
vis[c - v + 1] = now;
}
}
else if(org==0){
//for (auto v : m[i]) {
// vis[v] = t;
//}
//merge(t, now);
for (auto v : m[i]) {
vis[v] = now;
}
}
else {
//merge(org, now);
//merge(t, now);
for (auto v : m[i]) {
if(vis[v]!=0){
vector<int>need;
for (int h = 0; h < vis.size(); h++) {
if (vis[h] == vis[v]) {
need.push_back(h);
}
}
for (auto h : need) {
if (vis[c - h + 1] != 0)bad = 1;
swap(vis[h], vis[c - h + 1]);
}
}
}
for (auto v : m[i]) {
if (vis[v] != 0)bad = 1;
vis[v] = now;
}
}
}
set<int>ok;
for (auto i : vis) {
if(i!=0)
ok.insert(find(i));
}
if (bad == 1) {
cout << 0 << "\n";
}
else {
cout << qpow(2, ok.size() + cnt) << "\n";
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3568kb
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: 36ms
memory: 3600kb
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: 43ms
memory: 3768kb
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: 52ms
memory: 3824kb
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 4141st numbers differ - expected: '128', found: '0'