| Task: | Merkkijonot |
| Sender: | jusola |
| Submission time: | 2019-10-03 19:19:29 +0300 |
| Language: | C++ (C++11) |
| Status: | READY |
| Result: | 15 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 15 |
| #2 | RUNTIME ERROR | 0 |
| #3 | RUNTIME ERROR | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #2 | ACCEPTED | 0.03 s | 2, 3 | details |
| #3 | RUNTIME ERROR | 0.02 s | 3 | details |
| #4 | RUNTIME ERROR | 0.03 s | 3 | details |
| #5 | RUNTIME ERROR | 0.01 s | 3 | details |
| #6 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #7 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #8 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #9 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #10 | RUNTIME ERROR | 0.01 s | 2, 3 | details |
| #11 | RUNTIME ERROR | 0.01 s | 2, 3 | details |
| #12 | RUNTIME ERROR | 0.01 s | 2, 3 | details |
| #13 | RUNTIME ERROR | 0.01 s | 2, 3 | details |
| #14 | RUNTIME ERROR | 0.01 s | 2, 3 | details |
| #15 | RUNTIME ERROR | 0.02 s | 3 | details |
| #16 | RUNTIME ERROR | 0.02 s | 3 | details |
| #17 | RUNTIME ERROR | 0.02 s | 3 | details |
| #18 | RUNTIME ERROR | 0.02 s | 3 | details |
| #19 | RUNTIME ERROR | 0.02 s | 3 | details |
| #20 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #21 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #22 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #23 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #24 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
Code
#include <iostream>
#include <fstream>
#include <stdlib.h>
#include <string>
#include <algorithm>
#include <iterator>
#include <unordered_map>
#include <stdio.h>
#include <string.h>
using namespace std;
const string alphabet = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
char alphabetArr[54];
/*
bool isPair(const string a = 0, const string b = 0) {
std::unordered_map<char, char> mapA;
std::unordered_map<char, char> mapB;
std::unordered_map<char, char>::iterator it;
char arrA[50];
char arrB[50];
string newA;
string newB;
strcpy(arrA, a.c_str());
strcpy(arrB, b.c_str());
for (int i = 0; i < (int)a.size(); i++) {
if (mapA.find(arrA[i]) != mapA.end()) {
newA = newA + std::string(1, mapA.find(arrA[i])->second);
}
else {
newA = newA + std::string(1, alphabetArr[(int)mapA.size()]);
mapA.insert(std::pair<char, char>(arrA[i], alphabetArr[(int)mapA.size()]));
}
}
for (int i = 0; i < (int)b.size(); i++) {
if (mapB.find(arrB[i]) != mapB.end()) {
newB = newB + std::string(1, mapB.find(arrB[i])->second);
}
else {
newB = newB + std::string(1, alphabetArr[(int)mapB.size()]);
mapB.insert(std::pair<char, char>(arrB[i], alphabetArr[(int)mapB.size()]));
}
}
return (newA == newB);
}
*/
string toFormat(const string in) {
std::unordered_map<char, char> mapStr;
std::unordered_map<char, char>::iterator it;
char arrStr[50];
string newStr;
strcpy(arrStr, in.c_str());
for (int i = 0; i < (int)in.size(); i++) {
if (mapStr.find(arrStr[i]) != mapStr.end()) {
newStr = newStr + std::string(1, mapStr.find(arrStr[i])->second);
}
else {
newStr = newStr + std::string(1, alphabetArr[(int)mapStr.size()]);
mapStr.insert(std::pair<char, char>(arrStr[i], alphabetArr[(int)mapStr.size()]));
}
}
return newStr;
}
int main() {
int num;
int amount = 0;
strcpy(alphabetArr, alphabet.c_str());
string arr[10000];
string newArr[10000];
std::unordered_map<string, int> CountSame;
cin >> num;
for (int i = 0; i < num; i++) {
cin >> arr[i];
}
for (int i = 0; i < num; i++) {
newArr[i] = toFormat(arr[i]);
if (CountSame.find(newArr[i]) != CountSame.end()) {
CountSame[newArr[i]] = CountSame.find(newArr[i])->second+1;
}
else {
CountSame[newArr[i]] = 1;
}
};
for (std::unordered_map<string, int>::iterator it = CountSame.begin(); it != CountSame.end(); ++it)
{
amount += (it->second * (it->second - 1))/2;
}
cout << amount;
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: RUNTIME ERROR
| input |
|---|
| 100000 RESKYADLVRSDCDXJVECAJCAP CZLIWDHKVNRJHZINHFBOQEPN LSTRSDTLADUIWXFQJSQPVRSPBCTZ QEMSZOQSSVBRNQTCLJQIGVQO ... |
| correct output |
|---|
| 404880850 |
| user output |
|---|
| (empty) |
Test 4
Group: 3
Verdict: RUNTIME ERROR
| input |
|---|
| 100000 AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA... |
| correct output |
|---|
| 4999950000 |
| user output |
|---|
| (empty) |
Test 5
Group: 3
Verdict: RUNTIME ERROR
| input |
|---|
| 100000 IPI Q SPGV UNYE ... |
| correct output |
|---|
| 1041990627 |
| user output |
|---|
| (empty) |
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: RUNTIME ERROR
| input |
|---|
| 5000 SEKNHNRHSRFYIHSCDPGXPTGUSYBFKZ... |
| correct output |
|---|
| 20861 |
| user output |
|---|
| (empty) |
Error:
*** buffer overflow detected ***: input/code terminated
Test 11
Group: 2, 3
Verdict: RUNTIME ERROR
| input |
|---|
| 5000 UGPWHWOWAREEIROZTRJGUCKDKTZJEO... |
| correct output |
|---|
| 22818 |
| user output |
|---|
| (empty) |
Error:
*** buffer overflow detected ***: input/code terminated
Test 12
Group: 2, 3
Verdict: RUNTIME ERROR
| input |
|---|
| 5000 FFQQCBCINBDWIKHFPO SCJU DNHYPGIQNZS KNQCYRAXHHKORXMOVHL ... |
| correct output |
|---|
| 22268 |
| user output |
|---|
| (empty) |
Error:
*** buffer overflow detected ***: input/code terminated
Test 13
Group: 2, 3
Verdict: RUNTIME ERROR
| input |
|---|
| 5000 QVWMSYPWXWBBXWCVEOUAVQLDWNBXZB... |
| correct output |
|---|
| 22589 |
| user output |
|---|
| (empty) |
Error:
*** buffer overflow detected ***: input/code terminated
Test 14
Group: 2, 3
Verdict: RUNTIME ERROR
| input |
|---|
| 5000 JYORMNQAKXHNRBWGGSMWXWXMBKPBZU... |
| correct output |
|---|
| 20482 |
| user output |
|---|
| (empty) |
Error:
*** buffer overflow detected ***: input/code terminated
Test 15
Group: 3
Verdict: RUNTIME ERROR
| input |
|---|
| 100000 DCXXVIEYQAASZJYUUVYZUIJFGVBAYC... |
| correct output |
|---|
| 8925377 |
| user output |
|---|
| (empty) |
Test 16
Group: 3
Verdict: RUNTIME ERROR
| input |
|---|
| 100000 IJZHBIYNWQBDWNGZWVXJKXXWFVLPQX... |
| correct output |
|---|
| 8907840 |
| user output |
|---|
| (empty) |
Test 17
Group: 3
Verdict: RUNTIME ERROR
| input |
|---|
| 100000 GWUGLGQDAYGGJROIAKBMMICQMDUQQQ... |
| correct output |
|---|
| 8771809 |
| user output |
|---|
| (empty) |
Test 18
Group: 3
Verdict: RUNTIME ERROR
| input |
|---|
| 100000 SWVSVXURRSLCSHCPAKWESIPCNDKYLD... |
| correct output |
|---|
| 8704480 |
| user output |
|---|
| (empty) |
Test 19
Group: 3
Verdict: RUNTIME ERROR
| input |
|---|
| 100000 ZLSNSZBGIMCOLPDEAKVDAJCTMBNRLH... |
| correct output |
|---|
| 8672362 |
| user output |
|---|
| (empty) |
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 |
