Submission #223748

#	Time	Username	Problem	Language	Result	Execution time	Memory
223748		johutha	Railway (BOI17_railway)	C++17	0 / 100	137 ms	4584 KiB

railway

#include <iostream>
#include <vector>
#include <algorithm>

#define int int64_t

using namespace std;

struct tree
{
    vector<int> adjlist;
};

signed main()
{
    int n, m, k;
    cin >> n >> m >> k;
    if (m == k)
    {
        vector<int> nr(n);
        vector<pair<int,int>> edg;
        for (int i = 0; i < n - 1; i++)
        {
            int a, b;
            a--; b--;
            cin >> a >> b;
            edg.emplace_back(a, b);
        }
        for (int i = 0; i < m; i++)
        {
            int cnt;
            cin >> cnt;
            for (int l = 0; l < cnt; l++)
            {
                int a;
                a--;
                cin >> a;
                nr[a]++;
            }
        }
        vector<int> sol;
        for (int i = 0; i < n - 1; i++)
        {
            if (min(nr[edg[i].first], nr[edg[i].second]) == k) sol.push_back(i + 1);
        }
        cout << sol.size() << "\n";
        for (auto i : sol) cout << i << " ";
        cout << "\n";
    }
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 15
• Subtask 3: 0 / 7
• Subtask 4: 0 / 29
• Subtask 5: 0 / 16
• Subtask 6: 0 / 25