CSES - Datatähti 2020 alku - Results
Submission details
Task:Merkkijonot
Sender:antti_p
Submission time:2019-10-08 17:32:52 +0300
Language:C++17
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED15
#2ACCEPTED31
#3ACCEPTED54
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2, 3details
#2ACCEPTED0.01 s2, 3details
#3ACCEPTED0.12 s3details
#4ACCEPTED0.14 s3details
#5ACCEPTED0.04 s3details
#6ACCEPTED0.01 s1, 2, 3details
#7ACCEPTED0.01 s1, 2, 3details
#8ACCEPTED0.01 s1, 2, 3details
#9ACCEPTED0.01 s1, 2, 3details
#10ACCEPTED0.01 s2, 3details
#11ACCEPTED0.01 s2, 3details
#12ACCEPTED0.01 s2, 3details
#13ACCEPTED0.01 s2, 3details
#14ACCEPTED0.01 s2, 3details
#15ACCEPTED0.13 s3details
#16ACCEPTED0.13 s3details
#17ACCEPTED0.13 s3details
#18ACCEPTED0.13 s3details
#19ACCEPTED0.13 s3details
#20ACCEPTED0.01 s1, 2, 3details
#21ACCEPTED0.01 s1, 2, 3details
#22ACCEPTED0.01 s1, 2, 3details
#23ACCEPTED0.01 s1, 2, 3details
#24ACCEPTED0.01 s1, 2, 3details

Code

#include <iostream>
#include <unordered_map>
#include <string_view>

struct Merkkijono {
	char ordinal[50];
	Merkkijono() {
		for (int i = 0; i < 50; ++i) {
			ordinal[i] = -1;
		}
	}
	bool operator==(const struct Merkkijono& b) const noexcept {
		for (int i = 0; i < 50; ++i) {
			if (ordinal[i] != b.ordinal[i])
				return false;
		}
		return true;
	}
};

namespace std {
	template <> struct hash<Merkkijono> {
		size_t operator()(const Merkkijono& x) const noexcept {
			string_view view(x.ordinal, 50);
			return hash<string_view>{}(view);
		}
	};
}

struct Merkkijono convert(const std::string& str) {
	char ordinals[26];
	for (int i = 0; i < 26; ++i) {
		ordinals[i] = -1;
	}
	char ordmax = -1;
	struct Merkkijono ret{};
	int n = 0;
	for (auto c : str) {
		char ord = ordinals[c - 65];
		//std::cout << "Read: " << c << " Ordinal: " << (int)ord;
		if (ord == -1) {
			ord = ++ordmax;
			ordinals[c - 65] = ord;
		}
		ret.ordinal[n] = ord;
		++n;
	}
	return ret;
}

int64_t comb2(int64_t n) {
	return (n-1)*(n)/2;
}

