ผลต่างระหว่างรุ่นของ "01204212/Zooma 1"

จาก Theory Wiki
ไปยังการนำทาง ไปยังการค้นหา
แถว 50: แถว 50:
  
 
* First line: '''n''' and '''m'''
 
* First line: '''n''' and '''m'''
* Next '''n''' lines:
+
* Next '''n''' lines: for 1 <= '''i''' <= '''n''', line '''1 + i''' specifies one integer '''c[i]''' the color of ball '''i'''.
* Next '''m''' lines:
+
* Next '''m''' lines: for 1 <= '''j''' <= '''m''', line '''1 + n + j''' specifies two integers '''d[j]''' and '''p[j]'''.  '''d[j]''' is the color of ball '''n+j''' (this is your '''j'''-th ball), and '''p[j]''' is the number of the ball right after which you shoot this ball into the sequence.  Note that '''p[j]''' < '''n + j'''.
  
 
== Output ==
 
== Output ==
 +
 +
Your program should print '''n+m''' integers which are the ball numbers in the final sequence.
  
 
== Example ==
 
== Example ==
 +
 +
This is the same example with colors: G = 1, B = 2, Y = 3, R = 4.
 +
 +
'''Input'''
 +
 +
<pre>
 +
5 4
 +
1
 +
2
 +
1
 +
3
 +
3
 +
4 3
 +
1 1
 +
2 6
 +
1 5
 +
</pre>
 +
 +
'''Output'''
 +
 +
<pre>
 +
1
 +
7
 +
2
 +
3
 +
6
 +
8
 +
4
 +
5
 +
9
 +
</pre>
  
 
== Test data ==
 
== Test data ==

รุ่นแก้ไขเมื่อ 21:23, 24 สิงหาคม 2559

Back to 01204212

This task is motivated by Zuma, a video game by PopCap Games.

In this version of the game, there is a sequence of n colored balls that moves toward an exit. You can shoot another m colored balls into the sequence. Balls do not disappear in this version.

Find out the final sequence of the balls.

The balls in the original sequence are numbered from 1 to n. The balls that you shoot are numbered from n+1 to n+m.

Game play example

Consider the case where n=5 and m=4. The original sequence has balls with these colors:

        1     2     3     4     5
        G     B     G     Y     Y

You have 3 balls numbered as this:

        6     7     8     9
        R     G     B     G

If you shoot your first ball to the location after ball 3, the sequence becomes

        1     2     3     *6*     4     5
        G     B     G     *R*     Y     Y

If you shoot your second ball to the location after ball 1, the sequence becomes

        1     *7*     2     3     6     4     5
        G     *G*     B     G     R     Y     Y

If you shoot your third ball to the location after ball 6, the sequence becomes

        1     7     2     3     6     *8*     4     5
        G     G     B     G     R     *B*     Y     Y

If you shoot your forth ball to the location after ball 5, the sequence becomes

        1     7     2     3     6     8     4     5     *9*
        G     G     B     G     R     B     Y     Y     *G*

and this is the final sequence.

Note: In this version, the colors of the balls are not relevant because balls do not disappear. In next versions of the task (see Zooma 2 and Zooma 3), there are rules about the disappearance of consecutive balls with the same color.

Input

  • First line: n and m
  • Next n lines: for 1 <= i <= n, line 1 + i specifies one integer c[i] the color of ball i.
  • Next m lines: for 1 <= j <= m, line 1 + n + j specifies two integers d[j] and p[j]. d[j] is the color of ball n+j (this is your j-th ball), and p[j] is the number of the ball right after which you shoot this ball into the sequence. Note that p[j] < n + j.

Output

Your program should print n+m integers which are the ball numbers in the final sequence.

Example

This is the same example with colors: G = 1, B = 2, Y = 3, R = 4.

Input

5 4
1
2
1
3
3
4 3
1 1
2 6
1 5

Output

1
7
2
3
6
8
4
5
9

Test data

Next challenge

Check out Zooma 2.