Niitty

input/code.cpp: In function 'int main()':
input/code.cpp:74:10: warning: variable 'start' set but not used [-Wunused-but-set-variable]
   74 |     auto start = high_resolution_clock::now();
      |          ^~~~~
input/code.cpp:95:10: warning: variable 'stop' set but not used [-Wunused-but-set-variable]
   95 |     auto stop = high_resolution_clock::now();}
      |          ^~~~

#include <iostream>
#include <vector>
#include <chrono>
#include <unordered_map>
using namespace std;
using namespace chrono;


int tree_size = 1;


int tree_range( vector<int>& tree, int begin, int end ) {
    begin += tree_size;
    end += tree_size;

    int ans = tree[begin] | tree[end];

    while ( begin/2 < end/2 ) {
        ans |= tree[begin + !(begin%2)] | tree[end - end%2];
        begin /= 2;
        end /= 2;
    }

    return ans;
}


bool area_check(vector<vector<int>>& field, int flowers_amount, int& x1, int& y1, int& x2, int& y2) {
    
    int current = 0;
    for ( int y = y1; y <= y2; y++ ) {
        current |= tree_range(field[y], x1, x2);
        if ( current == ((1<<flowers_amount)-1) )
            return true;
    }

    return false;
}


void tree_insert ( vector<int>& tree, int x, int i ) {
    i += tree_size;
    tree[i] = x;

    for ( i /= 2; i >= 1; i /= 2 )
        tree[i] = tree[i*2] | tree[i*2+1];
}



int main () {
    int n;
    cin >> n;
    
    while ( tree_size < n )
        tree_size <<= 1;


    unordered_map<char, int> flowers;
    vector<vector<int>> field(n, vector<int>(2*tree_size, 0));
    for ( int i = 0; i < n; i++ ) {
        for ( int j = 0; j < n; j++ ) {
            char c;
            cin >> c;
            
            if ( flowers.find(c) == flowers.end() )
                flowers[c] = flowers.size();

            tree_insert(field[i], 1<<flowers[c], j);
        }
    }


    auto start = high_resolution_clock::now();
    int count = 0;

    for ( int y1 = 0; y1 < n; y1++ ) {
        for ( int x1 = 0; x1 < n; x1++ ) {
            int xlimit = n;

            for ( int y2 = y1; y2 < n; y2++ ) {
                for ( int x2 = x1; x2 < xlimit; x2++ ) {   
                    if ( area_check(field, flowers.size(), x1, y1, x2, y2) ) {
                        count += (xlimit - x2) * (n - y2);
                        xlimit = x2;
                        break;
                    }
                }
            }
        }
    }

    cout << count;

    auto stop = high_resolution_clock::now();}

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: ACCEPTED

Test 4

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

Verdict: WRONG ANSWER

Test 5

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

Verdict: ACCEPTED

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: ACCEPTED

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: ACCEPTED

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: ACCEPTED

Test 17

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 18

Group: 5, 6

Verdict: WRONG ANSWER

Test 19

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 20

Group: 5, 6

Verdict: ACCEPTED

Test 21

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 22

Group: 6

Verdict: WRONG ANSWER

Test 23

Group: 6

Verdict: TIME LIMIT EXCEEDED

Test 24

Group: 6

Verdict: WRONG ANSWER

Test 25

Group: 6

Verdict: TIME LIMIT EXCEEDED