Submission #65026460

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <array>
#include <cassert>
#include <map>
#include <iomanip>
#include <set>
#include <cmath>
#include <queue>
#include <algorithm>
#include <numeric>
#include <bitset>
#include <stack>
#include <climits>
#include <cstring>
#include <functional>
const long long N = 1e9;
#define nl '\n'
template <typename Array>
void printarray (const Array &arr) {
    for(auto&i : arr) {
        std::cout << i << " \n"[&i == &(*arr.rbegin())];
    }
}
using std:: cout;       using std:: cin;        using std:: vector;     using std:: map;
using std:: queue;      using std:: string;     using std:: array;      using std:: pair;    

void solve() {
    int n , m;
    cin >> n >> m;
    vector<vector<int>> arr(m);
    vector<pair<int,int>> vec(n);

    for(int i = 0; i < m; ++i) {
        int t;
        cin >> t;
        while(t--) {
            int x;
            cin >> x;
            arr[i].push_back(x);
        }
    }
    for(int p = 0; auto& [x , y] : vec) {
        cin >> x;
        y = p++;
    }

    sort(vec.begin(), vec.end());
    // for(auto [x , y] : vec) {
    //     std::cerr << x << ' ' << y << nl;
    // }
    vector<int> ans(n + 1, 0);
    for(int i = 0; i < m; ++i) {
        int max = 0;
        for(auto& j : arr[i]) {
            max = std::max(max, vec[j - 1].second);
        }
        ans[max] ++;
    }
    int sum = 0;
    for(int i = 0; i < n; ++i) {
        sum += ans[i];
        cout << sum << nl;
    }
}

int main() 
{
    cin.tie(nullptr) -> std:: ios:: sync_with_stdio(false);
    int T = 1;
    // cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}

Submission Info

Judge Result