# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
750149 | MrM7md | Zalmoxis (BOI18_zalmoxis) | C++14 | 242 ms | 93312 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define endl '\n'
#define F first
#define S second
#define pb push_back
#define all(a) a.begin(),a.end()
const int N=1e6+500;
const int off=(1<<18);
const int MOD = 1e9+7;
vector<vector<int>>kk(N),ans(N);
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n,k;
cin >> n >> k;
vector<array<int,3>> a(n);
for(int i=0;i<n;i++){
cin >> a[i][0];
a[i][1]=a[i][2]=i;
}
vector<array<int,3>>v=a;
for(int i=0;i<=29;i++){
vector<array<int,3>>t;
for(int j=0;j<v.size();j++){
if(j+1<v.size()&&v[j][0]==v[j+1][0]&&v[j][0]==i){
t.pb({v[j][0]+1,v[j][1],v[j+1][2]});
j++;
}
else if(v[j][0]==i){
t.pb({v[j][0]+1,v[j][1],v[j][2]});
kk[v[j][2]].pb(v[j][0]);
k--;
}
else{
t.pb(v[j]);
}
}
v=t;
}
for(int i=0;i<n;i++){
for(auto it:kk[i]){
ans[i].pb(it);
while(k>0&&ans[i].back()>0){
int x=ans[i].back()-1;
ans[i].pop_back();
ans[i].pb(x),ans[i].pb(x);
k--;
}
}
}
int id=0;
for(int i=0;i<n;i++){
cout<<a[i][0]<<' ';
for(auto it:ans[i])cout<<it<<' ';
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |