📦 ved015 / Codeforces-solution

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#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
using namespace std;
typedef long long ll;

int main(){
    int t;
    cin >> t;
    while(t--){
        ll n;
        cin >> n;
        map<ll, vector<ll> > teams;
        vector<ll> universities(n);
        
        for(int i = 0; i < n; i++){
            cin >> universities[i];
        }

        for(int i = 0; i < n; i++){
            ll a;
            cin >> a;
            teams[universities[i]].push_back(a);
        }
        
        map<ll, vector<ll> > prefix_sums;
        for(auto &it : teams){
            vector<ll> &temp = it.second;
            sort(temp.rbegin(), temp.rend());
            
            for(int i = 1; i < temp.size(); i++){
                temp[i] += temp[i - 1];
            }
            
            prefix_sums[it.first] = temp;
        }

        vector<ll> result(n + 1, 0);
        for(auto &it : prefix_sums){
            vector<ll> &prefix = it.second;
            ll size = prefix.size();
            
            for(int k = 1; k <= size; k++){
                result[k] += prefix[size - (size % k) - 1];
            }
        }

        for(int k = 1; k <= n; k++){
            cout << result[k] << " ";
        }
        cout << endl;
    }
    return 0;
}