Pagini recente » Cod sursa (job #419356) | Cod sursa (job #3159732) | concurs65652 | Cod sursa (job #2119555) | Cod sursa (job #581761)
Cod sursa(job #581761)
#include <cstdio>
typedef long long i64;
int n, m;
i64 k, l;
i64 d[100002];
int v[100002];
i64 tot;
int main()
{
freopen("progresii.in", "r", stdin);
freopen("progresii.out", "w", stdout);
scanf("%d %d %lld %lld", &n, &m, &k, &l);
for (int i = 1; i <= n; ++i)
{
scanf("%lld", d + i);
d[i] *= -1, d[i] += l;
tot += 1 + d[i] / m;
v[i] = m;
}
int step;
for (step = 1; (step << 1) <= m; step <<= 1);
for (int i = 1; i <= n ; ++i)
{
int val, stepx = step;
for (val = m + 1; stepx; stepx >>= 1)
if (val - stepx >= 1 && tot - d[i] / m + d[i] / (val - stepx) <= k)
val -= stepx;
if (val == m + 1) continue;
tot -= d[i] / m, tot += d[i] / val;
v[i] = val;
}
if (tot > k) printf("-1");
else
for (int i = 1; i <= n; ++i)
printf("%d\n", v[i]);
}