| Task: | Grid |
| Sender: | Robotiimi |
| Submission time: | 2018-05-26 13:23:09 +0300 |
| Language: | C++ |
| Status: | READY |
| Result: | ACCEPTED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.01 s | details |
| #2 | ACCEPTED | 0.01 s | details |
| #3 | ACCEPTED | 0.01 s | details |
| #4 | ACCEPTED | 0.01 s | details |
| #5 | ACCEPTED | 0.01 s | details |
| #6 | ACCEPTED | 0.01 s | details |
| #7 | ACCEPTED | 0.01 s | details |
| #8 | ACCEPTED | 0.01 s | details |
| #9 | ACCEPTED | 0.01 s | details |
| #10 | ACCEPTED | 0.01 s | details |
| #11 | ACCEPTED | 0.01 s | details |
| #12 | ACCEPTED | 0.01 s | details |
| #13 | ACCEPTED | 0.01 s | details |
| #14 | ACCEPTED | 0.01 s | details |
| #15 | ACCEPTED | 0.01 s | details |
| #16 | ACCEPTED | 0.01 s | details |
| #17 | ACCEPTED | 0.03 s | details |
| #18 | ACCEPTED | 0.03 s | details |
| #19 | ACCEPTED | 0.03 s | details |
| #20 | ACCEPTED | 0.04 s | details |
| #21 | ACCEPTED | 0.05 s | details |
| #22 | ACCEPTED | 0.07 s | details |
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 |
| 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 |
