ACM-ICPC-OJ训练营

问题 1793 --Hints of sd0061

1793: Hints of sd0061

时间限制: 6 Sec 内存限制: 128 MB
提交: 8 解决: 3
[提交][状态][讨论版][命题人:]

题目描述

sd0061, the legend of Beihang University ACM-ICPC Team, retired last year leaving a group of noobs. Noobs have no idea how to deal with

m coming contests. sd0061 has left a set of hints for them.

There are

n noobs in the team, the

i-th of which has a rating

ai. sd0061 prepares one hint for each contest. The hint for the

j-th contest is a number

bj, which means that the noob with the

(bj+1)-th lowest rating is ordained by sd0061 for the

j-th contest.

The coach asks constroy to make a list of contestants. constroy looks into these hints and finds out:

bi+bj≤bk is satisfied if

bi≠bj,

bi<bk and

bj<bk.

Now, you are in charge of making the list for constroy.

输入描述

There are multiple test cases (about

10).

For each test case:

The first line contains five integers

n,m,A,B,C.

(1≤n≤107,1≤m≤100)

The second line contains

m integers, the

i-th of which is the number

bi of the

i-th hint.

(0≤bi<n)

The

n noobs' ratings are obtained by calling following function

n times, the

i-th result of which is

ai.

unsigned x = A, y = B, z = C;
unsigned rng61() {
  unsigned t;
  x ^= x << 16;
  x ^= x >> 5;
  x ^= x << 1;
  t = x;
  x = y;
  y = z;
  z = t ^ x ^ y;
  return z;
}

输出描述

For each test case, output "Case #x: y1 y2 ⋯ ym" in one line (without quotes), where

x indicates the case number starting from

1 and

(1≤i≤m) denotes the rating of noob for the

i-th contest of corresponding case.

样例输入

样例输出

Case #1: 1 1 202755
Case #2: 405510 405510

来源

[提交][状态]