题解 | #小红结账#

暴力

#include <iostream>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <iomanip>
#include <stack>
#include <numeric>
#include <ctime>
#include <string>
#include <bitset>
#include <unordered_map>
#include <unordered_set>

using namespace std;
using ll = long long;
const ll N = 1e5 + 5, mod = 1e9 + 7, inf = 2e18;

int n, m;
ll a[N];

void solve() {
    cin >> n >> m;
    while (n--) {
        ll k, c, pos;
        cin >> k >> c;
        ll vlu = ceil(c * 1.0 / k);
        k--;

        while (k--) {
            cin >> pos;
            a[pos] += vlu;
        }
    }
    for (int i = 1; i <= m; i++) {
        cout << a[i] << " ";
    }
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int t = 1;
    //cin >> t;

    while (t--) {

        solve();

    }

    return 0;
}