Submission #1004297

#	Time	Username	Problem	Language	Result	Execution time	Memory
1004297		vjudge1	Railway (BOI17_railway)	C++17	0 / 100	838 ms	524288 KiB

railway

#pragma GCC optimize("-O3")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define vl vector<ll>
#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define pb push_back
#define p_b pop_back
#define f first
#define s second
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
const ll sz = 1e5+5;
vl g[sz];
set<ll>st[sz], st1[sz], st2[sz];
ll vis[sz], lev[sz];
void dfs(ll node)
{
    vis[node] = 1;
    for(auto u : st[node])
        st1[node].insert(u);
    for(auto u : g[node])
    {
        if(vis[u])
            continue;
        for(auto h : st1[node])
            st1[u].insert(h);
        lev[u] = lev[node] + 1;
        dfs(u);
    }
}
void dfs2(ll node)
{
    vis[node] = 1;
    for(auto u : st[node])
        st2[node].insert(u);
    for(auto u : g[node])
    {
        if(vis[u])
            continue;
        dfs2(u);
        for(auto h : st2[u])
            st2[node].insert(h);
    }
}
void solve()
{
    ll n, m, k, i, j;
    cin >> n >> m >> k;
    ll q = k;
    vector<pll>vect;
    for(i = 1; i <= n - 1; i++)
    {
        ll x, y;
        cin >> x >> y;
        g[x].pb(y);
        g[y].pb(x);
        vect.pb({x, y});
    }
    for(i = 1; i <= m; i++)
    {
        ll s;
        cin >> s;
        for(j = 1; j <= s; j++)
        {
            ll x;
            cin >> x;
            st[x].insert(i);
        }
    }
    dfs(1);
    for(i = 1; i <= n; i++)
        vis[i] = 0;
    dfs2(1);
    vl f;
    for(i = 0; i < vect.size(); i++)
    {
        ll x = vect[i].f, y = vect[i].s;
        if(lev[x] > lev[y])
            swap(x, y);
        set<ll>s;
        for(auto u : g[x])
        {
            if(u != y)
            {
                for(auto h : st2[u])
                    s.insert(h);
            }
        }
        for(auto u : st[x])
            s.insert(u);
        for(auto u : st1[x])
            s.insert(u);
        ll cnt = 0;
        for(auto u : st2[y])
        {
            ll sz = s.size();
            s.insert(u);
            if(sz == s.size())
                cnt++;
        }
        if(cnt >= q)
            f.pb(i+1);
    }
    sort(all(f));
    cout << f.size() << "\n";
    for(auto u : f)
        cout << u << ' ';
    cout << "\n";
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    ll tests = 1;
    //cin >> tests;
    while(tests--)
    {
        solve();
    }
}

Compilation message (stderr)

railway.cpp: In function 'void solve()':
railway.cpp:83:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |     for(i = 0; i < vect.size(); i++)
      |                ~~^~~~~~~~~~~~~
railway.cpp:106:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::set<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  106 |             if(sz == s.size())
      |                ~~~^~~~~~~~~~~

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