CSES - Datatähti 2020 alku - Results
Submission details
Task:Merkkijonot
Sender:Microwave Abuser
Submission time:2019-10-02 22:33:25 +0300
Language:C++ (C++17)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.01 s1, 2, 3details
#20.01 s2, 3details
#30.07 s3details
#40.05 s3details
#50.03 s3details
#60.01 s1, 2, 3details
#7ACCEPTED0.01 s1, 2, 3details
#8ACCEPTED0.01 s1, 2, 3details
#90.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.08 s3details
#160.08 s3details
#170.08 s3details
#180.08 s3details
#190.08 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

Code

//g++ -std=c++17 -O2 -Wall microwave.cpp -o microwave
#include <bits/stdc++.h>
using namespace std;
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	//COMMENCE CODE
	int n;
	cin >> n;	//N = AMOUNT OF JONOJA
	string gayarray [n+1];
 
	for(int jono = 1; jono <= n; jono++)
	{
		cin >> gayarray[jono];
	}
 
	//INPUT COLLECTED, LETS DO STUFF
	for(int jono = 1; jono <= n; jono++)	//Jokaiselle jonolle
	{
		string cipher [2];	//0:plain, 1:cipher
		cipher[0] = "                          ";
		cipher[1] = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";	//Eka plain = a, toka = b...
		int nextPlain = 0;
		bool found;
		for(unsigned int paikka = 0; gayarray[jono][paikka] != '\0'; paikka++)	//jokaiselle paikalle [!]RISKI ;-;
		{
			found = false;
			for(int r = 0; r < nextPlain; r++)
			{
				if(cipher[0][r] == gayarray[jono][paikka])	//Jos kirjanin on cipheris
				{
					gayarray[jono][paikka] = cipher[1][r];
					found = true;
					break;
				}
			}
			if(!found)	//Jos ei ole cipheris, adaa se
			{
				cipher[0][nextPlain] = gayarray[jono][paikka];
				//adattu, vaihda viel nykyne kirjain
				gayarray[jono][paikka] = cipher[1][nextPlain];
				nextPlain++;
			}
		}
	}
	//JONOT REKONSTRIOITU, ETSI PARIT!!!

	string bins [n+1] = {""};
	int binAmounts [n+1] = {0};
	int lastBin = 0;

	for(int jono = 1; jono <= n; jono++)
	{
		bool sorted = false;
		for(int bin = 1; bin <= lastBin; bin++)
		{
			if(false)
			{
				sorted = true;
				binAmounts[bin] += 1;
				break;
			}
		}
		if(!sorted)
		{
			lastBin++;
			bins[lastBin] = gayarray[jono];
			binAmounts[lastBin] += 1;
		}
	}

	int count = 0;
	for(int r = 1; r <= lastBin; r++)
	{
		int combo = binAmounts[r];
		if(combo > 1)
		{
			count += (combo*(combo-1))/2;
		}
	}
	cout << count;
}

Test details

Test 1

Group: 1, 2, 3

Verdict:

input
20
FFDISOVJLPIASANJRBHQXJVW
HBGVRZFWOTAAVUPYKMKXAOBEYUE
JKHXTPHUKTLTLNXMXMSYYFLF
HCSZMXTZCUFHIHSTEWKHCFZRTXU
...

correct output
20

user output
0

Test 2

Group: 2, 3

Verdict:

input
5000
AJEDROEDXRGDUSDAPZBXXQBPJ
PDGCTAGCRTBCJICPFELRRMLFD
TISAOTGMDKUCITIEFQVCSBZJYUUO
FMASVJYFPMELSVLQWFZVLVMSPHYL
...

correct output
2178556

user output
0

Test 3

Group: 3

Verdict:

input
100000
RESKYADLVRSDCDXJVECAJCAP
CZLIWDHKVNRJHZINHFBOQEPN
LSTRSDTLADUIWXFQJSQPVRSPBCTZ
QEMSZOQSSVBRNQTCLJQIGVQO
...

correct output
404880850

user output
0

Test 4

Group: 3

Verdict:

input
100000
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
4999950000

user output
0

Test 5

Group: 3

Verdict:

input
100000
IPI
Q
SPGV
UNYE
...

correct output
1041990627

user output
0

Test 6

Group: 1, 2, 3

Verdict:

input
20
A
B
C
D
...

correct output
190

user output
0

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:

input
2
A
A

correct output
1

user output
0

Test 10

Group: 2, 3

Verdict:

input
5000
SEKNHNRHSRFYIHSCDPGXPTGUSYBFKZ...

correct output
20861

user output
0

Test 11

Group: 2, 3

Verdict:

input
5000
UGPWHWOWAREEIROZTRJGUCKDKTZJEO...

correct output
22818

user output
0

Test 12

Group: 2, 3

Verdict:

input
5000
FFQQCBCINBDWIKHFPO
SCJU
DNHYPGIQNZS
KNQCYRAXHHKORXMOVHL
...

correct output
22268

user output
0

Test 13

Group: 2, 3

Verdict:

input
5000
QVWMSYPWXWBBXWCVEOUAVQLDWNBXZB...

correct output
22589

user output
0

Test 14

Group: 2, 3

Verdict:

input
5000
JYORMNQAKXHNRBWGGSMWXWXMBKPBZU...

correct output
20482

user output
0

Test 15

Group: 3

Verdict:

input
100000
DCXXVIEYQAASZJYUUVYZUIJFGVBAYC...

correct output
8925377

user output
0

Test 16

Group: 3

Verdict:

input
100000
IJZHBIYNWQBDWNGZWVXJKXXWFVLPQX...

correct output
8907840

user output
0

Test 17

Group: 3

Verdict:

input
100000
GWUGLGQDAYGGJROIAKBMMICQMDUQQQ...

correct output
8771809

user output
0

Test 18

Group: 3

Verdict:

input
100000
SWVSVXURRSLCSHCPAKWESIPCNDKYLD...

correct output
8704480

user output
0

Test 19

Group: 3

Verdict:

input
100000
ZLSNSZBGIMCOLPDEAKVDAJCTMBNRLH...

correct output
8672362

user output
0

Test 20

Group: 1, 2, 3

Verdict:

input
20
AAB
D
CDBAA
D
...

correct output
15

user output
0

Test 21

Group: 1, 2, 3

Verdict:

input
20
A
CDD
AABBC
DBCB
...

correct output
15

user output
0

Test 22

Group: 1, 2, 3

Verdict:

input
20
ACADD
CDDCD
DACA
CCDCA
...

correct output
17

user output
0

Test 23

Group: 1, 2, 3

Verdict:

input
20
DCDA
BDBA
CACBD
BA
...

correct output
7

user output
0

Test 24

Group: 1, 2, 3

Verdict:

input
20
DDA
BBCDC
DDD
CCD
...

correct output
14

user output
0