Niitty

input/code.cpp: In function 'int main()':
input/code.cpp:37:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::map<std::__cxx11::basic_string<char>, int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |     for(int i=0; i<species_to_number.size(); i++){
      |                  ~^~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:51:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |             for (int i=0; i < column.size(); i++){
      |                           ~~^~~~~~~~~~~~~~~

#include <iostream>
#include <vector>
#include <map>
#include <string>
#include <cmath>
#include <bitset>

using namespace std;

int main() {
    int n;
    cin >> n;
    
    vector<vector<string>> string_rows(n, vector<string>(n, ""));
    for(int i=0; i<n; i++){
        string row;
        cin >> row;
        for(int j=0; j<n; j++){
            string_rows[i][j] = row[j];
        }
    }
    
    
    map<string, int> species_to_number;
    
    vector<vector<int>> rows (n, vector<int>(n, 0));
    for(int y=0; y<n; y++){
        for(int x=0; x<n; x++){
            if(species_to_number.find(string_rows[y][x]) == species_to_number.end()){
                species_to_number[string_rows[y][x]] = species_to_number.size()+1;
            }
            rows[y][x] = species_to_number[string_rows[y][x]];
        }
    }
    
    int existing_species_mask = 0;
    for(int i=0; i<species_to_number.size(); i++){
        existing_species_mask += pow(2, i);
    }
    
    uint64_t fitting_fences = 0;

    
    for(int y1=0; y1<n; y1++){
        vector<int> found_species_per_column (n, 0);
        
        map<int, map<int, int>> visited_cache;
        for(int y2=y1; y2<n; y2++){
            vector<int> column = rows[y2];

            for (int i=0; i < column.size(); i++){
                found_species_per_column[i] = found_species_per_column[i] | (int)pow(2, column[i])>>1;
            }
            
            for(int x1=0; x1<n; x1++){
                int cache_value = n;

                if(visited_cache.find(y1) != visited_cache.end()){
                    if(visited_cache[y1].find(x1) != visited_cache[y1].end()){
                        cache_value = visited_cache[y1][x1];
                    }
                }


                int mask = 0;
                for(int x2=x1; x2<cache_value; x2++){
                    mask = mask | found_species_per_column[x2];
                    
                    if(mask == existing_species_mask){
                        visited_cache[y1][x1] = x2;
                        fitting_fences += (cache_value-x2)*(n-y2);
                        break;
                    }
                }
            }
        }
    }
    
    cout << fitting_fences;
    
    return 0;
}

Test 1

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

Verdict: ACCEPTED

Test 2

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

Verdict: ACCEPTED

Test 3

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

Verdict: ACCEPTED

Test 4

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

Verdict: ACCEPTED

Test 5

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

Verdict: ACCEPTED

Test 6

Group: 2, 3, 4, 5, 6

Verdict: ACCEPTED

Test 7

Group: 2, 3, 4, 5, 6

Verdict: ACCEPTED

Test 8

Group: 2, 3, 4, 5, 6

Verdict: ACCEPTED

Test 9

Group: 2, 3, 4, 5, 6

Verdict: ACCEPTED

Test 10

Group: 3, 4, 5, 6

Verdict: ACCEPTED

Test 11

Group: 3, 4, 5, 6

Verdict: ACCEPTED

Test 12

Group: 3, 4, 5, 6

Verdict: ACCEPTED

Test 13

Group: 3, 4, 5, 6

Verdict: ACCEPTED

Test 14

Group: 4, 5, 6

Verdict: ACCEPTED

Test 15

Group: 4, 5, 6

Verdict: ACCEPTED

Test 16

Group: 4, 5, 6

Verdict: ACCEPTED

Test 17

Group: 4, 5, 6

Verdict: ACCEPTED

Test 18

Group: 5, 6

Verdict: ACCEPTED

Test 19

Group: 5, 6

Verdict: ACCEPTED

Test 20

Group: 5, 6

Verdict: ACCEPTED

Test 21

Group: 5, 6

Verdict: ACCEPTED

Test 22

Group: 6

Verdict: TIME LIMIT EXCEEDED

Test 23

Group: 6

Verdict: TIME LIMIT EXCEEDED

Test 24

Group: 6

Verdict: TIME LIMIT EXCEEDED

Test 25

Group: 6

Verdict: TIME LIMIT EXCEEDED