Task: | Grid |
Sender: | KnowYourArchitecture |
Submission time: | 2018-05-26 11:40:40 +0300 |
Language: | C++ |
Status: | READY |
Result: | WRONG ANSWER |
test | verdict | time | |
---|---|---|---|
#1 | WRONG ANSWER | 0.01 s | details |
#2 | ACCEPTED | 0.02 s | details |
#3 | WRONG ANSWER | 0.02 s | details |
#4 | ACCEPTED | 0.01 s | details |
#5 | WRONG ANSWER | 0.01 s | details |
#6 | ACCEPTED | 0.02 s | details |
#7 | ACCEPTED | 0.01 s | details |
#8 | WRONG ANSWER | 0.01 s | details |
#9 | WRONG ANSWER | 0.01 s | details |
#10 | WRONG ANSWER | 0.01 s | details |
#11 | WRONG ANSWER | 0.01 s | details |
#12 | WRONG ANSWER | 0.01 s | details |
#13 | WRONG ANSWER | 0.01 s | details |
#14 | WRONG ANSWER | 0.01 s | details |
#15 | WRONG ANSWER | 0.01 s | details |
#16 | ACCEPTED | 0.01 s | details |
#17 | WRONG ANSWER | 0.04 s | details |
#18 | ACCEPTED | 0.04 s | details |
#19 | WRONG ANSWER | 0.05 s | details |
#20 | ACCEPTED | 0.03 s | details |
#21 | ACCEPTED | 0.04 s | details |
#22 | ACCEPTED | 0.04 s | details |
Code
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef __int128 lll; int c[1000]; int main(){ int n; cin>>n; vector<string> m(n); int rows=0; for(int i=0;i<n;++i){ cin>>m[i]; } for(int i=0;i<n;++i){ bool row_ok=true; for(int j=0;j<n;++j){ if(m[i][j]=='1')++c[j]; if(m[i][j]!=m[i][0]){ row_ok=false; if(c[j]<=i){ cout<<"-1\n"; return 0; } } } if(row_ok)++rows; } if(rows!=n)for(int i=0;i<n;++i)if(c[i]==n)++rows; cout<<rows<<'\n'; return 0; }
Test details
Test 1
Verdict: WRONG ANSWER
input |
---|
1 0 |
correct output |
---|
0 |
user output |
---|
1 |
Test 2
Verdict: ACCEPTED
input |
---|
1 1 |
correct output |
---|
1 |
user output |
---|
1 |
Test 3
Verdict: WRONG ANSWER
input |
---|
2 00 00 |
correct output |
---|
0 |
user output |
---|
2 |
Test 4
Verdict: ACCEPTED
input |
---|
2 10 00 |
correct output |
---|
-1 |
user output |
---|
-1 |
Test 5
Verdict: WRONG ANSWER
input |
---|
2 11 00 |
correct output |
---|
1 |
user output |
---|
2 |
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: WRONG ANSWER
input |
---|
3 000 000 000 |
correct output |
---|
0 |
user output |
---|
3 |
Test 9
Verdict: WRONG ANSWER
input |
---|
3 100 100 100 |
correct output |
---|
1 |
user output |
---|
-1 |
Test 10
Verdict: WRONG ANSWER
input |
---|
3 101 101 101 |
correct output |
---|
2 |
user output |
---|
-1 |
Test 11
Verdict: WRONG ANSWER
input |
---|
3 111 101 101 |
correct output |
---|
3 |
user output |
---|
-1 |
Test 12
Verdict: WRONG ANSWER
input |
---|
3 111 000 000 |
correct output |
---|
1 |
user output |
---|
3 |
Test 13
Verdict: WRONG ANSWER
input |
---|
3 111 000 111 |
correct output |
---|
2 |
user output |
---|
3 |
Test 14
Verdict: WRONG ANSWER
input |
---|
3 111 100 111 |
correct output |
---|
3 |
user output |
---|
-1 |
Test 15
Verdict: WRONG ANSWER
input |
---|
3 111 101 111 |
correct output |
---|
4 |
user output |
---|
-1 |
Test 16
Verdict: ACCEPTED
input |
---|
3 111 111 111 |
correct output |
---|
3 |
user output |
---|
3 |
Test 17
Verdict: WRONG ANSWER
input |
---|
1000 000000000000000000000000000000... |
correct output |
---|
0 |
user output |
---|
1000 |
Test 18
Verdict: ACCEPTED
input |
---|
1000 000000000000000000000000000000... |
correct output |
---|
10 |
user output |
---|
10 |
Test 19
Verdict: WRONG ANSWER
input |
---|
1000 100000000000000000100000000000... |
correct output |
---|
41 |
user output |
---|
-1 |
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 |