Codeforces Round 901 (Div. 2)

B. Jellyfish and Game

Example

input

Copy

4

2 2 1

1 2

3 4

1 1 10000

1

2

4 5 11037

1 1 4 5

1 9 1 9 8

1 1 1

2

1

output

Copy

6
1
19
2

Note

In the first test case, Jellyfish will swap the apple of value 11 and 44.

In the second test case, both players will swap the two apples 10,00010,000 times.

In the fourth test case, Jellyfish will do nothing.

无论有多少个回合，中间的过程无非就是用最小的换对方最大的。而两个为了最优，最小的和最大的一定在不同的人手上（因为谁都想把最大的留在自己这边，最小的留在对方那边）

那么就只需要关注：最后一次交换权在谁的手上

#include
#include
#include
#include
#include
#include
#include
#include 
#include
#include
#include
#include
#include
#include 
#include

C. Jellyfish and Green Apple

input

Copy

4

10 5

1 5

10 4

3 4

output

Copy

0
-1
2
5

If there are 7 apples for 4 persons,you should give 1 apple for each person,so there are 3 apples(3 pieces) now.And we know no one will get a whole apple(a whole piece),so we should devide every piece into two,now we have 6 pieces.After giving every person a piece,there are 2 pieces now.As what I just said,no one will get a whole piece,so we should devide every piece into two,now there are 4 pieces for 4 person,perfect!

#include
#include
#include
#include
#include
#include
#include
#include 
#include
#include
#include
#include
#include
#include 
#include