Submission #491071

#	Time	Username	Problem	Language	Result	Execution time	Memory
491071		Carmel_Ab1	Railway (BOI17_railway)	C++17	29 / 100	229 ms	48000 KiB

railway

#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld, ld> pld;
typedef vector<pi> vpi;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T>
ostream &operator<<(ostream &os, vector<T> &a) {
    os << "[";
    for (int i = 0; i < ll(a.size()); i++) { os << a[i] << ((i != ll(a.size() - 1) ? " " : "")); }
    os << "]\n";
    return os;
}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map

template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
    is >> p.first >> p.second;
    return is;
}

template<typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> &p) {
    os << "" << p.first << " " << p.second << "";
    return os;
}

void usaco(string taskname) {
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char *FIN = fin.c_str();
    const char *FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
}

template<typename T>
void read(vector<T> &v) {
    int n = v.size();
    for (int i = 0; i < n; i++)
        cin >> v[i];
}

template<typename T>
vector<T> UNQ(vector<T> a) {
    vector<T> ans;
    for (T t: a)
        if (ans.empty() || t != ans.back())
            ans.push_back(t);
    return ans;
}

ll ceil(ll a, ll b) {
    ll ans = a / b;
    if (a % b)ans++;
    return ans;
}

ld log(ld a, ld b) { return log(b) / log(a); }

ll power(ll base, ll exp, ll M = 1e18) {//(base^exp)%M
    ll ans = 1;
    while (exp) {
        if (exp % 2 == 1)ans = ((ans % M) * (base % M)) % M;
        base = ((base % M) * (base % M)) % M;
        exp /= 2;
    }
    return ans;
}

string to_base(int n, int new_base) {
    string s;
    int nn = n;
    while (nn) {
        s += to_string(nn % new_base);
        nn /= new_base;
    }
    reverse(all(s));
    return s;
}

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    ll x = (a / gcd(a, b));
    return b * x;
}

vl generate_array(ll n, ll mn = 1, ll mx = 1e18 + 1) {
    if (mx == 1e18 + 1)
        mx = n;
    vl ans(n);
    for (int i = 0; i < n; i++)
        ans[i] = (mn + rand() % (mx - mn + 1));
    return ans;
}

string substr(string s, int l, int r) {
    string ans;
    for (int i = l; i <= r; i++)
        ans += s[i];
    return ans;
}


void solve();

int main() {
    GLHF;
    int t = 1;
    //cin >> t;
    while (t--)
        solve();
}
vvi g;
vvi up;
int n,m,k;
int lg=20;

vi dep,d,tin,tout;
int timer=0;
void dfs(int src,int par){
    tin[src]=++timer;
    up[src][0]=par;
    if(par!=-1)
        dep[src]=dep[par]+1;
    for(int nbr:g[src])
        if(nbr!=par)
            dfs(nbr,src);
    tout[src]=timer;
}

vvi a;
vi ans;
map<pi,int>id;

void dfs2(int src,int par){

    for(int nbr:g[src]){
        if(nbr==par)
            continue;
        dfs2(nbr,src);
        d[src]+=d[nbr];
    }

    if(d[src]>=k && par!=-1)
        ans.pb(id[{src,par}]);
}
void prep(){
    cin >> n >> m >> k;
    g.resize(n+1);

    for(int i=0; i<n-1; i++){
        int u,v;
        cin >> u >> v;
        g[u].pb(v);
        g[v].pb(u);
        id[{u,v}]=id[{v,u}]=i+1;
    }

    d.resize(n+1);
    dep.resize(n+1);
    up.resize(n+1,vi(lg,-1));
    tin.resize(n+1);
    tout.resize(n+1);

    dfs(1,-1);

    for(int j=1; j<lg; j++)
        for(int i=1; i<=n; i++)
            if(up[i][j-1]!=-1)
                up[i][j]=up[up[i][j-1]][j-1];
    a.resize(m);
    for(int i=0; i<m; i++){
        int x;
        cin >> x;
        a[i].resize(x);
        read(a[i]);
    }
}

int lca(int u,int v){
    if(u==0)
        return v;
    if(dep[u]<dep[v])
        swap(u,v);

    for(int i=0; i<lg; i++)
        if((dep[u]-dep[v])&(1<<i))
            u=up[u][i];
    for(int i=lg-1; 0<=i; i--)
        if(up[u][i]!=up[v][i])
            u=up[u][i],v=up[v][i];
    if(u!=v)
        u=up[u][0];
    return u;
}
void solve() {
    prep();

    for(int i=0; i<m; i++){
        int l=0;
        for(int j=0; j<a[i].size(); j++) {
            l = lca(l, a[i][j]);
            d[a[i][j]]++;
        }
        d[l]-=2;
    }
    dfs2(1,-1);
    sort(all(ans));
    cout << ans.size() << "\n";
    print(ans)

}

Compilation message (stderr)

railway.cpp: In function 'void solve()':
railway.cpp:231:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  231 |         for(int j=0; j<a[i].size(); j++) {
      |                      ~^~~~~~~~~~~~
railway.cpp: In function 'void usaco(std::string)':
railway.cpp:57:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |     freopen(FIN, "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~
railway.cpp:58:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |     freopen(FOUT, "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~

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