Niitty

input/code.cpp: In function 'bool recArea(int, int, int, int, int, std::vector<std::vector<std::vector<int> > >&)':
input/code.cpp:6:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<std::vector<int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    6 |     for (int color = 0; color < flowerSums.size(); color++) {
      |                         ~~~~~~^~~~~~~~~~~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:77:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<std::vector<int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |     for (int color = 0; color < flowerSums.size(); color++) {
      |                         ~~~~~~^~~~~~~~~~~~~~~~~~~

#include <iostream>
#include <string>
#include <vector>

bool recArea(int n, int x1, int x2, int y1, int y2, std::vector<std::vector<std::vector<int>>>& flowerSums) {
    for (int color = 0; color < flowerSums.size(); color++) {
        int sum = 0;
        sum += flowerSums[color][x2][y2];
        if (x1 > 0) {
            if (y1 > 0) {
                sum += flowerSums[color][x1 - 1][y1-1];
            }
            sum -= flowerSums[color][x1-1][y2];
        }
        if (y1 > 0) {
            sum -= flowerSums[color][x2][y1-1];
        
        }
        if (sum <= 0) {
            return false;
        }
     }
    return true;
}

int main()
{
    std::vector<std::string> flowers;
    int n;
    n = 200;
    //std::cin >> n;
    for (int i = 0; i < n; i++) {
        std::string s;
        //std::cin >> s;
        s = "AAAAAAAAAABBAAAAAAAABAAAAAAAAABBBBBBBBBBAAAAAAAAAABBAAAAAAAABAAAAAAAAABBBBBBBBBBAAAAAAAAAABBAAAAAAAABAAAAAAAAABBBBBBBBBBAAAAAAAAAABBAAAAAAAABAAAAAAAAABBBBBBBBBBAAAAAAAAAABBAAAAAAAABAAAAAAAAABBBBBBBBBB";
        flowers.push_back(s);
    }
    std::vector<bool> theFlowers;
    for (int i = 0; i < 26; i++) {
        theFlowers.push_back(false);
    }
    for (std::string s : flowers) {
        for (int i = 0; i < n; i++) {
            int k = int(s[i]) - int('A');
            theFlowers[k] = true;
        }
    }
    std::vector<std::vector<std::vector<int>>> flowerSums;
    int y = 0;
    for (int j = 0; j < 26; j++) {
        if (theFlowers[j]) {
            flowerSums.push_back({});
            for (int i = 0; i < n; i++) {
                flowerSums[y].push_back({});
                for (int k = 0; k < n; k++) {
                    flowerSums[y][i].push_back(0);

                }
            }
            y++;
        }
    }

    y = 0;
    for (int color = 0; color < 26; color++) {
        if (theFlowers[color]) {
            for (int k = 0; k < n; k++) {
                for (int t = 0; t < n; t++) {
                    if (int(flowers[k][t]) - int('A') == color) {
                        flowerSums[y][k][t]++;
                    }
                }
            }
            y++;
        }
    }
    for (int color = 0; color < flowerSums.size(); color++) {
        for (int i = 1; i < n; i++) {
            for (int j = 0; j < n; j++) {
                flowerSums[color][i][j] += flowerSums[color][i - 1][j];
            }
        }
        for (int i = 0; i < n; i++) {
            for (int j = 1; j < n; j++) {
                flowerSums[color][i][j] += flowerSums[color][i][j - 1];
            }
        }
    }
    int numOfRec = 0;
    recArea(n, 0, 0, 3, 3, flowerSums);
    for (int x1 = 0; x1 < n; x1++) {
        for (int x2 = x1; x2 < n; x2++) {
            int step = 0;

            for (int y1 = 0; y1 < n; y1++) {
                if (recArea(n, x1, x2, y1, step, flowerSums)) {
                    numOfRec += n - step;
                }
                else {
                    int ceiling = n - 1;
                    int flooring = step;
                    int step = (ceiling + flooring) / 2;
                    while (ceiling - flooring > 1) {
                        if (recArea(n, x1, x2, y1, step, flowerSums)) {
                            ceiling = (ceiling + flooring) / 2 + (ceiling + flooring) % 2;
                        }
                        else {
                            flooring = (ceiling + flooring) / 2;
                        }
                        step = (ceiling + flooring) / 2;

                    }
                    if (recArea(n, x1, x2, y1, flooring, flowerSums)) {
                        step = flooring;
                    }
                    else if (recArea(n, x1, x2, y1, ceiling, flowerSums)) {
                        step = ceiling;
                    }
                    else {
                        step = n;
                    }
                    numOfRec += n - step;
                }
            }
        }
    }
    std::cout << numOfRec << std::endl;
}

Test 1

Group: 1, 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 2

Group: 1, 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 3

Group: 1, 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 4

Group: 1, 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 5

Group: 1, 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 6

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 7

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 8

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 9

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 10

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 11

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 12

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 13

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 14

Group: 4, 5, 6

Verdict: WRONG ANSWER

Test 15

Group: 4, 5, 6

Verdict: WRONG ANSWER

Test 16

Group: 4, 5, 6

Verdict: WRONG ANSWER

Test 17

Group: 4, 5, 6

Verdict: WRONG ANSWER

Test 18

Group: 5, 6

Verdict: WRONG ANSWER

Test 19

Group: 5, 6

Verdict: WRONG ANSWER

Test 20

Group: 5, 6

Verdict: WRONG ANSWER

Test 21

Group: 5, 6

Verdict: WRONG ANSWER

Test 22

Group: 6

Verdict: WRONG ANSWER

Test 23

Group: 6

Verdict: WRONG ANSWER

Test 24

Group: 6

Verdict: WRONG ANSWER

Test 25

Group: 6

Verdict: WRONG ANSWER