# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
64052 | Just_Solve_The_Problem | Zalmoxis (BOI18_zalmoxis) | C++11 | 236 ms | 6480 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;
const int N = (int)1e6 + 7;
const int inf = (int)1e9 + 7;
int n, k;
int a[N];
map < int, int > cnt;
main() {
scanf("%d %d", &n, &k);
if (k != 1) {
return 0;
}
int mn = inf;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
mn = min(mn, a[i]);
cnt[a[i]]++;
}
int cur = -1;
while (1) {
if (cnt[mn] & 1) {
cur = mn;
break;
}
cnt[mn + 1] += cnt[mn] / 2;
cnt[mn] = 0;
mn++;
}
for (int i = 1; i <= n; i++) {
if (a[i] <= cur) {
if (cur != -1) {
printf("%d ", cur);
cur = -1;
}
}
printf("%d ", a[i]);
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |