Turrets

import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.List;

public class Kilpalaatikko {

    public static int c = 1;
    public static boolean[][] u = new boolean[1000][1000];
    public static int[] xx = new int[1000];
    public static int[] yy = new int[1000];
    public static HashSet<Integer>[] xt;
    public static HashSet<Integer>[] yt;
    public static int[] ar = new int[1000000];
    public static boolean[] usedx = new boolean[1000];
    public static boolean[] usedy = new boolean[1000];

    public static void main(String[] args) {
        IO io = new IO();
        xt = new HashSet[1000];
        yt = new HashSet[1000];
//        String a = io.next(); // Lukee seuraavan välein erotellun merkkijonon.
//        int b = io.nextInt(); // Lukee seuraavan välein erotellun int-kokonaisluvun.
//        long c = io.nextLong(); // Lukee seuraavan välein erotellun long-kokonaisluvun.
//        double d = io.nextDouble(); // Lukee seuraavan välein erotellun double-liukuluvun.
        int n = io.nextInt();
        int m = io.nextInt();
        for (int i = 0; i < 1000; i++) {
            xt[i] = new HashSet<Integer>();
            yt[i] = new HashSet<Integer>();
        }
        long answer = 0;
        for (int i = 0; i < n; i++) {
            String ss = io.next();
            for (int j = 0; j < m; j++) {
                if (ss.charAt(j) == '+') {
                    yt[i].add(j);
                    xt[j].add(i);
                } else {
                    u[i][j] = true;
                }
            }
        }
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                if (!u[i][j]) {
                    r(i, j);
                    c++;
                }
            }
        }

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                if (xx[i] == yy[j]) {
                    answer = Math.max(ar[yy[j]], answer);
                } else {
                    answer = Math.max(ar[yy[j]] + ar[xx[i]], answer);
                }

            }
        }
//        for (int i = 1; i < c; i++) {
//            System.out.println(ar[i]);
//        }
        io.println(answer);

        // Toimii kuten System.out.println.
//        io.println("Annoit syötteenä " + a + " " + b + " " + c + " " + d);
        io.close(); // TÄYTYY KUTSUA LOPUKSI, muuten tuloste voi jäädä kirjoittamatta
    }

    public static void r(int i, int j) {
        u[i][j] = true;
        ar[c]++;
        if (!usedx[j]) {
            xx[j] = c;
            usedx[j] = true;
            for (int x : xt[j]) {
                if (u[x][j]) {
                    continue;
                }
                r(x, j);
            }
        }
        if (!usedy[i]) {
            yy[i] = c;
            usedy[i] = true;
            for (int x : yt[i]) {
                if (u[i][x]) {
                    continue;
                }
                r(i, x);
            }
        }

    }

}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: WRONG ANSWER

Test 19

Verdict: WRONG ANSWER

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: ACCEPTED

Test 32

Verdict: WRONG ANSWER

Test 33

Verdict: ACCEPTED

Test 34

Verdict: WRONG ANSWER

Test 35

Verdict: ACCEPTED