MX Day 6

#include <bits/stdc++.h>
using namespace std;
// #define int long long
inline int read()
{
    int x = 0, f = 1;
    char ch = getchar();
    while (!isdigit(ch))
    {
        if (ch == '-')
            f = -1;
        ch = getchar();
    }
    while (isdigit(ch))
    {
        x = x * 10 + ch - 48;
        ch = getchar();
    }
    return x * f;
}
int p[309], q[309], r[309];
int n, a[209], m;
bool dp[109][109][309];
vector<pair<int, int>> mp[309];
signed main()
{
    freopen("a.in", "r", stdin);
    freopen("a.out", "w", stdout);
    m = read();
    for (int i = 1; i <= m; i++)
    {
        p[i] = read();
        q[i] = read();
        r[i] = read();
        mp[p[i]].push_back(make_pair(q[i], r[i]));
        // mp[q[i]][r[i]][++mpl[q[i]][r[i]]] = p[i];
    }
    n = read();
    for (int i = 1; i <= n; i++)
    {
        a[i] = read();
        dp[i][i][a[i]] = 1;
    }
    // cout << "m=" << m << " n=" << n << endl;
    for (int len = 2; len <= n; len++)
    {
        for (int i = 1; i <= n - len + 1; i++)
        {
            int j = i + len - 1;
            for (int k = i + 1; k <= j; k++)
            {
                for (int p = 1; p <= m; p++)
                {
                    for (auto [x, y] : mp[p])
                    {
                        dp[i][j][p] |= dp[i][k - 1][x] & dp[k][j][y];
                    }
                }
            }
        }
    }
    bool gg = 0;
    for (int i = 1; i <= m; i++)
    {
        if (dp[1][n][i])
        {
            cout << i << ' ';
            gg = 1;
        }
    }
    if (!gg)
    {
        cout << -1;
    }
    return 0;
}