CSES - Datatähti 2020 alku - Results
Submission details
Task:Merkkijonot
Sender:ArturT
Submission time:2019-10-06 18:21:18 +0300
Language:C++ (C++11)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2, 3details
#20.01 s2, 3details
#30.14 s3details
#40.18 s3details
#50.04 s3details
#60.01 s1, 2, 3details
#7ACCEPTED0.01 s1, 2, 3details
#8ACCEPTED0.01 s1, 2, 3details
#9ACCEPTED0.01 s1, 2, 3details
#100.01 s2, 3details
#110.01 s2, 3details
#120.01 s2, 3details
#130.01 s2, 3details
#140.01 s2, 3details
#150.16 s3details
#160.16 s3details
#170.15 s3details
#180.15 s3details
#190.15 s3details
#20ACCEPTED0.01 s1, 2, 3details
#21ACCEPTED0.01 s1, 2, 3details
#22ACCEPTED0.01 s1, 2, 3details
#230.01 s1, 2, 3details
#240.01 s1, 2, 3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:21:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int s = 0; s < input.size(); s++) {
                   ~~^~~~~~~~~~~~~~
input/code.cpp:37:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int row = 0; row < structures.size(); row++) {
                    ~~~~^~~~~~~~~~~~~~~~~~~
input/code.cpp:40:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int rowB = 0; rowB <= structures.size() - 1; rowB++) {
                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Code

#include<iostream>
#include<vector>
#include <algorithm>
using namespace std;

int factorial(int n)
{
	return (n == 1 || n == 0) ? 1 : factorial(n - 1) * n;
}

int main() {
	int count;
	cin >> count;
	vector<vector<int>> structures;
	for (int row = 0; row < count; row++) {
		string input;
		cin >> input;
		vector<int> structure;
		vector<char> structRef;
		int max = 0;
		for (int s = 0; s < input.size(); s++) {
			vector<char>::iterator itr = find(structRef.begin(), structRef.end(), input[s]);
			if (itr != structRef.cend()) { // Found previously?
				structure.push_back(distance(structRef.begin(), itr));
			}
			else {
				
				structRef.push_back(input[max]); // Found now
				structure.push_back(max);
				max++;
			}
		}
		structures.push_back(structure);
	}
	int pairsFound = 0;
	vector<int> found;
	for (int row = 0; row < structures.size(); row++) {
		if (!(find(found.begin(), found.end(), row) != found.end())) {
			int matches = 0;
			for (int rowB = 0; rowB <= structures.size() - 1; rowB++) {
				if (rowB != row && structures[row] == structures[rowB]) {
					found.push_back(rowB);
					matches++;
				}
			}
			if (matches != 0) {
				matches++;
				pairsFound += factorial(matches) / (2 * factorial(matches - 2)); // nCr
			}		
		}
	}
	cout << pairsFound << endl;
}

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:

input
5000
AJEDROEDXRGDUSDAPZBXXQBPJ
PDGCTAGCRTBCJICPFELRRMLFD
TISAOTGMDKUCITIEFQVCSBZJYUUO
FMASVJYFPMELSVLQWFZVLVMSPHYL
...

correct output
2178556

user output
(empty)

Test 3

Group: 3

Verdict:

input
100000
RESKYADLVRSDCDXJVECAJCAP
CZLIWDHKVNRJHZINHFBOQEPN
LSTRSDTLADUIWXFQJSQPVRSPBCTZ
QEMSZOQSSVBRNQTCLJQIGVQO
...

correct output
404880850

user output
(empty)

Test 4

Group: 3

Verdict:

input
100000
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
4999950000

user output
(empty)

Test 5

Group: 3

Verdict:

input
100000
IPI
Q
SPGV
UNYE
...

correct output
1041990627

user output
(empty)

Test 6

Group: 1, 2, 3

Verdict:

input
20
A
B
C
D
...

correct output
190

user output
1

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:

input
5000
SEKNHNRHSRFYIHSCDPGXPTGUSYBFKZ...

correct output
20861

user output
(empty)

Test 11

Group: 2, 3

Verdict:

input
5000
UGPWHWOWAREEIROZTRJGUCKDKTZJEO...

correct output
22818

user output
(empty)

Test 12

Group: 2, 3

Verdict:

input
5000
FFQQCBCINBDWIKHFPO
SCJU
DNHYPGIQNZS
KNQCYRAXHHKORXMOVHL
...

correct output
22268

user output
(empty)

Test 13

Group: 2, 3

Verdict:

input
5000
QVWMSYPWXWBBXWCVEOUAVQLDWNBXZB...

correct output
22589

user output
(empty)

Test 14

Group: 2, 3

Verdict:

input
5000
JYORMNQAKXHNRBWGGSMWXWXMBKPBZU...

correct output
20482

user output
(empty)

Test 15

Group: 3

Verdict:

input
100000
DCXXVIEYQAASZJYUUVYZUIJFGVBAYC...

correct output
8925377

user output
(empty)

Test 16

Group: 3

Verdict:

input
100000
IJZHBIYNWQBDWNGZWVXJKXXWFVLPQX...

correct output
8907840

user output
(empty)

Test 17

Group: 3

Verdict:

input
100000
GWUGLGQDAYGGJROIAKBMMICQMDUQQQ...

correct output
8771809

user output
(empty)

Test 18

Group: 3

Verdict:

input
100000
SWVSVXURRSLCSHCPAKWESIPCNDKYLD...

correct output
8704480

user output
(empty)

Test 19

Group: 3

Verdict:

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:

input
20
DCDA
BDBA
CACBD
BA
...

correct output
7

user output
8

Test 24

Group: 1, 2, 3

Verdict:

input
20
DDA
BBCDC
DDD
CCD
...

correct output
14

user output
16