Statistics

Problem Statement for "GameCipher"

Problem Statement

You are part of the development team for a fantasy role-playing game with many different creatures who speak many different languages. To simplify the language mechanism, your team decides to make every language a simple cipher of the English language. That means, there is a simple mapping between letters in the fake language and letters in English. If B maps to D and E maps to A, then "BEB" in the cipher language means "DAD" in English.

The team quickly finds out that not every random set of mappings will actually work.

1) First of all, self-mappings are not preferable, so you may not have a mapping of say G to G.

2) Next, although not every letter in English needs to be used, the set of letters in the cipher language and the set of letters used in the English language must be equinumerous. That means, there is a one to one mapping from the cipher language to English as well as a one to one mapping from English to the cipher language.

3) Lastly, because the role-playing game will use actual human speech, the team wants to ensure that vowels in the cipher language map to vowels in English (otherwise it would be too hard for the voice actors to speak cipher). Non-vowels must also map to non-vowels.

Write a method violation that takes as input a String[], mappings, representing the mappings from cipher to English. Return the zero-based index of the first violation in mappings, or return -1 if there are no violations.

Definition

Class:
GameCipher
Method:
violation
Parameters:
String[]
Returns:
int
Method signature:
int violation(String[] mappings)
(be sure your method is public)

Notes

  • Vowels are always A,E,I,O,U,Y. Note that Y is always a vowel for this problem.
  • If there are multiple violations, return the index of the first one that causes a mapping violation.
  • Indices are zero-based. The first element has index 0.
  • If mappings contains a repeat mapping, then that is a violation, e.g. { "L-P", "A-E", "L-P" }.

Constraints

  • Each element of mappings will be formatted exactly as an uppercase letter ('A'-'Z'), a '-', and another uppercase letter.
  • There will be between 0 and 26 elements in mappings, inclusive.

