【HDU6040】Hints of sd0061(nth_element)

记录一个菜逼的成长。。

2017 Multi-University Training Contest - Team 1

题目链接

题目大意:

给你$n,m,A,B,C$,由$A,B,C$生成$a$数组$n$个数，给出$b$数组$m$个数，根据这$m$个数排a数组。
输出排名为$b_i$的对应的$a$数组中的数

笔记

黑科技:$nth_element$
第一次知道还有这个函数
$nth_element(first,nth,last)$
在$[first,last)$将排名为$nth$的值放在相应的位置上

要从大到小选择nth_element，这样复杂度才是接近$\text{O}(n)$

#include <bits/stdc++.h>
using namespace std;
#define rep(i,l,r) for( int i = l; i <= r; i++ )
#define rep0(i,l,r) for( int i = l; i < r; i++ )
#define ALL(v) (v).begin(),(v).end()
#define cl(a,b) memset(a,b,sizeof(a))
#define clr clear()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
typedef long long LL;
typedef pair<int,int> PII;
const int INF = 0x3f3f3f3f;
const int maxn = 10000000 + 10;
int b[110],c[110],id[110];
unsigned a[maxn];
unsigned x,y,z;
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;
}
bool cmp(int aa,int bb)
{
  return b[aa] < b[bb]; 
}
int main()
{
  int n,m,cas = 1;
  while(~scanf("%d%d%u%u%u",&n,&m,&x,&y,&z)){
    rep0(i,0,m)scanf("%d",b+i),id[i] = i;

    rep0(i,0,n)a[i] = rng61();

    sort(id,id+m,cmp);
    b[id[m] = m] = n;

    for( int i = m - 1; ~i; i-- ){
      if (b[id[i]] == b[id[i + 1]]){
        c[id[i]] = c[id[i + 1]];
        continue;
      }
      nth_element(a,a + b[id[i]],a + b[id[i + 1]]);
      c[id[i]] = a[b[id[i]]];
    }
    printf("Case #%d: ",cas++);
    for( int i = 0; i < m; i++ )printf("%u%c",c[i]," \n"[i == m-1]);
  }
  return 0;
}