Merkkijonot

input/code.cpp: In function 'bool harmoninen(std::__cxx11::string, std::__cxx11::string)':
input/code.cpp:42:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int a = 0; a < s1.length(); a++) {
                  ~~^~~~~~~~~~~~~
input/code.cpp:51:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < s1.length(); i++) {
                  ~~^~~~~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:85:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while (alku < sanat.size() - 1) { //Looppaa listan
         ~~~~~^~~~~~~~~~~~~~~~~~
input/code.cpp:88:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while (toinen < sanat.size()) {
          ~~~~~~~^~~~~~~~~~~~~~

#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <algorithm>

using namespace std;

vector<string> sanat; //Lista sanoista

bool harmoninen(string s1, string s2) {
	//if (s1.length() != s2.length()) return false;
	string uusi = "";
	map<char, char> vastaavat; //A->S, B->G eli ekan kirjain -> tokan vastaava
	map<char, bool> used; //Lista toisen sanan kaytetyista
	used['A'] = false;
	used['B'] = false;
	used['C'] = false;
	used['D'] = false;
	used['E'] = false;
	used['F'] = false;
	used['G'] = false;
	used['H'] = false;
	used['I'] = false;
	used['J'] = false;
	used['K'] = false;
	used['L'] = false;
	used['M'] = false;
	used['N'] = false;
	used['O'] = false;
	used['P'] = false;
	used['Q'] = false;
	used['R'] = false;
	used['S'] = false;
	used['T'] = false;
	used['U'] = false;
	used['V'] = false;
	used['W'] = false;
	used['X'] = false;
	used['Y'] = false;
	used['Z'] = false;
	for (int a = 0; a < s1.length(); a++) {
		if (vastaavat.count(s1[a]) > 0 && vastaavat[s1[a]] == s2[a]) continue;
		else if (used[s2[a]] == false) {
			vastaavat[s1[a]] = s2[a];
			used[s2[a]] = true;
		}
		else return false;
	}

	for (int i = 0; i < s1.length(); i++) {
		uusi += vastaavat[s1[i]];
	}

	if (uusi == s2) {
		return true;
	}
	else {
		return false;
	}
}

bool lengthSort(string eka, string toka) {
	return eka.length() < toka.length();
}

int main()
{
	int lkm;
	cin >> lkm;
	for (int i = 0; i < lkm; i++) {
		string ip;
		cin >> ip;
		sanat.push_back(ip);
	}

	sort(sanat.begin(), sanat.end(), lengthSort);

	//for (auto a : sanat) {
		//cout << a << endl;
	//}

	int tulos = 0; //Lopputulos
	int alku = 0;
	while (alku < sanat.size() - 1) { //Looppaa listan
		int foundHarmonic = 0;
		int toinen = alku + 1;
		while (toinen < sanat.size()) {
			//cout << "alku on " << alku << " ja toka " << toinen << endl;
			if (harmoninen(sanat[alku], sanat[toinen])) {
				foundHarmonic++;
				sanat.erase(sanat.begin() + toinen);
			}
			else {
				toinen++;
			}
		}

		tulos += ((foundHarmonic * foundHarmonic) + foundHarmonic) / 2;
		alku++;
	}
	cout << tulos;
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 4

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 5

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

Test 8

Group: 1, 2, 3

Verdict: ACCEPTED

Test 9

Group: 1, 2, 3

Verdict: ACCEPTED

Test 10

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 18

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 19

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 20

Group: 1, 2, 3

Verdict: ACCEPTED

Test 21

Group: 1, 2, 3

Verdict: ACCEPTED

Test 22

Group: 1, 2, 3

Verdict: ACCEPTED

Test 23

Group: 1, 2, 3

Verdict: ACCEPTED

Test 24

Group: 1, 2, 3

Verdict: ACCEPTED