# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
68483 | Bruteforceman | Zalmoxis (BOI18_zalmoxis) | C++11 | 1102 ms | 118112 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;
int a[1000010];
vector <int> v[1000010];
int alive[1000010];
struct data {
int val, idx;
data (int val, int idx) : val(val), idx(idx) {}
data () {}
bool operator < (data p) const {
if(val == p.val) return idx < p.idx;
return val > p.val;
}
};
int main(int argc, char const *argv[])
{
int n, k;
scanf("%d %d", &n, &k);
for(int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
alive[i] = 1;
v[i].emplace_back(a[i]);
}
int sz = n;
set <int> s;
priority_queue <data> Q;
for(int i = 1; i <= n; i++) {
Q.emplace(a[i], i);
s.insert(i);
}
while(sz < n + k) {
while(alive[Q.top().idx] == 0) {
Q.pop();
}
int opt = Q.top().idx;
Q.pop();
if(a[opt] == 30) break;
int prev;
auto it = s.lower_bound(opt);
if(it == s.begin()) prev = -1;
else prev = *(--it);
if(prev == -1 || a[prev] > a[opt]) {
v[opt].emplace_back(a[opt]);
++a[opt];
++sz;
Q.emplace(a[opt], opt);
} else {
alive[prev] = 0;
s.erase(prev);
++a[opt];
Q.emplace(a[opt], opt);
}
}
for(int i = 1; i <= n; i++) {
vector <int> tmp;
while(v[i].size() > 1 && sz < n + k) {
if(v[i].back() > 0) {
int x = v[i].back();
v[i].pop_back();
v[i].emplace_back(x - 1);
v[i].emplace_back(x - 1);
++sz;
} else {
v[i].pop_back();
tmp.emplace_back(0);
}
}
for(auto j : tmp) {
v[i].emplace_back(j);
}
for(auto j : v[i]) {
printf("%d ", j);
}
}
printf("\n");
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |