codeforces876B
来源:互联网 发布:lk在linux的哪一层 编辑:程序博客网 时间:2024/06/07 11:33
Divisiblity of Differences
You are given a multiset of n integers. You should select exactly k of them in a such way that the difference between any two of them is divisible by m, or tell that it is impossible.
Numbers can be repeated in the original multiset and in the multiset of selected numbers, but number of occurrences of any number in multiset of selected numbers should not exceed the number of its occurrences in the original multiset.
Input
First line contains three integers n, k and m (2 ≤ k ≤ n ≤ 100 000, 1 ≤ m ≤ 100 000) — number of integers in the multiset, number of integers you should select and the required divisor of any pair of selected integers.
Second line contains n integers a1, a2, …, an (0 ≤ ai ≤ 109) — the numbers in the multiset.
Output
If it is not possible to select k numbers in the desired way, output «No» (without the quotes).
Otherwise, in the first line of output print «Yes» (without the quotes). In the second line print k integers b1, b2, …, bk — the selected numbers. If there are multiple possible solutions, print any of them.
Examples
Input
3 2 3
1 8 4
Output
Yes
1 4
Input
3 3 3
1 8 4
Output
No
Input
4 3 5
2 7 7 7
Output
Yes
2 7 7
题意:给你n个数,要你找出一个大小为k的子集,要求子集中任意两个数的差的绝对值能被m整除。
思路:n的范围很大,暴力超时。而当两个数的差的绝对值能被m整除时,他们%m的值绝对相等。所以我们按照余数来建立子集,当子集大小大于k时有解。
#include <iostream>#include <fstream>#include <cstdio>#include <cstring>#include <queue>#include <stack>#include <vector>#include <map>#include <set>#include <cmath>#include <algorithm>#include <functional>#define inf 0x7fffffffusing namespace std;typedef long long ll;const int MAXN=1e5+10;const int MAX=1e5+10;const double eps=1e-6;int n,k,m;int s[MAX];vector<int>ans[MAX];int main(){ #ifdef ONLINE_JUDGE #else freopen("in.txt","r",stdin); //freopen("out.txt","w",stdout); #endif cin>>n>>k>>m; int flag=0; for(int i=0;i<n;i++){ scanf("%d",&s[i]); ans[s[i]%m].push_back(s[i]); } for(int i=0;i<m;i++){ if(ans[i].size()>=k){ cout<<"Yes"<<endl; for(int j=0;j<k;j++){ if(j==0) cout<<ans[i][j]; else cout<<" "<<ans[i][j]; } cout<<endl; flag++; break; } } if(!flag){ cout<<"No"<<endl; } return 0; }
- codeforces876B
- codeforces876B Divisiblity of Differences
- Codeforces876B-Divisiblity of Differences
- 内存泄漏
- C++二叉树实现+遍历
- ActiveMQ中遇到的问题
- Linux进程间通信——管道
- 构造,拷贝构造的N种调用情况
- codeforces876B
- 解决虚拟机CentOS7虚拟机无法上网
- android导入vCard联系人流程
- 【图像处理】人眼区域分割(1)
- 自定义Selector篇,改变样式,绘制图案和背景
- SQL 中replace函数的用法
- 正质因数分解
- [分治 Floyd] 计蒜之道2016复赛 .百度地图的实时路况
- 7 场 AI 技术专题,开发者必看!