NOI.AC
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #197990 | #3433. Crisscross | hsfzbzjr | 100 | 38ms | 2184kb | C++11 | 896b | 2023-11-16 21:09:00 | 2023-11-16 21:09:01 |
answer
#include<bits/stdc++.h>
using namespace std;
int n,m;
char mp[1010][1010];
namespace subtask1{
void solve(){
int cnt0=0;
for(int i=1;i<=m;i++)if(mp[1][i]=='0')cnt0++;
if(cnt0==0)printf("1\n");
else if(cnt0==1)printf("2\n");
else printf("%d\n",cnt0+2);
}
}
namespace subtask2{
int cntR[1010],cntC[1010];
void solve(){
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)cntR[i]+=(mp[i][j]=='1'),cntC[j]+=(mp[i][j]=='1');
int ans=n+m+1;
for(int i=1;i<=n;i++)
if(cntR[i]==m)ans--;
for(int j=1;j<=m;j++)
if(cntC[j]==n)ans--;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)if(mp[i][j]=='0'){
if(cntR[i]==m-1&&cntC[j]==n-1)ans--;
}
printf("%d\n",ans);
}
}
int main(){
scanf("%d %d",&n,&m);
for(int i=1;i<=n;i++)
scanf("%s",mp[i]+1);
if(n==1)
subtask1::solve();
else
subtask2::solve();
return 0;
}
这程序好像有点Bug，我给组数据试试？
详细
小提示：点击横条可展开更详细的信息
Test #1:
score: 10
Accepted
time: 1ms
memory: 1204kb
input:
4 4 1111 1011 1100 1100
output:
6
result:
ok 1 number(s): "6"
Test #2:
score: 10
Accepted
time: 0ms
memory: 1196kb
input:
1 1000 011001110110011101110110000011110011001001110111010001110001110100100010011010001001110111100...
output:
488
result:
ok 1 number(s): "488"
Test #3:
score: 10
Accepted
time: 0ms
memory: 1192kb
input:
1 1000 001110111101111001001110111111000101001110110110101100001111010001101111010100010010010001011...
output:
482
result:
ok 1 number(s): "482"
Test #4:
score: 10
Accepted
time: 6ms
memory: 2184kb
input:
1000 1000 010101000000101000010101111101010010100110110001100011110010100001010011001010110001001101...
output:
2001
result:
ok 1 number(s): "2001"
Test #5:
score: 10
Accepted
time: 7ms
memory: 2184kb
input:
1000 1000 000001101010101101101001010100001000011110100000011011010101000000000111001011010110011110...
output:
2001
result:
ok 1 number(s): "2001"
Test #6:
score: 10
Accepted
time: 4ms
memory: 2180kb
input:
1000 1000 000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...
output:
2001
result:
ok 1 number(s): "2001"
Test #7:
score: 10
Accepted
time: 0ms
memory: 2184kb
input:
1000 1000 000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...
output:
2001
result:
ok 1 number(s): "2001"
Test #8:
score: 10
Accepted
time: 4ms
memory: 2184kb
input:
1000 1000 100000010101010111000001011110000000001100000011110001110010101011110100000010011000011100...
output:
2001
result:
ok 1 number(s): "2001"
Test #9:
score: 10
Accepted
time: 7ms
memory: 2184kb
input:
1000 1000 000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...
output:
2001
result:
ok 1 number(s): "2001"
Test #10:
score: 10
Accepted
time: 9ms
memory: 2180kb
input:
1000 1000 110001000111111010010100001000100011010001001101000001001001010111010101010111111110100001...
output:
2001
result:
ok 1 number(s): "2001"
Extra Test:
score: 0
Extra Test Passed
