QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#246205#5137. TowerzyfyTL 2959ms4200kbC++232.6kb2023-11-10 17:16:092023-11-10 17:16:10

Judging History

你现在查看的是最新测评结果

  • [2023-11-10 17:16:10]
  • 评测
  • 测评结果:TL
  • 用时:2959ms
  • 内存:4200kb
  • [2023-11-10 17:16:09]
  • 提交

answer

#include <iostream>
#include <vector>
#include <queue>
#include <set>
#include<math.h>
#include<functional>
#include<stack>
#include <algorithm>
#include<unordered_map>
#include <map>
#include<numeric>
#define inf 0x7fffffff
using namespace std;
const int N = 1e6 + 6;
const int mod = 1e9 + 7;

inline int f(int x, int final) {
    if(x <= final) {
        return final - x;
    } else {
        int res = x - final,cnt=0;
        while(x) {
            x /= 2;
            cnt++;
            res = min(res, abs(x - final) + cnt);
        }
        return res;
    }
}

void solve() {
	int n, m; cin >> n >> m;
    map<int, int>mp;
    vector<int>a(n + 1);
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    int ans = 1e9;
    for(int i = 1; i <= n; i++) {
        int mx = a[i];
        while(mx > 1) {
            if(mp[mx]) {
                break;
            }
            priority_queue<int>q1,q2,q3;
            int res1 = 0,res2=0,res3=0;
            for(int i = 1; i <= n; i++) {
                q1.push(f(a[i], mx)); 
            }
            for(int i = 1; i <= m; i++) {
                q1.pop();
            }
            while(q1.size()) {
                res1 += q1.top();q1.pop();
            }
            for(int i = 1; i <= n; i++) {
                q2.push(f(a[i], mx + 1)); 
            }
            for(int i = 1; i <= m; i++) {
                q2.pop();
            }
            while(q2.size()) {
                res2 += q2.top();q2.pop();
            }
            for(int i = 1; i <= n; i++) {
                q3.push(f(a[i], mx - 1)); 
            }
            for(int i = 1; i <= m; i++) {
                q3.pop();
            }
            while(q3.size()) {
                res3 += q3.top();q3.pop();
            }
            ans = min(ans, min({res1,res2,res3}));
            mp[mx] = 1;
            mp[mx+1]=1;
            mp[mx-1]=1;
            mx /= 2;
        }
    }
    cout << ans << '\n';
}
 
signed main()
{
    cin.tie(0)->sync_with_stdio(false);
    int q = 1;
    cin >> q;
    for (int i = 1; i <= q; i++)
    {
        solve();
    }
}



// function<void(int, int)> dfs = [&] (int u, int parent) {
//     // cerr << "u = " << u << " parent = " << parent << "\n";
//     stf[u][0] = parent;
//     vis[u] = 1;
//     stmax[u][0] = max(h[u], h[parent]);
//     for(int v : adj[u]) {
//         if(v == parent) continue;
//         dep[v] = dep[u] + 1;
//         dfs(v, u);
//     }
// };

// int find(int x) {
//     if(fa[x] == x) return x;
//     return fa[x] = find(fa[x]); 
// }

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3816kb

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: 13ms
memory: 3560kb

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: 0
Accepted
time: 13ms
memory: 3640kb

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
96
382

result:

ok 10 numbers

Test #4:

score: 0
Accepted
time: 35ms
memory: 3836kb

input:

10
500 50
67 93 11 58 54 40 37 3 92 96 91 20 46 5 21 43 3 2 7 47 27 81 14 53 86 21 46 51 86 22 42 14 52 38 42 25 34 29 84 42 43 96 11 100 27 60 48 15 13 69 58 16 14 58 17 94 8 71 39 38 25 37 100 58 99 56 65 84 94 63 25 34 13 73 83 83 69 60 70 15 15 90 7 11 88 69 13 26 99 28 16 97 32 40 76 62 41 5 9 ...

output:

1608
169
144
983
1087
1317
882
75
32
1259

result:

ok 10 numbers

Test #5:

score: 0
Accepted
time: 317ms
memory: 3608kb

input:

10
500 414
503 505 103 380 946 153 952 386 890 306 522 147 499 784 643 121 264 344 549 72 299 314 45 688 97 747 442 528 752 830 335 78 159 218 748 331 259 375 479 883 202 402 595 738 430 184 874 762 864 743 733 209 821 616 868 543 314 161 100 638 439 943 732 962 243 776 803 423 749 367 731 594 993 9...

output:

338
2653
2857
809
1626
332
1328
490
1044
854

result:

ok 10 numbers

Test #6:

score: 0
Accepted
time: 1312ms
memory: 3712kb

input:

10
500 497
4249 4173 5055 5942 4090 1754 1523 5273 758 3522 8827 3775 6331 2729 8699 8797 5977 5435 6320 9188 5889 6562 9809 7595 6104 7480 2116 8715 2823 1990 425 5811 3347 2618 6119 3948 7172 7095 8017 5943 2036 87 6661 2099 885 3035 3745 8362 3919 2675 1314 8123 7254 328 106 2546 7540 9303 4333 9...

output:

1
2260
3254
4965
2322
2422
4862
1174
3671
877

result:

ok 10 numbers

Test #7:

score: 0
Accepted
time: 2959ms
memory: 4200kb

input:

10
500 425
62346 35359 49386 37821 13178 34961 89198 87150 5961 67958 2778 83160 89447 17663 63690 96481 48566 27701 64933 35987 44454 52207 22761 72984 57775 88898 28120 4798 93898 2808 185 49754 67340 4153 38477 14377 97568 57830 78927 11857 44320 71781 62631 7685 42960 80182 69195 31752 95159 311...

output:

762
548
2235
505
1333
5729
5820
3724
4260
2803

result:

ok 10 numbers

Test #8:

score: -100
Time Limit Exceeded

input:

10
500 343
3979933 4977754 3585357 8727522 1167921 850266 4372205 6136332 1208124 9005074 1888230 1818841 5532232 8097244 9323282 2862526 1081283 5639323 3113788 3478923 6969022 3572708 8591079 9223149 25281 7629530 7701175 2406412 8085960 4273048 6252416 7216852 310879 1781062 1016170 6154578 21346...

output:


result: