Submission details
Task:Turrets
Sender:rip
Submission time:2017-09-05 18:36:27 +0300
Language:C++
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.04 sdetails
#2ACCEPTED0.05 sdetails
#3ACCEPTED0.05 sdetails
#4ACCEPTED0.03 sdetails
#5ACCEPTED0.05 sdetails
#6ACCEPTED0.04 sdetails
#7ACCEPTED0.04 sdetails
#8ACCEPTED0.04 sdetails
#9ACCEPTED0.03 sdetails
#10ACCEPTED0.04 sdetails
#11ACCEPTED0.03 sdetails
#12ACCEPTED0.04 sdetails
#13ACCEPTED0.04 sdetails
#14ACCEPTED0.04 sdetails
#15ACCEPTED0.04 sdetails
#16ACCEPTED0.06 sdetails
#17ACCEPTED0.05 sdetails
#18ACCEPTED0.04 sdetails
#19ACCEPTED0.05 sdetails
#20ACCEPTED0.05 sdetails
#21ACCEPTED0.04 sdetails
#22ACCEPTED0.04 sdetails
#23ACCEPTED0.06 sdetails
#24ACCEPTED0.04 sdetails
#25ACCEPTED0.04 sdetails
#26ACCEPTED0.05 sdetails
#27ACCEPTED0.05 sdetails
#28ACCEPTED0.04 sdetails
#29ACCEPTED0.05 sdetails
#30ACCEPTED0.05 sdetails
#31ACCEPTED0.04 sdetails
#32ACCEPTED0.04 sdetails
#33ACCEPTED0.06 sdetails
#34ACCEPTED0.06 sdetails
#35ACCEPTED0.04 sdetails

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:31:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int j=0; j<q.size(); ++j){
                           ^

Code

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define F first
#define S second
#define N 1010

char t[N][N];
vector<int> x[N], y[N];
int s[N], z[N], zy[N];
int main(){
  ios::sync_with_stdio(0); cin.tie(0);
  int n, m;
  cin >> n >> m;
  for(int i=0; i<n; ++i){
    for(int j=0; j<m; ++j) {
      cin >> t[i][j];
      if(t[i][j] == '+'){
        x[i].push_back(j);
        y[j].push_back(i);
      }
    }
  }
  int c = 0;
  for(int i=0; i<n; ++i){
    if(z[i]) continue;
    z[i] = ++c;
    vector<int> q;
    q.push_back(i);
    for(int j=0; j<q.size(); ++j){
      s[c] += x[q[j]].size();
      for(int u : x[q[j]]){
        if(zy[u]) continue;
        zy[u] = c;
        for(int v : y[u]){
          if(z[v]) continue;
          z[v] = c;
          q.push_back(v);
        }
      }
    }
  }
  int V = 0;
  for(int i=0; i<n; ++i){
    for(int j=0; j<m; ++j){
      if(t[i][j] == '+') continue;
      if(z[i] == zy[j]) V = max(V, s[z[i]]);
      else V = max(V, s[z[i]] + s[zy[j]]);
    }
  }
  cout << V;
}

Test details

Test 1

Verdict: ACCEPTED

input
10 1
.
.
+
.
...

correct output
2

user output
2

Test 2

Verdict: ACCEPTED

input
3 7
.+++.++
.+..++.
+++++..

correct output
13

user output
13

Test 3

Verdict: ACCEPTED

input
8 4
.++.
....
+..+
+.+.
...

correct output
11

user output
11

Test 4

Verdict: ACCEPTED

input
9 1
.
.
.
.
...

correct output
2

user output
2

Test 5

Verdict: ACCEPTED

input
5 2
+.
..
..
..
...

correct output
1

user output
1

Test 6

Verdict: ACCEPTED

input
6 7
.......
.......
.......
.......
...

correct output
0

user output
0

Test 7

Verdict: ACCEPTED

input
7 10
..........
..........
..........
..........
...

correct output
0

user output
0

Test 8

Verdict: ACCEPTED

input
691 215
.................................

correct output
18

user output
18

Test 9

Verdict: ACCEPTED

input
911 7
..++..+
++...+.
+.++.+.
.++.++.
...

correct output
3195

user output
3195

Test 10

Verdict: ACCEPTED

input
873 476
.................................

correct output
517

user output
517

Test 11

Verdict: ACCEPTED

input
120 184
..................+..............

correct output
12

user output
12

Test 12

Verdict: ACCEPTED

input
944 46
.................................

correct output
4

user output
4

Test 13

Verdict: ACCEPTED

input
93 576
.................................

correct output
5

user output
5

Test 14

Verdict: ACCEPTED

input
360 409
.................................

correct output
0

user output
0

Test 15

Verdict: ACCEPTED

input
1000 447
.................................

correct output
14

user output
14

Test 16

Verdict: ACCEPTED

input
1000 590
++.+...++++++......+..++..++.+...

correct output
295234

user output
295234

Test 17

Verdict: ACCEPTED

input
1000 592
.................................

correct output
764

user output
764

Test 18

Verdict: ACCEPTED

input
1000 14
..............
..............
..............
..............
...

correct output
4

user output
4

Test 19

Verdict: ACCEPTED

input
1000 65
.................................

correct output
4

user output
4

Test 20

Verdict: ACCEPTED

input
1000 401
.................................

correct output
2

user output
2

Test 21

Verdict: ACCEPTED

input
1000 101
.................................

correct output
0

user output
0

Test 22

Verdict: ACCEPTED

input
1000 995
.................................

correct output
24

user output
24

Test 23

Verdict: ACCEPTED

input
1000 296
.++.++.++..++.++...++...+....+...

correct output
147617

user output
147617

Test 24

Verdict: ACCEPTED

input
1000 551
.................................

correct output
839

user output
839

Test 25

Verdict: ACCEPTED

input
1000 150
.................................

correct output
11

user output
11

Test 26

Verdict: ACCEPTED

input
1000 398
.................................

correct output
9

user output
9

Test 27

Verdict: ACCEPTED

input
1000 335
.................................

correct output
4

user output
4

Test 28

Verdict: ACCEPTED

input
1000 360
.................................

correct output
0

user output
0

Test 29

Verdict: ACCEPTED

input
611 1000
.................................

correct output
19

user output
19

Test 30

Verdict: ACCEPTED

input
22 1000
.++.+.....+........+++.+++++.....

correct output
10985

user output
10985

Test 31

Verdict: ACCEPTED

input
80 1000
.......+.........................

correct output
974

user output
974

Test 32

Verdict: ACCEPTED

input
40 1000
.................................

correct output
6

user output
6

Test 33

Verdict: ACCEPTED

input
587 1000
.................................

correct output
9

user output
9

Test 34

Verdict: ACCEPTED

input
432 1000
.................................

correct output
6

user output
6

Test 35

Verdict: ACCEPTED

input
614 1000
.................................

correct output
0

user output
0