NOI.AC
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #196619 | #3433. Crisscross | FAT | 97 | 31ms | 2176kb | C++11 | 645b | 2023-10-29 08:39:26 | 2023-11-14 17:22:46 |
answer
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000;
char mp[maxn + 5][maxn + 5];
int sr[maxn + 5], sc[maxn + 5];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%s", mp[i] + 1);
for (int j = 1; j <= m; j++) sr[i] += mp[i][j] - '0';
}
for (int j = 1; j <= m; j++)
for (int i = 1; i <= n; i++) sc[j] += mp[i][j] - '0';
int ans = n + m + 1;
for (int i = 1; i <= n; i++) ans -= sr[i] == m;
for (int i = 1; i <= m; i++) ans -= sc[i] == n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) ans -= sr[i] == m - 1 && sc[j] == n - 1;
printf("%d", ans);
}
Details
小提示：点击横条可展开更详细的信息
Test #1:
score: 10
Accepted
time: 1ms
memory: 1196kb
input:
4 4 1111 1011 1100 1100
output:
6
result:
ok 1 number(s): "6"
Test #2:
score: 10
Accepted
time: 0ms
memory: 1192kb
input:
1 1000 011001110110011101110110000011110011001001110111010001110001110100100010011010001001110111100...
output:
488
result:
ok 1 number(s): "488"
Test #3:
score: 10
Accepted
time: 0ms
memory: 1196kb
input:
1 1000 001110111101111001001110111111000101001110110110101100001111010001101111010100010010010001011...
output:
482
result:
ok 1 number(s): "482"
Test #4:
score: 10
Accepted
time: 7ms
memory: 2176kb
input:
1000 1000 010101000000101000010101111101010010100110110001100011110010100001010011001010110001001101...
output:
2001
result:
ok 1 number(s): "2001"
Test #5:
score: 10
Accepted
time: 5ms
memory: 2176kb
input:
1000 1000 000001101010101101101001010100001000011110100000011011010101000000000111001011010110011110...
output:
2001
result:
ok 1 number(s): "2001"
Test #6:
score: 10
Accepted
time: 0ms
memory: 2176kb
input:
1000 1000 000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...
output:
2001
result:
ok 1 number(s): "2001"
Test #7:
score: 10
Accepted
time: 7ms
memory: 2172kb
input:
1000 1000 000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...
output:
2001
result:
ok 1 number(s): "2001"
Test #8:
score: 10
Accepted
time: 2ms
memory: 2172kb
input:
1000 1000 100000010101010111000001011110000000001100000011110001110010101011110100000010011000011100...
output:
2001
result:
ok 1 number(s): "2001"
Test #9:
score: 10
Accepted
time: 4ms
memory: 2176kb
input:
1000 1000 000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...
output:
2001
result:
ok 1 number(s): "2001"
Test #10:
score: 10
Accepted
time: 5ms
memory: 2172kb
input:
1000 1000 110001000111111010010100001000100011010001001101000001001001010111010101010111111110100001...
output:
2001
result:
ok 1 number(s): "2001"
Extra Test:
score: -3
Extra Test Failed : Wrong Answer on 3
time: 0ms
memory: 1196kb
input:
2 2 01 10
output:
1
result:
wrong answer 1st numbers differ - expected: '3', found: '1'
