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

Code

#include <iostream>
#include <vector>
#include <string>

int find_row(const std::vector<int>& vec, int n)
{
  for (unsigned int i = 0; i < vec.size(); ++i)
    if (vec[i] == 0)
      return i / n;
  return -1;
}

int find_zero(const std::vector<int>& vec)
{
  for (unsigned int i = 0; i < vec.size(); ++i)
    if (vec[i] == 0)
      return i;
  return -1;
}

int main()
{
  std::string input;
  std::getline(std::cin, input);
  int n = std::stoi(input);
  std::vector<int> vec;
  vec.reserve(n * n);
  for (int i = 0; i < n; ++i)
    {
      std::string line;
      std::getline(std::cin, line);
      for (int j = 0; j < n; ++j)
	vec.push_back(line[j] - '0');
    }

  int row = find_row(vec, n);
  
  if (row == -1)
    {
      std::cout << n;
      return 0;
    }

  std::vector<int> rows(n);
  for (int i = 0; i < row; ++i)
    rows[i] = 1;


  std::vector<int> cols(n);


  for (int i = row * n, j = 0; i < row * n + n; ++i, ++j)
    cols[j] = vec[i];

  int j = find_zero(cols);
  for (unsigned int i = row * n + j; i < vec.size(); i += n)
      rows[i / n] = vec[i];

  for (unsigned int i = 0; i < vec.size(); ++i)
    {
      int c = cols[i % n];
      int r = rows[i / n];
      if (vec[i] == 1)
	{
	  if (c == 0 && r == 0)
	    {
	      std::cout << -1;
	      return 0;
	    }
	}
      else
	{
	  if (c == 1 || r == 1)
	    {
	      std::cout << -1;
	      return 0;
	    }
	}
    }
  int sum = 0;
  for (unsigned int i = 0U; i < rows.size(); ++i)
    sum += rows[i] + cols[i];
  std::cout << sum;
}

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