Niitty

input/code.cpp: In function 'int main()':
input/code.cpp:38: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]
   38 |     for(int i=0; i<species_to_number.size(); i++){
      |                  ~^~~~~~~~~~~~~~~~~~~~~~~~~

#include <iostream>
#include <vector>
#include <map>
#include <string>
#include <cmath>
#include <bitset>
#include <time.h>

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 |= 1 << i;
    }
    
    uint64_t fitting_fences = 0;
    
    for(int y1=0; y1<n; y1++){
        vector<int> found_species_per_column (n, 0);
        
        for(int y2=y1; y2<n; y2++){
            const vector<int> &column = rows[y2];

            for (int i=0; i < n; i++){
                found_species_per_column[i] |= 1 << (column[i]-1);
            }
            
            for(int x1=0; x1<n; x1++){

                int mask = 0;
                for(int x2=x1; x2<n; x2++){
                    mask = mask | found_species_per_column[x2];
                    
                    if(mask == existing_species_mask){
                        fitting_fences += (n-x2);
                        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: ACCEPTED

Test 23

Group: 6

Verdict: ACCEPTED

Test 24

Group: 6

Verdict: ACCEPTED

Test 25

Group: 6

Verdict: TIME LIMIT EXCEEDED