QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#720097 | #7900. Gifts from Knowledge | futarian | WA | 14ms | 39456kb | C++11 | 2.0kb | 2024-11-07 10:37:14 | 2024-11-07 10:37:14 |
Judging History
answer
#include "bits/stdc++.h"
using namespace std;
const int Len = 1e6 + 5 , mod = 1e9 + 7;
int head[Len],cnt,col[Len];
struct node
{
int next,to;
}edge[Len << 1];
inline void add(int from,int to)
{
edge[++ cnt].to = to;
edge[cnt].next = head[from];
head[from] = cnt;
}
int ans,fa[Len << 1],flg[Len],flw[Len],N,n,m;
inline void makeSet(int x){cnt = 0;for(int i = 1 ; i <= x ; i ++) flg[i] = col[i] = head[i] = flw[i] = 0 , fa[i] = i;}
int findSet(int x){return fa[x] == x ? fa[x] : fa[x] = findSet(fa[x]);}
inline void unionSet(int x,int y)
{
if(x == y) return;
add(x , y) , add(y , x);
int u = findSet(x) , v = findSet(y);
if(u == v)
{
//ans = 0;
return;
}
fa[u] = v;
}
vector<int> vc[Len];
char s[Len];
void dfs(int x)
{
for(int e = head[x] ; e ; e = edge[e].next)
{
int to = edge[e].to;
if(flg[to])
{
if(col[to] == col[x]) ans = 0;
continue;
}
flg[to] = 1 , col[to] = 3 - col[x];
dfs(to);
}
}
signed main()
{
int T;scanf("%d",&T);
while(T --)
{
scanf("%d %d",&n,&m);ans = 1;
for(int i = 1 ; i <= m ; i ++)
{
vector<int> clr;
swap(clr , vc[i]);
}
for(int i = 1 ; i <= n ; i ++)
{
scanf("%s",s + 1);
for(int j = 1 ; j <= m ; j ++) if(s[j] == '1') vc[j].push_back(i);
}
N = n;
makeSet(N);
for(int i = 1 ; i <= m / 2 + (m % 2) ; i ++)
{
int SZ = (int)vc[i].size() + (i != m - i + 1) * (int)vc[m - i + 1].size();
if(SZ >= 3 || (i == m - i + 1 && SZ >= 2)) ans = 0;
else if(SZ == 2)
{
//printf("#%d\n",i);
if((int)vc[i].size() == 2) unionSet(vc[i][0] , vc[i][1]);
else if((int)vc[m - i + 1].size() == 2) unionSet(vc[m - i + 1][0] , vc[m - i + 1][1]);
else unionSet(vc[m - i + 1][0] , vc[i][0]);
}
}
for(int i = 1 ; i <= n ; i ++)
{
if(flg[i]) continue;
flg[i] = col[i] = 1;
dfs(i);
}
for(int i = 1 ; i <= n ; i ++)
{
int f = findSet(i);
if(flw[f]) continue;
flw[f] = 1;
ans = 1ll * ans * 2 % mod;
}
printf("%d\n",ans);
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 38756kb
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: 10ms
memory: 39456kb
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: 14ms
memory: 39432kb
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'