Examples

  1. {"A-E", "B-C", "C-D", "D-B"}

    Returns: -1

    Nothing is wrong with this cipher.

  2. {"C-D", "Z-Z", "Y-Y"}

    Returns: 1

    There are two violations because of self-mappings. Return the earliest one.

  3. {"B-D", "C-F", "L-M", "P-Y", "I-O", "A-Q"}

    Returns: 3

    There are again two violations because of a vowel mismatch. Return the earlier one (P-Y).

  4. {"B-C", "X-Z", "B-D"}

    Returns: 2

    The violation is from the mapping of B-D, since an earlier mapping maps B-C. Return the mapping that actually causes the violation, which is B-D.

  5. {"B-C", "D-C"}

    Returns: 1

    Again, the violation is that C is already used, so return the mapping that causes the violation.

  6. {"A-E", "E-A"}

    Returns: -1

    This is perfectly ok, even though the cipher is a reverse of itself.

  7. {"A-E","B-C","C-D","M-N","G-H","H-Q","P-R","I-O","Y-I","K-J","J-K","S-X","V-T","W-V","X-Z"}

    Returns: -1

  8. {"A-E","B-C","C-D","M-N","G-H","H-Q","P-R","I-O","Y-Y","K-J","J-K","S-X","V-T","W-V","X-Z"}

    Returns: 8

  9. {"A-E","B-C","C-D","M-N","G-H","H-Q","G-J","I-O","Y-I","K-J","J-K","S-X","V-T","W-V","X-Z"}

    Returns: 6

  10. {"A-E","B-C","C-D","M-N","G-H","H-Q","P-R","I-O","Y-I","K-J","J-K","S-X","V-T","W-V","X-Z","A-E"}

    Returns: 15

  11. {"A-E","B-D","A-E"}

    Returns: 2

    You may not have the same mapping twice.

  12. {"A-E","B-C","C-D","D-B"}

    Returns: -1

  13. {"C-D","Z-Z","Y-Y"}

    Returns: 1

  14. {"B-D","C-F","L-M","P-Y","I-O","A-Q"}

    Returns: 3

  15. {"B-C","X-Z","B-D"}

    Returns: 2

  16. {"B-C","D-C"}

    Returns: 1

  17. {"A-E","E-A"}

    Returns: -1

  18. {"A-E","B-C","C-D","M-N","G-H","H-Q","P-R","I-O","Y-I","K-J","J-K","S-X","V-T","W-V","X-Z"}

    Returns: -1

  19. {"A-E","B-C","C-D","M-N","G-H","H-Q","P-R","I-O","Y-Y","K-J","J-K","S-X","V-T","W-V","X-Z"}

    Returns: 8

  20. {"A-E","B-C","C-D","M-N","G-H","H-Q","G-J","I-O","Y-I","K-J","J-K","S-X","V-T","W-V","X-Z"}

    Returns: 6

  21. {"A-E","B-C","C-D","M-N","G-H","H-Q","P-R","I-O","Y-I","K-J","J-K","S-X","V-T","W-V","X-Z","A-E"}

    Returns: 15

  22. {"A-E","B-D","A-E"}

    Returns: 2

  23. {"B-C","D-C"}

    Returns: 1

  24. {"B-C","D-F","F-C","X-C"}

    Returns: 2

  25. {"A-E","S-T","T-V","E-Q"}

    Returns: 3

  26. {"A-B"}

    Returns: 0

  27. {"A-E","B-E"}

    Returns: 1

  28. {"C-D","B-D"}

    Returns: 1

  29. {"A-P","B-C","B-D"}

    Returns: 0

  30. {"C-B","D-B"}

    Returns: 1

  31. {"Z-A","Y-E","B-O"}

    Returns: 0

  32. {"A-Y","B-C","D-C"}

    Returns: 2

  33. {"B-C","D-C","B-E"}

    Returns: 1

  34. {"B-C","D-C"}

    Returns: 1

  35. {"B-C","D-C"}

    Returns: 1

  36. {"B-C","X-Z","B-D"}

    Returns: 2

  37. {"A-E","E-A","B-C","C-B","D-F","F-D","H-H"}

    Returns: 6

  38. {"A-B","B-A","B-C","D-C","C-D","G-G"}

    Returns: 0

  39. {"B-G","B-F"}

    Returns: 1

  40. {"A-Y"}

    Returns: -1

  41. {"B-Y","O-T"}

    Returns: 0

  42. {"B-C","D-C"}

    Returns: 1

  43. {"X-Z","A-I","X-T"}

    Returns: 2

  44. {"X-A"}

    Returns: 0

  45. {"B-C","D-C"}

    Returns: 1

  46. {"C-C"}

    Returns: 0

  47. {"B-C","B-D"}

    Returns: 1

  48. {"A-A"}

    Returns: 0

  49. {"G-A"}

    Returns: 0

  50. {"B-C","X-T","M-N","R-C"}

    Returns: 3

  51. {"B-C","X-Z","B-D"}

    Returns: 2

  52. {"X-A"}

    Returns: 0

  53. {"B-C","B-D","E-A"}

    Returns: 1

  54. {"A-E","T-P","P-X","A-A"}

    Returns: 3

  55. {"B-C","A-E","B-D"}

    Returns: 2

  56. {"A-Y"}

    Returns: -1

  57. {"C-E"}

    Returns: 0

  58. {"Z-B","Z-C"}

    Returns: 1

  59. {"Y-E","A-A"}

    Returns: 1

  60. {"U-O"}

    Returns: -1

  61. {"B-C","D-C"}

    Returns: 1

  62. {"Y-F"}

    Returns: 0

  63. {"B-C","X-Z","B-D"}

    Returns: 2

  64. {"A-E","E-A"}

    Returns: -1

  65. {"B-D"}

    Returns: -1

  66. {"A-A"}

    Returns: 0

  67. {"B-F","C-F"}

    Returns: 1

  68. {"A-E","B-C","I-E"}

    Returns: 2

This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2024, TopCoder, Inc. All rights reserved.
This problem was used for: