CF1427F.Boring Card Game

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

When they are bored, Federico and Giada often play the following card game with a deck containing 6n6n cards.

Each card contains one number between 11 and 6n6n and each number appears on exactly one card. Initially the deck is sorted, so the first card contains the number 11 , the second card contains the number 22 , \dots , and the last one contains the number 6n6n .

Federico and Giada take turns, alternating; Federico starts.

In his turn, the player takes 33 contiguous cards from the deck and puts them in his pocket. The order of the cards remaining in the deck is not changed. They play until the deck is empty (after exactly 2n2n turns). At the end of the game both Federico and Giada have 3n3n cards in their pockets.

You are given the cards in Federico's pocket at the end of the game. Describe a sequence of moves that produces that set of cards in Federico's pocket.

输入格式

The first line of the input contains one integer nn ( 1n2001\le n \le 200 ).

The second line of the input contains 3n3n numbers x1,x2,,x3nx_1, x_2,\ldots, x_{3n} ( 1x1<x2<<x3n6n1 \le x_1 < x_2 <\ldots < x_{3n} \le 6n ) – the cards in Federico's pocket at the end of the game.

It is guaranteed that for each test there is at least one sequence of moves that produces such set of cards in Federico's pocket.

输出格式

Print 2n2n lines, each containing 33 integers.

The ii -th line should contain, in increasing order, the integers ai<bi<cia_i<b_i<c_i written on the three cards taken by the player during the ii -th turn (so taken by Federico if ii is odd and by Giada if ii is even).

If there is more than one possible sequence of moves, you can print any.

输入输出样例

  • 输入#1

    2
    2 3 4 9 10 11

    输出#1

    9 10 11
    6 7 8
    2 3 4
    1 5 12
  • 输入#2

    5
    1 2 3 4 5 9 11 12 13 18 19 20 21 22 23

    输出#2

    19 20 21
    24 25 26
    11 12 13
    27 28 29
    1 2 3
    14 15 16
    18 22 23
    6 7 8
    4 5 9
    10 17 30

说明/提示

Explanation of the first testcase: Initially the deck has 12=2612 = 2\cdot 6 sorted cards, so the deck is [1 2 3 4 5 6 7 8 9 10 11 12][1\ 2\ 3\ 4\ 5\ 6\ 7\ 8\ 9\ 10\ 11\ 12] .

  • During turn 11 , Federico takes the three cards [9 10 11][9\ 10\ 11] . After his move, the deck is [1 2 3 4 5 6 7 8 12][1\ 2\ 3\ 4\ 5\ 6\ 7\ 8\ 12] .
  • During turn 22 , Giada takes the three cards [6 7 8][6\ 7\ 8] . After her move, the deck is [1 2 3 4 5 12][1\ 2\ 3\ 4\ 5\ 12] .
  • During turn 33 , Federico takes the three cards [2 3 4][2\ 3\ 4] . After his move, the deck is [1 5 12][1\ 5\ 12] .
  • During turn 44 , Giada takes the three cards [1 5 12][1\ 5\ 12] . After her move, the deck is empty.

At the end of the game, the cards in Federico's pocket are [2 3 4 9 10 11][2\ 3\ 4\ 9\ 10\ 11] and the cards in Giada's pocket are [1 5 6 7 8 12][1\ 5\ 6\ 7\ 8\ 12] .

首页