CSES - HIIT Open 2018 - Results
Submission details
Task:Grid
Sender:Ukkonen Fan Club
Submission time:2018-05-26 11:37:29
Language:C++
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.02 sdetails
#2ACCEPTED0.01 sdetails
#3ACCEPTED0.02 sdetails
#4ACCEPTED0.01 sdetails
#5ACCEPTED0.01 sdetails
#6ACCEPTED0.01 sdetails
#7ACCEPTED0.01 sdetails
#8ACCEPTED0.01 sdetails
#9ACCEPTED0.01 sdetails
#10ACCEPTED0.01 sdetails
#11ACCEPTED0.01 sdetails
#12ACCEPTED0.02 sdetails
#13ACCEPTED0.01 sdetails
#14ACCEPTED0.01 sdetails
#15ACCEPTED0.01 sdetails
#16ACCEPTED0.01 sdetails
#17ACCEPTED0.03 sdetails
#18ACCEPTED0.02 sdetails
#19ACCEPTED0.02 sdetails
#20ACCEPTED0.03 sdetails
#21ACCEPTED0.03 sdetails
#22ACCEPTED0.03 sdetails

Code

#include <bits/stdc++.h>
using namespace std;
int n;

string m[1010];
bool ch[1010][1010];

int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin >> n;
    for (int i=0;i<n;++i)cin>>m[i];
    int no=0;
    for (int i=0;i<n;++i){
        bool tk=1;
        for (int j=0;j<n;++j){
            if (m[i][j]!='1') tk=0;
        }
        if (tk){
            ++no;
            for (int j=0;j<n;++j){
                ch[i][j]=1;
            }
        }
    }
    for (int j=0;j<n;++j){
        bool tk=1;
        for (int i=0;i<n;++i){
            if (m[i][j]!='1') tk=0;
        }
        if (tk){
            ++no;
            for (int i=0;i<n;++i){
                ch[i][j]=1;
            }
        }
    }
    for (int i=0;i<n;++i){
        for (int j=0;j<n;++j){
            if (m[i][j]=='1' && !ch[i][j]) no=-1;
        }
    }
    if (no==2*n) no=n;
    cout << no << "\n";
}

Test details

Test 1

Verdict: ACCEPTED

input
1
0

correct output
0

user output
0

Test 2

Verdict: ACCEPTED

input
1
1

correct output
1

user output
1

Test 3

Verdict: ACCEPTED

input
2
00
00

correct output
0

user output
0

Test 4

Verdict: ACCEPTED

input
2
10
00

correct output
-1

user output
-1

Test 5

Verdict: ACCEPTED

input
2
11
00

correct output
1

user output
1

Test 6

Verdict: ACCEPTED

input
2
11
01

correct output
2

user output
2

Test 7

Verdict: ACCEPTED

input
2
11
11

correct output
2

user output
2

Test 8

Verdict: ACCEPTED

input
3
000
000
000

correct output
0

user output
0

Test 9

Verdict: ACCEPTED

input
3
100
100
100

correct output
1

user output
1

Test 10

Verdict: ACCEPTED

input
3
101
101
101

correct output
2

user output
2

Test 11

Verdict: ACCEPTED

input
3
111
101
101

correct output
3

user output
3

Test 12

Verdict: ACCEPTED

input
3
111
000
000

correct output
1

user output
1

Test 13

Verdict: ACCEPTED

input
3
111
000
111

correct output
2

user output
2

Test 14

Verdict: ACCEPTED

input
3
111
100
111

correct output
3

user output
3

Test 15

Verdict: ACCEPTED

input
3
111
101
111

correct output
4

user output
4

Test 16

Verdict: ACCEPTED

input
3
111
111
111

correct output
3

user output
3

Test 17

Verdict: ACCEPTED

input
1000
000000000000000000000000000000...

correct output
0

user output
0

Test 18

Verdict: ACCEPTED

input
1000
000000000000000000000000000000...

correct output
10

user output
10

Test 19

Verdict: ACCEPTED

input
1000
100000000000000000100000000000...

correct output
41

user output
41

Test 20

Verdict: ACCEPTED

input
1000
000000100000000001000000010000...

correct output
192

user output
192

Test 21

Verdict: ACCEPTED

input
1000
111111111111111111111111111111...

correct output
999

user output
999

Test 22

Verdict: ACCEPTED

input
1000
111111111111111111111111111111...

correct output
1000

user output
1000