Scribd
Upload
50 views

CSEC-ASTU Competitive Programming Contest 2021 Problem 100: Rank The Languages

The document describes a problem that ranks languages according to the number of states where they are spoken. It provides a sample map with letters representing different languages spoken in connected areas (states). The task is to determine the number of states for each language and output them in decreasing order, with ties broken alphabetically. The input consists of test cases with map dimensions and letter strings, and the output prints the world number and languages with their state counts in the required format.

Uploaded by

Abraham Mekuria
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
50 views

CSEC-ASTU Competitive Programming Contest 2021 Problem 100: Rank The Languages

The document describes a problem that ranks languages according to the number of states where they are spoken. It provides a sample map with letters representing different languages spoken in connected areas (states). The task is to determine the number of states for each language and output them in decreasing order, with ties broken alphabetically. The input consists of test cases with map dimensions and letter strings, and the output prints the world number and languages with their state counts in the required format.

Uploaded by

Abraham Mekuria
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

CSEC - ASTU

CSEC-ASTU Competitive Programming Contest 2021

Problem 100: Rank the Languages


Time limit: 1s

You might have noticed that English and Spanish are spoken in many areas all over the world. Now it
would be nice to rank all languages according to the number of states where they are spoken.
You're given a map which shows the states and the languages where they are spoken. Look at the
following map:

ttuuttdd
ttuuttdd
uuttuudd
uuttuudd

The map is read like this: Every letter stands for a language and states are defined as connected areas
with the same letter. Two letters are “connected" if one is at left, at right, above or below the other one. So
in the above map, there are three states where the language “t" is spoken, three where
“u" is spoken and one state where people speak “d".
Your job is to determine the number of states for each language and print the results in a certain order.

Input
The first line contains the number of test cases N. Each test case consists of a line with two numbers H
and W, which are the height and the width of the map. Then follow H lines with a string of W letters.
Those letters will only be lowercase letters from `a' to `z'.

Output
For each test case print `World #n', where n is the number of the test case. After that print a line for each
language that appears in the test case, which contains the language, a colon, a space and the number of
states, where that language is spoken. These lines have to be ordered decreasingly by the number of
states. If two languages are spoken in the same number of states, they have to appear alphabetically,
which means language `i' comes before language `q', as shown in the sample input output.

Source: Uva Andalus Division August 10, 2021


CSEC - ASTU

CSEC-ASTU Competitive Programming Contest 2021


Sample Input 1 Sample Output 1
2 World #1
4 8 t: 3
u: 3
ttuuttdd d: 1
ttuuttdd World #2
uuttuudd b: 2
uuttuudd a: 1
9 9 c: 1
bbbbbbbbb
aaaaaaaab
bbbbbbbab
baaaaacab
bacccccab
bacbbbcab
bacccccab
baaaaaaab
bbbbbbbbb

Source: Uva Andalus Division August 10, 2021

You might also like