Ositus

input/code.cpp: In function 'bool isLegal(std::__cxx11::string)':
input/code.cpp:21:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     return m.size() == l || l == maxLength;
            ~~~~~~~~~^~~~
input/code.cpp: In function 'bool isLegalized(std::__cxx11::string)':
input/code.cpp:31:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     return m.size() == l;
            ~~~~~~~~~^~~~
input/code.cpp: In function 'int allPartitions(std::__cxx11::string)':
input/code.cpp:59:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0; i< allPart.size(); i++ )
                   ~^~~~~~~~~~~~~~~~
input/code.cpp:63:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j = 0; j < allPart[i].size(); j++)
                         ~~^~~~~~~~~~~~~~~~~~~

#include <iostream>
#include <stdio.h>
#include <math.h>
#include <vector>
#include <string>
#include <sstream>
#include <bits/stdc++.h>
#define lint long long int

using namespace std;

int maxLength = 0;

bool isLegal(string s)
{
	int l = s.length();
	unordered_map<char, int> m;
    for (int i = 0; i < l; i++) {
        m[s[i]]++;
    }
    return m.size() == l || l == maxLength;
}

bool isLegalized(string s)
{
	int l = s.length();
	unordered_map<char, int> m;
    for (int i = 0; i < l; i++) {
        m[s[i]]++;
    }
    return m.size() == l;
}

void calcPart(vector<vector<string> >&allPart, vector<string> &currPart, int start, int n, string str)
{
    if (start >= n)
    {
        allPart.push_back(currPart);
        return;
    }
    for (int i = start; i < n; i++)
    {
        if (isLegal(str))
        {
            currPart.push_back(str.substr(start, i - start + 1));
            calcPart(allPart, currPart, i + 1, n, str);
            currPart.pop_back();
        }
    }
}

int allPartitions(string s)
{
    int n = s.length();
    vector<vector<string> > allPart;
    vector<string> currPart;
    calcPart(allPart, currPart, 0, n, s);
    int count = 0;
    for (int i=0; i< allPart.size(); i++ )
    {
    	string completePart = "";
    	bool permitted = true;
        for (int j = 0; j < allPart[i].size(); j++)
        {
        	if(isLegalized(allPart[i][j])) {
        		completePart += allPart[i][j] + " ";
        		continue;
			}
			permitted = false;
			break;
		} 
		if(permitted) {
			count++;
		}
    }
    return count;
}
 
int main()
{
    string s;
    cin >> s;
    maxLength = s.length();
    cout << allPartitions(s) << endl;
    return 0;
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

Test 5

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 3

Verdict: TIME LIMIT EXCEEDED