CSES - HIIT Open 2018 - Results
 Task: Grid Sender: DROP TABLE Submission time: 2018-05-26 12:42:43 Language: Python3 Status: READY Result: TIME LIMIT EXCEEDED
Test results
testverdicttime
#1ACCEPTED0.04 sdetails
#2ACCEPTED0.04 sdetails
#3ACCEPTED0.06 sdetails
#4ACCEPTED0.04 sdetails
#5ACCEPTED0.05 sdetails
#6ACCEPTED0.04 sdetails
#7ACCEPTED0.04 sdetails
#8ACCEPTED0.05 sdetails
#9ACCEPTED0.04 sdetails
#10ACCEPTED0.03 sdetails
#11ACCEPTED0.05 sdetails
#12ACCEPTED0.04 sdetails
#13ACCEPTED0.05 sdetails
#14ACCEPTED0.04 sdetails
#15ACCEPTED0.04 sdetails
#16ACCEPTED0.05 sdetails
#17ACCEPTED0.26 sdetails
#18ACCEPTED0.26 sdetails
#19ACCEPTED0.27 sdetails
#20ACCEPTED0.56 sdetails
#21--details
#22--details

### Code

```n = int(input())

table = []
for _ in range(n):
table.append(list(input().rstrip()))
#print(table)

def areAllOnes(row):
for j in range(len(row)):
if row[j] == "0":
return False
return True

oneRows = []
neededMoves = 0
for row in range(n):
if areAllOnes(table[row]):
oneRows.append(row)
neededMoves += 1
oneCols = []
for i in range(n):
allOnes = True
for j in range(n):
if table[j][i] == "0":
allOnes = False
break
if allOnes == True:
oneCols.append(i)
#print("COL FOUND")
neededMoves += 1

if neededMoves == n*2:
neededMoves = n
for i in range(n):
for j in range(n):
if table[i][j] == "1" and i not in oneRows and j not in oneCols:
neededMoves = -1
print(neededMoves)
```

### 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:

input
1000
111111111111111111111111111111...

correct output
999

user output
(empty)

#### Test 22

Verdict:

input
1000
111111111111111111111111111111...

correct output
1000

user output
(empty)