QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #796210 | #5137. Tower | dongfangwuqing | WA | 15ms | 3872kb | C++14 | 1.1kb | 2024-12-01 14:19:50 | 2024-12-01 14:19:50 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n, m;
cin >> n >> m;
vector<long long> tower(n);
for (int i = 0; i < n; i++) { cin >> tower[i]; }
long long ans = 1e16;
for (int i = 0; i < n; i++) {
int ti = tower[i];
vector<long long> temp;
for (int j = 0; j < n; j++) {
long long res = 0;
if (tower[j] <= ti) {
res = ti - tower[j];
} else {
long long tj = tower[j];
while (tj / 2 >= ti) {
res++;
tj /= 2;
}
if (tj > ti) {
res += min(ti - tj / 2 + 1, tj - ti);
}
}
temp.push_back(res);
}
long long res = 0;
sort(temp.begin(), temp.end());
for (int i = 0; i < n - m; i++) { res += temp[i]; }
ans = min(ans, res);
}
cout << ans << "\n";
}
int main() {
int t;
cin >> t;
while (t--) {
solve();
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3616kb
input:
3 2 0 2 6 5 0 1 2 3 4 5 5 3 1 2 3 4 5
output:
2 4 1
result:
ok 3 number(s): "2 4 1"
Test #2:
score: 0
Accepted
time: 15ms
memory: 3640kb
input:
10 272 118 11 14 49 94 71 62 46 45 74 22 15 36 7 37 27 35 96 85 75 78 76 64 23 59 17 35 71 28 96 82 5 66 2 48 57 31 88 10 61 73 79 23 19 52 39 76 48 98 5 39 48 51 90 90 60 27 47 24 24 56 48 27 39 21 38 18 20 9 62 83 47 15 51 22 73 74 7 80 64 60 86 74 59 7 84 38 99 31 42 60 52 41 63 88 59 90 77 40 68...
output:
454 3 436 108 570 636 994 227 656 50
result:
ok 10 numbers
Test #3:
score: -100
Wrong Answer
time: 14ms
memory: 3872kb
input:
10 133 89 20 70 6 45 4 72 38 7 18 1 82 39 69 85 5 36 1 62 30 47 68 55 7 41 7 42 7 61 11 82 2 80 80 93 29 30 42 58 73 26 99 67 60 94 61 46 47 54 44 50 35 88 61 17 23 97 90 28 16 47 75 35 28 14 42 63 26 40 95 58 26 25 26 83 93 56 17 27 7 90 91 28 53 49 47 84 55 52 11 34 14 74 40 65 84 32 99 46 1 21 31...
output:
88 1361 128 246 29 83 3 677 97 382
result:
wrong answer 9th numbers differ - expected: '96', found: '97'