zoukankan      html  css  js  c++  java
  • codeforces 876B

    B. Divisiblity of Differences
    time limit per test
    1 second
    memory limit per test
    512 megabytes
    input
    standard input
    output
    standard output

    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

    比赛前一天还做过类似的题。。。结果当时愣是卡住了。。。气死我了
    解题思路:
    用数组记录每个数对m取模余数相等的有多少个。。
    ac代码:
     1 #include <cstdio>
     2 #include <cstring>
     3 #include <iostream>
     4 #include <algorithm>
     5 using namespace std;
     6 const int maxn = 1e5+5;
     7 int nu[maxn];
     8 int cnt[maxn];
     9 int main() {
    10     ios::sync_with_stdio(false);
    11     int n,k,m,i;
    12     cin>>n>>k>>m;
    13     for(i=1;i<=n;++i) {
    14         cin>>nu[i];
    15     }
    16     int ans=-1;
    17     for(i=1;i<=n;++i) {
    18         int u=nu[i]%m;
    19         ++cnt[u];
    20         if(cnt[u]==k) {
    21             ans=u;
    22             break;
    23         }
    24     }
    25     if(ans==-1) cout<<"No"<<endl;
    26     else {
    27         cout<<"Yes"<<endl;
    28         for(int i=1;i<=n;++i) {
    29             if(nu[i]%m==ans) {
    30                 --k;
    31                 cout<<nu[i]<<" ";
    32             }
    33             if(k==0) break;
    34         }
    35     }
    36     return 0;
    37 }
    View Code
  • 相关阅读:
    Python mutilprocessing Processing 父子进程共享文件对象?
    BZOJ4836: [Lydsy1704月赛]二元运算
    博弈论刷题记录
    manacher(无讲解)
    UOJ_407_【IOI2018】狼人
    BZOJ_3935_Rbtree
    dsu on tree(无讲解)
    BZOJ_3744_Gty的妹子序列
    后缀数组(无讲解)
    虚树(无讲解)
  • 原文地址:https://www.cnblogs.com/zmin/p/7683659.html
Copyright © 2011-2022 走看看