#include <bits/stdc++.h>
using namespace std;
#define ort ((bas+son)/2)
#define int long long
#define endl "\n"
#define pb push_back
#define fi first
#define se second
int n,k,a[1000005];
vector<int> v[35];
int32_t main(void){
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
cin>>n>>k;
multiset<pair<int,int>> ekle;
for(int i=1;i<=n;i++){
cin>>a[i];
v[a[i]].pb(i);
//~ ekle.insert({a[i],i});
}
//~ cout<<"**\n";
for(int i=0;i<30;i++){
int siz=v[i].size();
if(siz%2==0){
for(int j=siz/2;j<siz;j++)v[i+1].pb(v[i][j]);
v[i].clear();
}
else{
//~ cout<<i<<" ()())(()() \n";
ekle.insert({i,v[i][0]});
for(int j=siz/2;j<siz;j++)v[i+1].pb(v[i][j]);
v[i].clear();
}
}
//~ cout<<"**\n";
while((int)ekle.size()<k){
auto it=ekle.end();
it--;
int val=it->fi;
int ind=it->se;
ekle.erase(it);
val--;
ekle.insert({val,ind});
ekle.insert({val,ind});
}
vector<pair<int,int>> ans;
while(ekle.size()){
auto it=ekle.begin();
ans.pb({it->se,it->fi});
//~ cout<<it->se<<" ()() "<<it->fi<<endl;
ekle.erase(it);
}
sort(ans.begin(),ans.end());
int sayac=0;
int sizz=ans.size();
for(int i=1;i<=n;i++){
cout<<a[i]<<" ";
while(sayac<sizz && ans[sayac].fi==i){cout<<ans[sayac].se<<" ";sayac++;}
}
cout<<endl;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
100 ms |
28016 KB |
not a zalsequence |
2 |
Incorrect |
101 ms |
28272 KB |
not a zalsequence |
3 |
Incorrect |
99 ms |
28356 KB |
not a zalsequence |
4 |
Incorrect |
98 ms |
28228 KB |
not a zalsequence |
5 |
Incorrect |
100 ms |
28576 KB |
not a zalsequence |
6 |
Incorrect |
100 ms |
28792 KB |
not a zalsequence |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
106 ms |
27880 KB |
not a zalsequence |
2 |
Incorrect |
100 ms |
29244 KB |
not a zalsequence |
3 |
Incorrect |
101 ms |
27972 KB |
not a zalsequence |
4 |
Incorrect |
98 ms |
28372 KB |
not a zalsequence |
5 |
Incorrect |
100 ms |
29424 KB |
not a zalsequence |
6 |
Incorrect |
98 ms |
30304 KB |
not a zalsequence |
7 |
Incorrect |
106 ms |
28628 KB |
not a zalsequence |
8 |
Incorrect |
103 ms |
28532 KB |
not a zalsequence |
9 |
Incorrect |
152 ms |
41448 KB |
not a zalsequence |
10 |
Incorrect |
369 ms |
71484 KB |
not a zalsequence |
11 |
Incorrect |
258 ms |
55316 KB |
not a zalsequence |
12 |
Incorrect |
462 ms |
82228 KB |
not a zalsequence |
13 |
Incorrect |
478 ms |
81628 KB |
not a zalsequence |
14 |
Correct |
451 ms |
82328 KB |
Output is correct |