Code Submission Evaluation System Login

HIIT Open 2018

Start:2018-05-26 11:00:00
End:2018-05-26 16:00:00
 

Tasks | Messages | Scoreboard | Statistics


CSES - HIIT Open 2018 - Results
History
2018-05-26 12:16:10
Task:Grid
Sender:Puhi~
Submission time:2018-05-26 12:16:10
Language:C++
Status:READY
Result:ACCEPTED

Test results

testverdicttime (s)
#1ACCEPTED0.01 / 1.00details
#2ACCEPTED0.01 / 1.00details
#3ACCEPTED0.01 / 1.00details
#4ACCEPTED0.01 / 1.00details
#5ACCEPTED0.01 / 1.00details
#6ACCEPTED0.01 / 1.00details
#7ACCEPTED0.01 / 1.00details
#8ACCEPTED0.01 / 1.00details
#9ACCEPTED0.01 / 1.00details
#10ACCEPTED0.01 / 1.00details
#11ACCEPTED0.01 / 1.00details
#12ACCEPTED0.01 / 1.00details
#13ACCEPTED0.01 / 1.00details
#14ACCEPTED0.01 / 1.00details
#15ACCEPTED0.01 / 1.00details
#16ACCEPTED0.01 / 1.00details
#17ACCEPTED0.06 / 1.00details
#18ACCEPTED0.06 / 1.00details
#19ACCEPTED0.06 / 1.00details
#20ACCEPTED0.07 / 1.00details
#21ACCEPTED0.08 / 1.00details
#22ACCEPTED0.06 / 1.00details

Code

#include <iostream>

using namespace std;

bool rowset[1000];
bool colset[1000];

int main() {
    int n;
    cin >> n;
    
    bool grid[1000][1000] = {0};
    
    for (int x = 0; x < n; x++) {
        rowset[x] = true;
        colset[x] = true;
    }
    
    for (int x = 0; x < n; x++) {
        for(int y = 0; y < n; y++) {
            char tmp;
            cin >> tmp;
            if (tmp == '0') {
                colset[x] = false;
                rowset[y] = false;
            } else {
                grid[x][y] = true;
            }
        }
    }
    
    bool allset = true;
    for (int x = 0; x < n; x++) {
        if (!rowset[x]) allset = false;
    }
    
    if (allset) {
        cout << n << endl;
    } else {
        for (int x = 0; x < n; x++) {
            for(int y = 0; y < n; y++) {
                if (grid[x][y] && !rowset[y] && !colset[x]) {
                    cout << -1 << endl;
                    return 0;
                }
            }
        }
        
        int count = 0;
        for (int x = 0; x < n; x++) {
            count += rowset[x] + colset[x];
        }
        cout << count << endl;
    }
    
    return 0;
}

Test details

Test 1

Verdict: ACCEPTED

input
1
0
view   save

correct output
0
view   save

user output
0
view   save

Test 2

Verdict: ACCEPTED

input
1
1
view   save

correct output
1
view   save

user output
1
view   save

Test 3

Verdict: ACCEPTED

input
2
00
00
view   save

correct output
0
view   save

user output
0
view   save

Test 4

Verdict: ACCEPTED

input
2
10
00
view   save

correct output
-1
view   save

user output
-1
view   save

Test 5

Verdict: ACCEPTED

input
2
11
00
view   save

correct output
1
view   save

user output
1
view   save

Test 6

Verdict: ACCEPTED

input
2
11
01
view   save

correct output
2
view   save

user output
2
view   save

Test 7

Verdict: ACCEPTED

input
2
11
11
view   save

correct output
2
view   save

user output
2
view   save

Test 8

Verdict: ACCEPTED

input
3
000
000
000
view   save

correct output
0
view   save

user output
0
view   save

Test 9

Verdict: ACCEPTED

input
3
100
100
100
view   save

correct output
1
view   save

user output
1
view   save

Test 10

Verdict: ACCEPTED

input
3
101
101
101
view   save

correct output
2
view   save

user output
2
view   save

Test 11

Verdict: ACCEPTED

input
3
111
101
101
view   save

correct output
3
view   save

user output
3
view   save

Test 12

Verdict: ACCEPTED

input
3
111
000
000
view   save

correct output
1
view   save

user output
1
view   save

Test 13

Verdict: ACCEPTED

input
3
111
000
111
view   save

correct output
2
view   save

user output
2
view   save

Test 14

Verdict: ACCEPTED

input
3
111
100
111
view   save

correct output
3
view   save

user output
3
view   save

Test 15

Verdict: ACCEPTED

input
3
111
101
111
view   save

correct output
4
view   save

user output
4
view   save

Test 16

Verdict: ACCEPTED

input
3
111
111
111
view   save

correct output
3
view   save

user output
3
view   save

Test 17

Verdict: ACCEPTED

input
1000
000000000000000000000000000000...
view   save

correct output
0
view   save

user output
0
view   save

Test 18

Verdict: ACCEPTED

input
1000
000000000000000000000000000000...
view   save

correct output
10
view   save

user output
10
view   save

Test 19

Verdict: ACCEPTED

input
1000
100000000000000000100000000000...
view   save

correct output
41
view   save

user output
41
view   save

Test 20

Verdict: ACCEPTED

input
1000
000000100000000001000000010000...
view   save

correct output
192
view   save

user output
192
view   save

Test 21

Verdict: ACCEPTED

input
1000
111111111111111111111111111111...
view   save

correct output
999
view   save

user output
999
view   save

Test 22

Verdict: ACCEPTED

input
1000
111111111111111111111111111111...
view   save

correct output
1000
view   save

user output
1000
view   save