QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#634922 | #7900. Gifts from Knowledge | HSTKwow | WA | 51ms | 159628kb | C++14 | 3.2kb | 2024-10-12 18:21:08 | 2024-10-12 18:21:09 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
using namespace std;
#define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
typedef long double ld;
const int mod=1e9+7;
const int N =2e6+10;
int dfn[N],low[N],tot=0,cnt=0,in[N],belong[N];
stack<int>st;
vector<int>ans[N],g[N];
vector<int>e[N]; //存储每一列有哪一行为1
void dfs(int u,int fa){
dfn[u]=low[u]=++tot;
in[u]=1;
st.push(u);
for(auto v:g[u]){
if(!dfn[v]){
dfs(v,u);
low[u]=min(low[u],low[v]);
}else{
if(in[v]){
low[u]=min(low[u],low[v]);
}
}
}
if(dfn[u]==low[u]){
cnt++;
ans[cnt].push_back(u);
in[u]=0;
belong[u]=cnt;
while(st.top()!=u){
ans[cnt].push_back(st.top());
in[st.top()]=0;
belong[st.top()]=cnt;
st.pop();
}
st.pop();
}
}
void sol(){
int r,c;
cin>>r>>c;
vector<string>a(r);
for(int i=1;i<=r*2;i++){
g[i].clear();
in[i]=belong[i]=low[i]=dfn[i]=0;
}
for(int i=1;i<=c;i++){
e[i].clear();
}
for(int i=1;i<=r;i++){
string s;cin>>s;
s=' '+s;
for(int j=1;j<=c;j++){
if(s[j]=='1'){ //第i行第j列为1
e[j].push_back(i);
}
}
}
int fg=0;
if(c&1){ //奇数列的最中间那一列有2个
if(e[c/2+1].size()>=2){
fg=1;
}
}
for(int i=1;i<=c/2;i++){ //第i列和第c-i+1列一共1的个数超过3个
if(e[i].size()+e[c-i+1].size()>=3){
cout<<i<<">>"<<e[i].size()<<endl;
cout<<c-i+1<<">>"<<e[c-i+1].size()<<endl;
fg=1;
}
}
if(fg){
cout<<0<<endl;
return;
}
//开始建图
for(int i=1;i<=c/2;i++){
if(e[i].size()+e[c-i+1].size()<2){ //没有约束关系
continue;
}
//第i列和c-i+1这列1的个数为2
int a,b;
if(e[i].size()==1){ //第i列就一个1
a=e[i][0],b=e[c-i+1][0]; //第i列第一个1的行号
if(a==b){
continue;
}
g[a].push_back(b+r);
g[a+r].push_back(b);
g[b].push_back(a+r);
g[b+r].push_back(a);
}else{
if(e[i].size()){ //第i列有两个1
a=e[i][0],b=e[i][1];
}else{ //第c-i+1有两个1
a=e[c-i+1][0],b=e[c-i+1][1];
}
g[a].push_back(b+r);
g[a+r].push_back(b);
g[b].push_back(a+r);
g[b+r].push_back(a);
}
}
int res=1,q=0;
for(int i=1;i<=r*2;i++){ //遍历行
if(!dfn[i]){
dfs(i,0);q++;
}
}
for(int i=1;i<=r;i++){
if(belong[i]==belong[i+r]){ //属于同一个连通分量
res=0;
}
}
for(int i=1;i<=q/2;i++){
res=(res*2)%mod;
}
cout<<res<<endl;
}
signed main(){
IOS;
int t;cin>>t;
while(t--){
sol();
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 28ms
memory: 152404kb
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: 45ms
memory: 159628kb
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: 51ms
memory: 159616kb
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 output format Expected integer, but "4>>2" found