zoukankan      html  css  js  c++  java
  • Intel Code Challenge Elimination Round (Div.1 + Div.2, combined) D. Generating Sets 贪心+优先队列

    D. Generating Sets
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    You are given a set Y of n distinct positive integers y1, y2, ..., yn.

    Set X of n distinct positive integers x1, x2, ..., xn is said to generate set Y if one can transform X to Y by applying some number of the following two operation to integers in X:

    1. Take any integer xi and multiply it by two, i.e. replace xi with xi.
    2. Take any integer xi, multiply it by two and add one, i.e. replace xi with xi + 1.

    Note that integers in X are not required to be distinct after each operation.

    Two sets of distinct integers X and Y are equal if they are equal as sets. In other words, if we write elements of the sets in the array in the increasing order, these arrays would be equal.

    Note, that any set of integers (or its permutation) generates itself.

    You are given a set Y and have to find a set X that generates Y and the maximum element of X is mininum possible.

    Input

    The first line of the input contains a single integer n (1 ≤ n ≤ 50 000) — the number of elements in Y.

    The second line contains n integers y1, ..., yn (1 ≤ yi ≤ 109), that are guaranteed to be distinct.

    Output

    Print n integers — set of distinct integers that generate Y and the maximum element of which is minimum possible. If there are several such sets, print any of them.

    Examples
    input
    5
    1 2 3 4 5
    output
    4 5 2 3 1 
    input
    6
    15 14 3 13 1 12
    output
    12 13 14 7 3 1 
    input
    6
    9 7 13 17 5 11
    output
    4 5 2 6 3 1 

    题意:给你一个集合y,集合x可以进行1,2的若干’烧‘操作,求x,x需要满足x的最大值最小; 

    思路:每次取最大的往下改变,不能变就存答案;

    #include<bits/stdc++.h>
    using namespace std;
    #define ll long long
    #define pi (4*atan(1.0))
    #define eps 1e-14
    const int N=2e5+10,M=4e6+10,inf=1e9+10,mod=1e9+7;
    const ll INF=1e18+10;
    priority_queue<int>q;
    int ans[N],flag,a[N],n;
    map<int,int>m;
    int main()
    {
        scanf("%d",&n);
        for(int i=1; i<=n; i++)
            scanf("%d",&a[i]),m[a[i]]=1,q.push(a[i]);
        while(!q.empty())
        {
            int v=q.top();
            q.pop();
            int num=v;
            while(num)
            {
                if(!m[num])break;
                num>>=1;
            }
            if(num&&!m[num])
            {
                q.push(num);
                m[v]=0;
                m[num]=1;
            }
            else
                ans[flag++]=v;
        }
        for(int i=0;i<n;i++)
            printf("%d ",ans[i]);
        return 0;
    }
  • 相关阅读:
    服务器端接受Json数据的绑定实现
    SQL 学习笔记
    asp.net mvc下的多语言方案 包含Html,Javascript和图片
    设计和创建自己的Sharepoint Site
    SharePoint类库简要总结
    TED-谷歌创始人演示谷歌眼睛
    为什么要有战争
    跨云应用部署:共享数据存储
    使用VNET-to-VNET连接Microsoft Azure国际版和中国版
    MySQL Database on Azure新功能
  • 原文地址:https://www.cnblogs.com/jhz033/p/5927714.html
Copyright © 2011-2022 走看看