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 13:23:09
Task:Grid
Sender:Robotiimi
Submission time:2018-05-26 13:23:09
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.03 / 1.00details
#18ACCEPTED0.03 / 1.00details
#19ACCEPTED0.03 / 1.00details
#20ACCEPTED0.04 / 1.00details
#21ACCEPTED0.05 / 1.00details
#22ACCEPTED0.07 / 1.00details

Code

#include <bits/stdc++.h>
#include <string>
#include <vector>
//#include <array>

using namespace std;


int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);


int n;
cin >> n;

int answer = 0;
vector <vector<int> > grid;
vector <int> paintedcol;
vector <int> paintedrow;
vector <int> owngrid (n*n,0);


for (int i=0; i<n; i++) {
    string tmp;
    cin >> tmp;
    int tmpsize = tmp.size();
    vector <int> tmpv;
    for (int j=0; j<tmpsize; j++) {
        tmpv.push_back((int) tmp[j] - (int) '0');
    }
    grid.push_back(tmpv);
}

int origsum = 0;

for (int i=0; i<n; i++) {
    int sumrow = 0;
    int sumcol = 0;
    for (int j=0; j<n; j++) {
        sumrow += grid[i][j];
        sumcol += grid[j][i];
        origsum += grid[i][j];
    }
    if (sumrow == n) {
        answer++;
        for (int j=0; j<n; j++) {
            owngrid[i*n+j] = 1;
        }
        paintedrow.push_back(i);
    }
    if (sumcol == n) {
        answer++;
        for (int j=0; j<n; j++) {
            owngrid[j*n+i] = 1;
        }
        paintedcol.push_back(i);
    }
}
if (answer == n+n) {
    answer = n;
}

int ownsum = 0;

for (int i=0; i<n; i++) {
    for (int j=0; j<n; j++) {
        //cout << grid[i][j];
        ownsum += owngrid[i*n+j];
        //if grid[i][j]
    }
    //cout << endl;
}

if (ownsum != origsum) {
    answer = -1;
}

cout << answer << "\n";
}

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