Jamie and Binary Sequence (changed after round) - CodeForces 916B

http://codeforces.com/problemset/problem/916/B

好尬啊。。。

 #include<cstdio>
 #include<algorithm>
 #include<cstring>
 #include<vector>
 #include<map>
 using namespace std;
 #define fi first
 #define se second
 #define mp make_pair
 #define pb push_back
 typedef long long ll;
 typedef unsigned long long ull;
 typedef pair<int,int> pi;
 ll n,K;
 map<ll,ll> dd;
 int main()
 {
     ll i;
     scanf("%lld%lld",&n,&K);
     for(i=;n;n/=,i++)
         if(n%)
             dd[i]=n%;
     K-=dd.size();
     if(K<)
     {
         puts("No");
         return ;
     }
     puts("Yes");
     while(K)
     {
         auto p=*dd.rbegin();
         //printf("%d %d\n",p.fi,p.se);
         if(p.se<=K)
         {
             dd[p.fi-]+=p.se*;
             dd.erase(p.fi);
             K-=p.se;
         }
         else
         {
             while(K)
             {
                 K--;
                 auto p2=*dd.begin();
                 dd[p2.fi-]+=;
                 dd[p2.fi]--;
                 if(dd[p2.fi]==)    dd.erase(p2.fi);
             }
         }
     }
     for(auto it=dd.rbegin();it!=dd.rend();it++)
     {
         auto x=*it;
         for(i=;i<=x.se;i++)    printf("%lld ",x.fi);
     }
     return ;
 }