CSES - Datatähti 2020 alku - Results
Submission details
Task:Merkkijonot
Sender:10GOTO10
Submission time:2019-10-06 21:13:07 +0300
Language:C++11
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2, 3details
#20.03 s2, 3details
#30.33 s3details
#4--3details
#50.03 s3details
#60.01 s1, 2, 3details
#7ACCEPTED0.01 s1, 2, 3details
#8ACCEPTED0.01 s1, 2, 3details
#9ACCEPTED0.01 s1, 2, 3details
#100.03 s2, 3details
#110.03 s2, 3details
#120.03 s2, 3details
#130.03 s2, 3details
#140.03 s2, 3details
#150.38 s3details
#160.38 s3details
#170.38 s3details
#180.38 s3details
#190.38 s3details
#200.01 s1, 2, 3details
#210.01 s1, 2, 3details
#220.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:30:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j = 0; j < in[i].length(); j++) {
                  ~~^~~~~~~~~~~~~~~~
input/code.cpp:31:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int k = j+1; k < in[i].length(); k++) {
                     ~~^~~~~~~~~~~~~~~~

Code

#include <iostream>
#include <string>
#include <sstream>

using namespace std;

int n;
stringstream ss;

int factorial(int n) 
{ 
    int mut = 1; 
    for (int sis = 2; sis <= n; sis++) 
        mut = mut * sis; 
    return mut; 
}

int main() {
	cin>>n;
	string in[n];
	string pairs[n];
	int seen[n];
	int paircount = 0;
	
	for(int i = 0; i < n; i++)
        seen[i] = 0;
        
	for(int i = 0; i < n; i++) {
		cin>>in[i];
		for(int j = 0; j < in[i].length(); j++) {
			for(int k = j+1; k < in[i].length(); k++) {
				if(in[i].at(j) == in[i].at(k)) {
					ss << j << k;
					pairs[i].append(ss.str());
					ss.str("");
				}
			}
		}
	}
	
	for(int i = 0; i < n; i++) {
        if(seen[i] == 0) {
            int count = 0;
            for(int j = i; j < n; j++) {
                if(pairs[j] == pairs[i]) {
                    count += 1;
                    seen[j] = 1;
                }
        	}
            paircount += (factorial(count) / (2 * factorial(count - 2)));
        }
    }
	cout<<paircount;
}

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:

input
20
AAB
D
CDBAA
D
...

correct output
15

user output
48

Test 21

Group: 1, 2, 3

Verdict:

input
20
A
CDD
AABBC
DBCB
...

correct output
15

user output
48

Test 22

Group: 1, 2, 3

Verdict:

input
20
ACADD
CDDCD
DACA
CCDCA
...

correct output
17

user output
38

Test 23

Group: 1, 2, 3

Verdict:

input
20
DCDA
BDBA
CACBD
BA
...

correct output
7

user output
20

Test 24

Group: 1, 2, 3

Verdict:

input
20
DDA
BBCDC
DDD
CCD
...

correct output
14

user output
29