int main() {
	int count;
	std::cin >> count;
	std::unordered_map<struct Merkkijono, int64_t> unordmap;
	for (int i = 0; i < count; ++i) {
		std::string input;
		std::cin >> input;
		auto merkkijono = convert(input);
		unordmap[merkkijono]+= 1;
	}
	int64_t sum = 0;
	for (auto it = unordmap.begin(); it != unordmap.end(); ++it) {
		sum+= comb2(it->second);
	}
	//std::cout << "comb2(0) = " << comb2(0) << ", comb2(1) = " << comb2(1) << ", comb2(2) = " << comb2(2) << ", comb2(3) = " << comb2(3);
	std::cout << sum << "\n";
	return 0;
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
20
FFDISOVJLPIASANJRBHQXJVW
HBGVRZFWOTAAVUPYKMKXAOBEYUE
JKHXTPHUKTLTLNXMXMSYYFLF
HCSZMXTZCUFHIHSTEWKHCFZRTXU
...

correct output
20

user output
20

Test 2

Group: 2, 3

Verdict: ACCEPTED

input
5000
AJEDROEDXRGDUSDAPZBXXQBPJ
PDGCTAGCRTBCJICPFELRRMLFD
TISAOTGMDKUCITIEFQVCSBZJYUUO
FMASVJYFPMELSVLQWFZVLVMSPHYL
...

correct output
2178556

user output
2178556

Test 3

Group: 3

Verdict: ACCEPTED

input
100000
RESKYADLVRSDCDXJVECAJCAP
CZLIWDHKVNRJHZINHFBOQEPN
LSTRSDTLADUIWXFQJSQPVRSPBCTZ
QEMSZOQSSVBRNQTCLJQIGVQO
...

correct output
404880850

user output
404880850

Test 4

Group: 3

Verdict: ACCEPTED

input
100000
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
4999950000

user output
4999950000

Test 5

Group: 3

Verdict: ACCEPTED

input
100000
IPI
Q
SPGV
UNYE
...

correct output
1041990627

user output
1041990627

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

input
20
A
B
C
D
...

correct output
190

user output
190

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
A

correct output
0

user output
0

Test 8

Group: 1, 2, 3

Verdict: ACCEPTED

input
20
A
BB
CCC
DDDD
...

correct output
0

user output
0

Test 9

Group: 1, 2, 3

Verdict: ACCEPTED

input
2
A
A

correct output
1

user output
1

Test 10

Group: 2, 3

Verdict: ACCEPTED

input
5000
SEKNHNRHSRFYIHSCDPGXPTGUSYBFKZ...

correct output
20861

user output
20861

Test 11

Group: 2, 3

Verdict: ACCEPTED

input
5000
UGPWHWOWAREEIROZTRJGUCKDKTZJEO...

correct output
22818

user output
22818

Test 12

Group: 2, 3

Verdict: ACCEPTED

input
5000
FFQQCBCINBDWIKHFPO
SCJU
DNHYPGIQNZS
KNQCYRAXHHKORXMOVHL
...

correct output
22268

user output
22268

Test 13

Group: 2, 3

Verdict: ACCEPTED

input
5000
QVWMSYPWXWBBXWCVEOUAVQLDWNBXZB...

correct output
22589

user output
22589

Test 14

Group: 2, 3

Verdict: ACCEPTED

input
5000
JYORMNQAKXHNRBWGGSMWXWXMBKPBZU...

correct output
20482

user output
20482

Test 15

Group: 3

Verdict: ACCEPTED

input
100000
DCXXVIEYQAASZJYUUVYZUIJFGVBAYC...

correct output
8925377

user output
8925377

Test 16

Group: 3

Verdict: ACCEPTED

input
100000
IJZHBIYNWQBDWNGZWVXJKXXWFVLPQX...

correct output
8907840

user output
8907840

Test 17

Group: 3

Verdict: ACCEPTED

input
100000
GWUGLGQDAYGGJROIAKBMMICQMDUQQQ...

correct output
8771809

user output
8771809

Test 18

Group: 3

Verdict: ACCEPTED

input
100000
SWVSVXURRSLCSHCPAKWESIPCNDKYLD...

correct output
8704480

user output
8704480

Test 19

Group: 3

Verdict: ACCEPTED

input
100000
ZLSNSZBGIMCOLPDEAKVDAJCTMBNRLH...

correct output
8672362

user output
8672362

Test 20

Group: 1, 2, 3

Verdict: ACCEPTED

input
20
AAB
D
CDBAA
D
...

correct output
15

user output
15

Test 21

Group: 1, 2, 3

Verdict: ACCEPTED

input
20
A
CDD
AABBC
DBCB
...

correct output
15

user output
15

Test 22

Group: 1, 2, 3

Verdict: ACCEPTED

input
20
ACADD
CDDCD
DACA
CCDCA
...

correct output
17

user output
17

Test 23

Group: 1, 2, 3

Verdict: ACCEPTED

input
20
DCDA
BDBA
CACBD
BA
...

correct output
7

user output
7

Test 24

Group: 1, 2, 3

Verdict: ACCEPTED

input
20
DDA
BBCDC
DDD
CCD
...

correct output
14

user output
14