Submission

PPPPPPPPPP

Score: 100

User: PakinDioxide

Problemset: ถังดักนิวทริโน

Language: cpp

Time: 0.002 second

Submitted On: 2025-04-02 02:49:51

/*
    author  : PakinDioxide
    created : 02/04/2025 02:04
    task    : A2-007
*/
#include <bits/stdc++.h>
#define ll long long

using namespace std;

vector <int> adj[305];
int co[305], dep[305];

void dfs(int u) {
    for (auto v : adj[u]) {
        dep[v] = dep[u]+1;
        dfs(v);
        co[u] += co[v];
    }
}

pair <int, int> dfs2(int u, int mx) {
    if (co[u] != mx) return {-1, -1};
    int a = u, b = dep[u];
    for (auto v : adj[u]) {
        auto [x, y] = dfs2(v, mx);
        if (x == -1) continue;
        if (y > b) a = x, b = y;
    }
    return make_pair(a, b);
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int n, m;
    cin >> n >> m;
    int par[n+1];
    iota(par, par+n+1, 0);
    pair <int, int> a[n+1];
    for (int i = 1; i <= n; i++) cin >> a[i].first >> a[i].second;
    for (int i = 1; i <= n; i++) {
        for (int j = i+1; j <= n; j++) {
            if (a[j].second > a[i].second) break;
            par[j] = i;
        }
    }
    for (int i = 1; i <= n; i++) {
        if (i == par[i]) continue;
        adj[par[i]].emplace_back(i);
    }
    for (int i = 0; i < m; i++) {
        int x;
        cin >> x;
        co[x] = 1;
    }
    vector <int> ans;
    for (int i = 1; i <= n; i++) if (par[i] == i) {
        dfs(i);
        if (co[i] == 0) continue;
        ans.emplace_back(dfs2(i, co[i]).first);
    }
    cout << ans.size() << '\n';
    sort(ans.begin(), ans.end());
    for (auto &e : ans) cout << e << ' ';
    cout << '\n';
}