CodeForces 275C k-Multiple Free Set（二分查找）

最新推荐文章于 2022-05-10 12:13:04 发布

昨日明眸

最新推荐文章于 2022-05-10 12:13:04 发布

阅读量336

点赞数

分类专栏：二分法

本文链接：https://blog.csdn.net/qaz135135135/article/details/52042636

版权

二分法专栏收录该内容

24 篇文章 0 订阅

订阅专栏

k-Multiple Free Set

Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u

Submit Status

Description

A k-multiple free set is a set of integers where there is no pair of integers where one is equal to another integer multiplied by k. That is, there are no two integers x and y(x < y) from the set, such that y = x·k.

You're given a set of n distinct positive integers. Your task is to find the size of it's largest k-multiple free subset.

Input

The first line of the input contains two integers n and k (1 ≤ n ≤ 10⁵, 1 ≤ k ≤ 10⁹). The next line contains a list of n distinct positive integers a₁, a₂, ..., a_n(1 ≤ a_i ≤ 10⁹).

All the numbers in the lines are separated by single spaces.

Output

On the only line of the output print the size of the largest k-multiple free subset of {a₁, a₂, ..., a_n}.

Sample Input

Input

6 2
2 3 6 5 4 10

Output

Hint

In the sample input one of the possible maximum 2-multiple free subsets is {4, 5, 6}.

编译器出了问题，还以为代码错了，浪费了那么多时间

给出n和k，然后给出元素个数为n的集合num，现在要从num集合中挑选出尽量多的元素组成新的集合，新的集合的要求是集合中不存在元素x ， y（x < y）使得x * k = y，输出最大的元素个数。

想将数字进行排序，然后，从头到尾二分查找，对已查找的进行标记，轮到其实跳过

#include<stdio.h>
#include<algorithm>
#include<iostream>
using namespace std; 
int v[100010];  
long long a[100010];  
int main()  
{  
    int n;  
    long long k;  
    scanf("%d%lld",&n,&k);  
    for(int i=1;i<=n;++i){  
        scanf("%lld",&a[i]);  
    }  
    sort(a+1,a+n+1);  
    memset(v,0,sizeof(v));  
    int ans=n;  
    for(int i=1;i<=n;++i){  
        if(v[i]==1)
		continue;  
        int  left=i+1,right=n;  
        long long temp = a[i]*k;  
        while(left<=right){  
            int mid=(left+right)/2; 
			//printf("%d %d  ",left,right); 
            if(a[mid]==temp){  
                v[mid]=1;
				ans--;
				break;  
            }  
            else if(a[mid]>temp){  
                right=mid-1;  
            }  
            else{  
                left=mid+1;  
            }  
        }  
    }  
    printf("%d\n",ans);   
}