QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#716555 | #7900. Gifts from Knowledge | yeah14 | WA | 18ms | 31052kb | C++17 | 3.7kb | 2024-11-06 15:31:34 | 2024-11-06 15:31:34 |
Judging History
answer
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
#define i128 _int128
#define fi first
#define se second
#define pb push_back
#define endl '\n'
#define int long long
const ll INF = 0x3f3f3f3f;
const ll N = 1e6 + 9;
const int mod = 1e9 + 7;
// inline int read(){
// int ans=0,sign=1;
// char ch = getchar();
// while(ch<'0'||ch>'9'){
// if(ch=='-'){
// sign=-1;
// }
// ch=getchar();
// }
// while(ch>='0'&&ch<='9'){
// ans = ans*10 + ch-'0';
// ch = getchar();
// }
// return ans*sign;
// }
int fp(int a, int x, int mod) {
int ans = 1;
while (x) {
if (x & 1)ans *= a % mod;
a *= a % mod;
a %= mod;
x /= 2;
}
return ans %= mod;
}
int fa[2 * N];
int cc[N];
vector<int>ccc[N];
map<int, int>ans;
set<int>p;
//vector<string> s;
int find(int p) {
if (fa[p] != p)return fa[p] = find(fa[p]);
else return p;
}
void uion(int x, int y) {
if (find(x) != find(y)) {
//cout<<1<<endl;
//cout<<find(x)<<" "<<find(y)<<endl;
fa[find(x)] = find(y);
}
}
void solve() {
int r, c;
cin >> r >> c;
bool flag = 0;
//char s[r + 1][c + 1];
//s.resize(r+2);
//初始化
//p.clear();
for (int i = 1; i <= 2 * r; i++) {
fa[i] = i;
//s[i].resize(c + 2);
}
for (int i = 1; i <= c; i++) {
ccc[i].clear();
///cc[i]=0;
}
//
char s;
for (int i = 1; i <= r; i++) {
for (int j = 1; j <= c; j++) {
cin >> s;
if (s == '1') {
//cc[j]++;
ccc[j].push_back(i);
}
}
}
for(int i=1;i<=c/2;i++){
if (ccc[i].size() + ccc[c - i + 1].size() > 2) {
cout<<0<<endl;
return ;
}
}
if(c%2==1){
if(ccc[(c+1)/2].size()>=2){
cout<<0<<endl;
return ;
}
}
for (int i = 1; i <= c; i++) {
int k1 = i, k2 = c - i + 1;
if (k1 == k2){
break;
}
if (ccc[k1].size() + ccc[k2].size() == 2) {
if (ccc[k1].size() == 2 || ccc[k2].size() == 2) {
int kk;
if (ccc[k1].size() == 2)kk = k1;
else kk = k2;
int i1 = ccc[kk][0];
int i2 = ccc[kk][1];
uion(i1, i2);
uion(i1 + r, i2 + r);
}
else {
int i1 = ccc[k1][0];
int i2 = ccc[k2][0];
if (i1 == i2)continue;
uion(i1, i2+r);
uion(i1 + r, i2);
}
}
}
int cnt = 0;
for (int i = 1; i <= r; i++) {
if (find(i) == find(i + r)) {
cout << 0 << endl;
return;
}
else {
if(find(i)==i){
cnt++;
}
if(find(i+r)==i+r){
cnt++;
}
}
}
//cout<<endl;
cnt/=2;
//cout<<cnt<<endl;
cout << fp(2, cnt, mod) << endl;
// cout<<r<<" "<<c<<endl;
// for(int i=1;i<=r;i++){
// for(int j=1;j<=c;j++){
// cout<<s[i][j];
// }
// cout<<endl;
// }
//cout<<endl;
}
signed main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int _ = 1;
// fac[0]=1;
// for(int i=1;i<=N-9;++i)fac[i]=(fac[i-1]*i)%mod;
cin >> _;
while (_--)solve();
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 3ms
memory: 29532kb
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: 18ms
memory: 30940kb
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: 18ms
memory: 29408kb
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: 11ms
memory: 31052kb
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 980th numbers differ - expected: '0', found: '2'