Learning-algorithm/Carrot_Chopdown_Hard_Version.cpp at main · YiHx/Learning-algorithm · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
using ll = long long;

void solve(){
    int n,m;
    cin>>n>>m;
    vector<ll> a(n);
    for (int i =0;i<n;i++) {
        cin>>a[i];
    }
    vector<ll> sf(m+2);
    for (int i =0;i<n;i++) {
        sf[a[i]]++;
    }

    for (int i =m;i>=1;i--) {
        sf[i-1] += sf[i];
    }


    long long sum =0;
    for (int i =0;i<n;i++) {
        sum+=a[i];
    }

    for (int k = 1;k<=m;k++) {
        ll ans = 0;
        if (k>=30 || (1LL<<k)>=m) {
            ans = sum;
        }else {
            for (ll x =1;x<= m / (1 << k)+1;x++) {
                ll now = 0;
                for (ll j =1 ;j<(1<< k)&&x*j<=m;j++) {
                    now+=sf[x*j];
                }
                if (x * (1<<k) <= m) {
                    now += sf[x * (1 << k)] - sf[x * (1 << k) + 1];
                }
                ans = max(ans,now);
            }
        }
        cout<<ans<<" ";
    }
    cout<<endl;
}
int main () {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int T =1;
    cin>>T;
    while(T--){
        solve();
    }
    return 0;
}