아직 만들고 있는 페이지입니다.

이 페이지는 아직 만드는 중입니다. 보이는 내용은 바뀔 수 있습니다.

Heroes of Velmar

시간 제한1초메모리 제한1024 MB

요약
세 지역에 양쪽 플레이어가 낸 카드 목록이 주어질 때, 카드 능력 규칙을 적용해 각 지역의 힘을 계산하고 승자를 가린다.
난이도

보통10점 중 4점

유형
구현, 시뮬레이션, 정렬
정답자
아직 제출이 없습니다

문제

Welcome to the world of Heroes of Velmar, the critically acclaimed trading card game developed by Sidney Games! After the tremendous success of the physical card game, Sidney Games has decided to take it to the next level and transform it into an immersive video game experience.

As Sidney Games embarks on this ambitious video game project, they seek the expertise of talented developers like you to bring this digital version to life. The challenge lies in coding the algorithm that determines the winner in the virtual battles that unfold between players. The video game will need to retain the same core mechanics as the original card game, where players compete on three distinct locations over six turns, with abilities and power levels shaping the outcomes.

The full rules of the game are listed below. You are given the state of the locations after Setup and Gameplay have finished and the End of the Game has been reached. Sidney Games has tasked you with implementing the Location Resolution part of the game rules, including the application of Special Abilities, to determine the winner.

The game designers have provided you with images of the cards as well as a JSON file with their specifications.

입력

Input consists of six lines representing the state of the three locations after six turns of play. This means that there will be at most 24 cards total listed in the input.

First the left location is described, then the center location is described, and finally the right location is described. Each location is described by two lines, the first of which represents player 1's cards and the second of which represents player 2's cards. Each line lists the number of cards in the line and then the names of the cards played by the player, separated by spaces. There will be at most four cards in each line.

Note that a player may leave a location empty. Each input is guaranteed to be a valid reachable final game state according to the game rules.

출력

Output "Player 1" if player 1 won, "Player 2" if player 2 won, or "Tie" if there was no victor.

예제3

  1. 예제 1

    입력
    3 Shadow Seraphina Ironwood
    2 Voidclaw Voidclaw
    1 Vexia
    0
    1 Ranger
    0
    
    예상 출력
    Player 1
    
  2. 예제 2

    입력
    1 Guardian
    1 Anvil
    2 Seraphina Seraphina
    1 Ranger
    2 Ironwood Ranger
    1 Guardian
    
    예상 출력
    Tie
    
  3. 예제 3

    입력
    1 Guardian
    1 Anvil
    2 Seraphina Seraphina
    1 Ranger
    1 Ironwood
    1 Guardian
    
    예상 출력
    Player 2