Niitty

input/code.cpp: In function 'bool check()':
input/code.cpp:20:32: warning: comparison of integer expressions of different signedness: 'std::unordered_set<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   20 |         if(currentTypes.size() == typesN) return true;
      |            ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
input/code.cpp: In function 'void search(bool, bool)':
input/code.cpp:27:10: warning: unused variable 'rootCall' [-Wunused-variable]
   27 |     bool rootCall = currentPos == ((n * n) -1);
      |          ^~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:77:14: warning: unused variable 'startResult' [-Wunused-variable]
   77 |         auto startResult {result};
      |              ^~~~~~~~~~~

#include <bits/stdc++.h>
 
using namespace std;
 
vector<char> flowers {};
int typesN {};
int n {};
 
int currentPos {}, startPos {};

unsigned long result {};

bool check()
{
    unordered_set<char> currentTypes {};
    for(int i {currentPos}; i >= startPos; --i)
    {
        if((i % n) < (startPos % n) || (i % n) > (currentPos % n)) continue;
        currentTypes.insert(flowers[i]);
        if(currentTypes.size() == typesN) return true;
    }
    return false;
}

void search(bool canLeft, bool canUp)
{
    bool rootCall = currentPos == ((n * n) -1);

    if((startPos % n) != ((currentPos) % n)
        && canLeft)
    {
        --currentPos;

        if(check())
        {
            ++result;   
            search(true, (currentPos / n == (n - 1)));
        }

        ++currentPos;
    }
    if((currentPos / n) != (startPos / n)
        && canUp)
    {
        currentPos -= n;
 
        if(check())
        {
            ++result;   
            search(false, true);
        }
        currentPos += n;
    }
}
 
int main()
{
    cin >> n;
    flowers.reserve(n*n);
    unordered_set<char> types {};
    for(int i {}; i < (n*n); ++i)
    {
        char c {};
        cin >> c;
        flowers.push_back(c);
        types.insert(c);
    }
    typesN = types.size();

    vector<bool> ignore {};
    ignore.reserve(n*n);
 
    for(int i {}; i < (n*n); ++i)
    {
        if(ignore[i]) continue;

        auto startResult {result};

        startPos = i;
        currentPos = (n * n) - 1;

        if(check())
        {
            ++result;
            search(true, true);
        }
        else
        {
            for(int j {i + 1}; j < (n*n); ++j)
            {
                if(ignore[j]) continue;
                if((j % n) >= (i % n)) ignore[j] = true;
            }
        }
    }
    cout << result;
    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: TIME LIMIT EXCEEDED

Test 11

Group: 3, 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

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: TIME LIMIT EXCEEDED

Test 15

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 16

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 17

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 18

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 19

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 20

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 21

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

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