QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #710976 | #7900. Gifts from Knowledge | MIS_T__ | WA | 39ms | 3600kb | C++23 | 2.2kb | 2024-11-04 23:34:37 | 2024-11-04 23:34:37 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
const int N = 1e6+10;
const int MOD = 1e9+7;
int Set[N];
void init(int n){
for (int i=0;i<=n;i++){
Set[i] = i;
}
}
int findx(int x){
if (Set[x] != x) {
Set[x] = findx(Set[x]);
}
return Set[x];
}
void merge(int a,int b){
Set[findx(b)] = findx(a);
}
LL qpower(LL a,LL k){
LL res = 1;
while (k){
if (k&1) res = res * a % MOD;
a = a * a % MOD;
k >>= 1;
}
return res;
}
int main(){
int T;
cin >> T;
while (T--){
int ok = 1;
LL r,c;
string s;
cin >> r >> c;
init(r);
map<int,vector<int>> G;
for (int i=1;i<=r;i++){
cin >> s;
for (int j=1;j<=c;j++){
if(s[j-1] == '1'){
G[j].push_back(i);
}
}
}
for (int i=1;i<=(c+1)/2;i++){
if (G[i].size() + G[c-i+1].size() > 2){
ok = 0;
break;
} else{
if (G[i].size() == 1 && G[c-i+1].size() == 1){
if (findx(G[i][0]) == findx(G[c-i+1][0]) && G[i][0] != G[c-i+1][0]){
ok = 0;
break;
}
merge(G[i][0],G[c-i+1][0]);
} else if (G[i].size() == 2){
if (findx(G[i][0]) == findx(G[i][1])){
ok = 0;
break;
}
merge(G[i][0],G[i][1]);
} else if (G[c-i+1].size() == 2){
if (findx(G[c-i+1][0]) == findx(G[c-i+1][1])){
ok = 0;
break;
}
merge(G[c-i+1][0],G[c-i+1][1]);
}
}
}
set<int> a;
for (int i=1;i<=r;i++){
a.insert(findx(i));
}
LL ans = qpower(2,(int)a.size());
cout << (ok?ans:0) << '\n';
}
}
// 3 10
// 0000101010
// 0100001000
// 0000000000
// 3 5
// 01100
// 10001
// 00010
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3472kb
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: 39ms
memory: 3584kb
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: 34ms
memory: 3600kb
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 1014th numbers differ - expected: '2', found: '0'