Submission #942947

#	Time	Username	Problem	Language	Result	Execution time	Memory
942947		Baizho	Railway (BOI17_railway)	C++14	100 / 100	308 ms	53184 KiB

railway

#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
 
// #pragma GCC optimize("Ofast,unroll-loops,fast-math")
// #pragma GCC target("popcnt,sse3,avx")
 
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
 
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
 
const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353;  // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(1e5)+100;
const int M = ll(2e5) + 100;
const long long inf = 5e18;
//const long double eps = 1e-15L;
 
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }
 
ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}
 
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }

int n, m, k, a[N], b[N], cnt[N], siz[N];
map<pair<int, int>, int> id;
map<int, int> mp[N];
vector<int> g[N], que[N];


void dfs(int v, int p = 0) {
    for(auto i : que[v]) {
        mp[v][i] ++;
        if(mp[v][i] == siz[i]) mp[v].erase(i);
    }
    for(auto to : g[v]) {
        if(to == p) continue;
        dfs(to, v);
        cnt[id[{v, to}]] += mp[to].size();
        if(mp[v].size() < mp[to].size()) swap(mp[v], mp[to]);
        for(auto x : mp[to]) {
            mp[v][x.ff] += x.ss;
            if(mp[v][x.ff] == siz[x.ff]) mp[v].erase(x.ff);
        }
    }
}


void Baizho() {
    cin>>n>>m>>k;
    for(int i = 1; i <= n - 1; i ++) {
        cin>>a[i]>>b[i];
        id[{a[i], b[i]}] = id[{b[i], a[i]}] = i;
        g[a[i]].pb(b[i]);
        g[b[i]].pb(a[i]);
    }
    for(int i = 1; i <= m; i ++) {
        cin>>siz[i];
        for(int j = 1; j <= siz[i]; j ++) {
            int si; cin>>si;
            que[si].pb(i);
        }
    }
    dfs(1);
    vector<int> ans;
    for(int i = 1; i <= n; i ++) {
        if(cnt[i] >= k) ans.pb(i);
    }
    cout<<ans.size()<<"\n";
    for(auto x : ans) cout<<x<<" ";

}
 
signed main() {		
// 	Freopen("nondec");
    ios_base::sync_with_stdio(false);   
    cin.tie(0);cout.tie(0); 
//   	precalc();
   	
    int ttt = 1;
   // cin>>ttt;
 
    for(int i=1; i<=ttt; i++) {Baizho(); }
}

Compilation message (stderr)

railway.cpp: In function 'void Freopen(std::string)':
railway.cpp:35:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
railway.cpp:35:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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