/*
ЗАПУСКАЕМ
░ГУСЯ░▄▀▀▀▄░РАБОТЯГУ░░
▄███▀░◐░░░▌░░░░░░░
░░░░▌░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░▄▀▒▒▀▀▀▀▄
░░░▐░░░░▐▒▒▒▒▒▒▒▒▀▀▄
░░░▐░░░░▐▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░▀▄░░░░▀▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░░░▀▄▄▄▄▄█▄▄▄▄▄▄▄▄▄▄▄▀▄
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░▄▄▌▌▄▌▌░░░░░
*/
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
using namespace std;
template<typename T1, typename T2>inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; }
template<typename T1, typename T2>inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; }
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const pair<T, U> &_p) { _out << _p.first << ' ' << _p.second; return _out; }
template<typename T, typename U> inline istream &operator>> (istream &_in, pair<T, U> &_p) { _in >> _p.first >> _p.second; return _in; }
template<typename T> inline ostream &operator<< (ostream &_out, const vector<T> &_v) { if (_v.empty()) { return _out; } _out << _v.front(); for (auto _it = ++_v.begin(); _it != _v.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline istream &operator>> (istream &_in, vector<T> &_v) { for (auto &_i : _v) { _in >> _i; } return _in; }
template<typename T> inline ostream &operator<< (ostream &_out, const set<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const multiset<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const unordered_set<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const unordered_multiset<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const map<T, U> &_m) { if (_m.empty()) { return _out; } _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')'; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << ", (" << _it->first << ": " << _it->second << ')'; } return _out; }
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const unordered_map<T, U> &_m) { if (_m.empty()) { return _out; } _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')'; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << ", (" << _it->first << ": " << _it->second << ')'; } return _out; }
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define left left228
#define right right228
#define next next228
#define rank rank228
#define prev prev228
#define y1 y1228
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define files(FILENAME) read(FILENAME), write(FILENAME)
#define pb push_back
const string FILENAME = "input";
const int MAXN = 2000001;
int n, k;
int a[MAXN];
vector<int> g[MAXN];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
//read(FILENAME);
cin >> n >> k;
vector<pair<int, pair<int, int> > > st;
for (int i = 0; i < n; i++) {
cin >> a[i];
st.pb({a[i], {i, i}});
}
for (int t = 1; t <= 29; t++) {
vector<pair<int, pair<int, int> > > st1;
for (int i = 0; i < sz(st); i++) {
if (st1.empty()) {
st1.pb(st[i]);
continue;
}
if (st[i].first == t) {
if (st1.back().first == t) {
st1.back().first++;
st1.back().second.second = st[i].second.second;
} else {
st1.pb(st[i]);
}
} else {
if (st1.back().first == t) {
st1.back().first++;
k--;
g[st1.back().second.second].pb(t);
}
st1.pb(st[i]);
}
}
if (st1.back().first == t) {
st1.back().first++;
k--;
g[st1.back().second.second].pb(t);
}
st = st1;
}
vector<int> ans;
for (int i = 0; i < n; i++) {
ans.pb(a[i]);
for (auto x: g[i]) {;
if (k) {
int cur = x;
for (int t = x - 2; t >= 0; t--) {
if (k >= (1 << t)) {
cur--;
for (int j = 0; j < (1 << t); j++) {
ans.pb(cur - t);
}
k -= (1 << t);
if (k == 0) {
break;
}
}
}
ans.pb(cur);
} else {
ans.pb(x);
}
}
}
for (int i = 0; i < sz(ans); i++) {
cout << ans[i] << ' ';
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
900 ms |
102740 KB |
Expected EOF |
| 2 |
Incorrect |
764 ms |
102740 KB |
Expected EOF |
| 3 |
Execution timed out |
1043 ms |
102740 KB |
Time limit exceeded |
| 4 |
Incorrect |
779 ms |
102740 KB |
Expected EOF |
| 5 |
Incorrect |
735 ms |
102740 KB |
Expected EOF |
| 6 |
Incorrect |
890 ms |
108820 KB |
Expected EOF |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
810 ms |
108820 KB |
Expected EOF |
| 2 |
Incorrect |
871 ms |
108820 KB |
Expected EOF |
| 3 |
Incorrect |
650 ms |
108820 KB |
Expected EOF |
| 4 |
Incorrect |
634 ms |
108820 KB |
Expected EOF |
| 5 |
Incorrect |
747 ms |
108820 KB |
Expected EOF |
| 6 |
Incorrect |
738 ms |
108820 KB |
Expected EOF |
| 7 |
Incorrect |
853 ms |
108820 KB |
Expected EOF |
| 8 |
Incorrect |
756 ms |
108820 KB |
Expected EOF |
| 9 |
Incorrect |
818 ms |
108820 KB |
Expected EOF |
| 10 |
Incorrect |
295 ms |
108820 KB |
not a zalsequence |
| 11 |
Incorrect |
635 ms |
108820 KB |
Expected EOF |
| 12 |
Incorrect |
190 ms |
108820 KB |
not a zalsequence |
| 13 |
Incorrect |
138 ms |
108820 KB |
not a zalsequence |
| 14 |
Correct |
158 ms |
108820 KB |
Output is correct |
