题解 | #小红结账#

按题意模拟即可。

#include<bits/stdc++.h>
#define int long long
#define double long double
#define x first
#define y second
using namespace std;
typedef long long LL;
typedef long long ll;
typedef pair<int, int> PII;
const int N = 3e5 + 10;
const int M = 1e3 + 10;
int mod = 1e9 + 7;
int a[N];

void solve() {
    int n, m;
    cin >> n >> m;
    map<int, int>mp;
    for (int i = 1; i <= n; i++) {
        int k, c;
        cin >> k >> c;
        int sp = (c + k - 1) / k;
        for (int j = 1; j <= k - 1; j++) {
            int x;
            cin >> x;
            mp[x] += sp;
        }
    }
    for(int i=1;i<=m;i++) cout<<mp[i]<<" ";
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int _;
    _ = 1;
    //cin>>_;
    while (_--) {
        solve();
    }
}