CSES - Datatähti 2020 alku - Results
Submission details
Task:Merkkijonot
Sender:patamaski
Submission time:2019-10-03 20:04:54 +0300
Language:C++ (C++11)
Status:READY
Result:46
Feedback
groupverdictscore
#1ACCEPTED15
#2ACCEPTED31
#30
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2, 3details
#2ACCEPTED0.01 s2, 3details
#3ACCEPTED0.18 s3details
#40.16 s3details
#5ACCEPTED0.06 s3details
#6ACCEPTED0.01 s1, 2, 3details
#7ACCEPTED0.01 s1, 2, 3details
#8ACCEPTED0.01 s1, 2, 3details
#9ACCEPTED0.01 s1, 2, 3details
#10ACCEPTED0.02 s2, 3details
#11ACCEPTED0.02 s2, 3details
#12ACCEPTED0.02 s2, 3details
#13ACCEPTED0.02 s2, 3details
#14ACCEPTED0.02 s2, 3details
#15ACCEPTED0.21 s3details
#16ACCEPTED0.21 s3details
#17ACCEPTED0.21 s3details
#18ACCEPTED0.21 s3details
#19ACCEPTED0.21 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 <bits/stdc++.h>
using namespace std;
int main()
{
int jonoja;
cin >> jonoja;
// jonot talteen
string jono[jonoja];
for (int i = 0; i < jonoja; ++i)
{
cin >> jono[i];
}
string lajittelu[jonoja];
for (int i = 0; i < jonoja; ++i)
{
// lajittelu[i] = " ";
lajittelu[i] = " ";
}
string kirjain = "abcdefghijklmnopqrstuvwxyz0123456789";
bool testi[50];
int pituus;
int menneet;
// tallettaa jonot uuteen muotoon
// käy läpi jono kerrallaan
for (int i = 0; i < jonoja; ++i)
{
menneet = 0;
pituus = jono[i].length();
// Nollaa testin
for (int j = 0; j < 50; ++j)
{
testi[j] = 0;
}
// Käy läpi merkki kerrallaan
for (int j = 0; j < pituus; ++j)
{
// Jos jo käyty, ohittaa
if (testi[j] == 1)
{
continue;
}
// Käy jonon seuraavat merkit läpi
for (int k = 1; k <= pituus-j; ++k)
{
// Jos sama, kuin etsittävä
if (jono[i][j] == jono[i][pituus-k])
{
lajittelu[i][pituus-k] = kirjain[menneet];
testi[pituus-k] = 1;
}
}
menneet++;
}
}
// Lajittelee luodut jonot
sort(lajittelu, lajittelu + jonoja);
// Tallettaa montako minkäkin tyyppistä jonoa löytyy
int samoja[jonoja];
for (int i = 0; i < jonoja; ++i)
{
samoja[i] = 0;
}
int talletus = 0;
for (int i = 1; i < jonoja; ++i)
{
// Jos jonot samat, lisää samoja yhdellä
if (lajittelu[i] == lajittelu[i-1])
{
samoja[talletus]++;
}
// Muuten siirtyy toisen tyyppisiin jonoihin
else
{
talletus++;
}
}
// for (int i = 0; i < jonoja; ++i)
// {
// cout << lajittelu[i] << "\n";
// cout << samoja[i] << "\n";
// }
// Laskee jokaiselle tulos+1 yli k:n
int tulos = 0;
for (int i = 0; i < jonoja; ++i)
{
tulos += (samoja[i] * (samoja[i]+1)) / 2;
}
// Tulostus
cout << tulos << "\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:

input
100000
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
4999950000

user output
704982704

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