QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#797622 | #9423. Gold Medal | boringhacker | WA | 1ms | 1688kb | C11 | 1.2kb | 2024-12-03 15:12:16 | 2024-12-03 15:12:17 |
Judging History
answer
#include <stdio.h>
#include <sys/time.h>
#define N 100
unsigned int Z;
int rand_()
{
return (Z *= 3) >> 1;
}
void srand_()
{
struct timeval tv;
gettimeofday(&tv, NULL);
Z = tv.tv_sec ^ tv.tv_usec | 1;
}
int k;
int compare(int i, int j) {
return (i + k - 1) / k * k - i - (j + k - 1) / k * k + j;
}
void sort(int *ii, int l, int r) {
while (l < r) {
// [l, i): <
// [i, j): =
// [k, r): >
int i = l, j = l, k = r, pivot = ii[l + rand_() % (r - l)], tmp;
while (j < k) {
int c = compare(ii[j], pivot);
if (c == 0)
j++;
else if (c < 0) {
tmp = ii[i], ii[i] = ii[j], ii[j] = tmp;
i++, j++;
} else {
--k;
tmp = ii[k], ii[k] = ii[j], ii[j] = tmp;
}
}
sort(ii, l, i);
l = k;
}
}
int main() {
int n, t, m;
int i;
static int aa[N];
scanf("%d", &t);
while (t--) {
long long ans = 0;
scanf("%d%d", &n, &k);
for (i = 0; i < n; ++i)
scanf("%d", aa + i);
scanf("%d", &m);
sort(aa, 0, n);
for (i = 0; i < n; ++i) {
int h = (aa[i] + k - 1) / k * k - aa[i];
if (m >= h)
aa[i] += h;
}
for (i = 0; i < n; ++i)
ans += aa[i] / k;
printf("%lld\n", ans + m / k);
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 1688kb
input:
2 3 10 239 141 526 6 2 1 300 100 1000
output:
91 1400
result:
ok 2 lines
Test #2:
score: -100
Wrong Answer
time: 1ms
memory: 1656kb
input:
100 39 88 746 86884 628655 868 87506 46761498 3338 91952768 312 9712 5277106 2263554 246545 98849 91459 6 5506 4 17626 5984050 32079 10 7672277 8104250 62 8976 866448 1 4 62240996 93128 181 6 9 5 175665 9 7680943 81 239822 9 200383 53147 17 82509 3 617847780 418677763 5402536 16 38253558 79857 66 60...
output:
2734476 5390 65 0 66483181 44507 54 0 166366083 76709 114876538 0 13172 1427237725 12532 19439 0 35669 4 266 34841133 731790829 61 11 0 51508708 2 262191 175 6286240839 0 1045 293089 167116 4 141328 455003478 86185519 14 1963 11 491358 163 9033 3869760302 14424354 31849 560672 133717 6261 99 11995 2...
result:
wrong answer 1st lines differ - expected: '2734453', found: '2734476'