oj.uz

Submission #377999

# Submission time Handle Problem Language Result Execution time Memory
377999 2021-03-15T17:14:40 Z b00n0rp Railway (BOI17_railway) C++17
100 / 100
 210 ms 38440 KB 
// --------------------------------------------------<TEMPLATE>--------------------------------------------------
// --------------------<optimizations>--------------------
/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")
*/ 
// -------------------</optimizations>--------------------
 
// ---------------<Headers and namespaces>----------------
#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;
*/
 
// ---------------</Headers and namespaces>---------------
 
// -----------------<Defines and typedefs>----------------
// typedef tree<int,null_type,less<int>,rb_tree_tag, 
// tree_order_statistics_node_update> indexed_set; // use less_equal for multiset
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the iterator to kth largest element.(0-based)
 
typedef long double LD;
typedef long long ll;
#define int ll
#define pb push_back
#define mp make_pair
#define REP(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define remax(a,b) a = max(a,b)
#define remin(a,b) a = min(a,b)
#define all(v) v.begin(),v.end()
typedef map<int,int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
#define F first
#define S second
#define PQ(type) priority_queue<type>
#define PQD(type) priority_queue<type,vector<type>,greater<type> >
#define WL(t) while(t --)
#define SZ(x) ((int)(x).size())
#define runtime() ((double)clock() / CLOCKS_PER_SEC)
#define inrange(i,a,b) ((i>=min(a,b)) && (i<=max(a,b)))
 
/*
// -----<SCANF>-----
#define sfi(x) scanf("%d",&x);
#define sfi2(x,y) scanf("%d%d",&x,&y);
#define sfi3(x,y,z) scanf("%d%d%d",&x,&y,&z);
 
#define sfl(x) scanf("%lld",&x);
#define sfl2(x,y) scanf("%lld%lld",&x,&y);
#define sfl3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z);
#define sfl4(x,y,z,x1) scanf("%lld%lld%lld%lld",&x,&y,&z,&x1);
#define sfl5(x,y,z,x1,y1) scanf("%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1);
#define sfl6(x,y,z,x1,y1,z1) scanf("%lld%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1,&z1);
 
#define sfs(x) scanf("%s",x);
#define sfs2(x,y) scanf("%s%s",x,y);
#define sfs3(x,y,z) scanf("%s%s%s",x,y,z);
// ----</SCANF>-----
 
// ----<PRINTF>-----
#define pfi(x) printf("%d\n",x);
#define pfi2(x,y) printf("%d %d\n",x,y);
#define pfi3(x,y,z) printf("%d %d %d\n",x,y,z);
 
#define pfl(x) printf("%lld\n",x);
#define pfl2(x,y) printf("%lld %lld\n",x,y);
#define pfl3(x,y,z) printf("%lld %lld %lld\n",x,y,z);
 
#define pfs(x) printf("%s\n",x);
#define pfs2(x,y) printf("%s %s\n",x,y);
#define pfs3(x,y,z) printf("%s %s %s\n",x,y,z);
 
#define pwe(x) printf("%lld ",x); // print without end
// ----</PRINTF>----
*/
#define FLSH fflush(stdout)
#define fileIO(name) \
    freopen(name".in", "r", stdin); \
    freopen(name".out", "w", stdout);
#define PRECISION(x) cout << fixed << setprecision(x); 
#define FAST_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
// ----------------</Defines and typedefs>----------------
 
// -------------------<Debugging stuff>-------------------
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
    cout << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
    const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
 
// ------------------</Debugging stuff>-------------------
 
// ------------------------<Consts>-----------------------
const int MAXN = 100005;
const int SQRTN = 1003;
const int LOGN = 22;
const double PI=acos(-1);
 
#ifdef int
const int INF=1e16;
#else
const int INF=1e9;
#endif
 
const int MOD = 1000000007;
const int FMOD = 998244353;
const double eps = 1e-9;
// -----------------------</Consts>-----------------------
/*
// -------------------------<RNG>-------------------------
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count()); 
#define SHUF(v) shuffle(all(v), RNG);
// Use mt19937_64 for 64 bit random numbers.
 
// ------------------------</RNG>-------------------------
 
// ----------------------<MATH>---------------------------
template<typename T> T gcd(T a, T b){return(b?__gcd(a,b):a);}
template<typename T> T lcm(T a, T b){return(a*(b/gcd(a,b)));}
int add(int a, int b, int c = MOD){int res=a+b;return(res>=c?res-c:res);}
int mod_neg(int a, int b, int c = MOD){int res;if(abs(a-b)<c)res=a-b;else res=(a-b)%c;return(res<0?res+c:res);}
int mul(int a, int b, int c = MOD){ll res=(ll)a*b;return(res>=c?res%c:res);}
int muln(int a, int b, int c = MOD){ll res=(ll)a*b;return ((res%c)+c)%c;}
ll mulmod(ll a,ll b, ll m = MOD){ll q = (ll)(((LD)a*(LD)b)/(LD)m);ll r=a*b-q*m;if(r>m)r%=m;if(r<0)r+=m;return r;}
template<typename T>T expo(T e, T n){T x=1,p=e;while(n){if(n&1)x=x*p;p=p*p;n>>=1;}return x;}
template<typename T>T power(T e, T n, T m = MOD){T x=1,p=e;while(n){if(n&1)x=mul(x,p,m);p=mul(p,p,m);n>>=1;}return x;}
template<typename T>T extended_euclid(T a, T b, T &x, T &y){T xx=0,yy=1;y=0;x=1;while(b){T q=a/b,t=b;b=a%b;a=t;\
t=xx;xx=x-q*xx;x=t;t=yy;yy=y-q*yy;y=t;}return a;}
template<typename T>T mod_inverse(T a, T n = MOD){T x,y,z=0;T d=extended_euclid(a,n,x,y);return(d>1?-1:mod_neg(x,z,n));}
 
const int FACSZ = 1; // Make sure to change this
 
int fact[FACSZ],ifact[FACSZ];
 
void precom(int c = MOD){
    fact[0] = 1;
    FOR(i,1,FACSZ) fact[i] = mul(fact[i-1],i,c);
    ifact[FACSZ-1] = mod_inverse(fact[FACSZ-1],c);
    REPD(i,FACSZ-1){
        ifact[i] = mul(i+1,ifact[i+1],c);
    }
}
 
int ncr(int n,int r,int c = MOD){
    return mul(mul(ifact[r],ifact[n-r],c),fact[n],c);
} 
*/
// ----------------------</MATH>--------------------------
// --------------------------------------------------</TEMPLATE>--------------------------------------------------
 
void solvethetestcase();
 
signed main(){
    // comment when using scanf,printf
    FAST_IO
    int t = 1;
    // (UNCOMMENT FOR MULTIPLE TEST CASES)
    // cin >> t;
    FOR(testcase,1,t+1){
        // (UNCOMMENT FOR CODEJAM)
        // printf("Case #%lld: ",testcase); 
        solvethetestcase();
    }
}   
 
int n,m,k;
vpii edges;
vi adj[MAXN];
int par[MAXN][LOGN];
int st[MAXN],fin[MAXN],dep[MAXN];
int pref[MAXN];
int tim;

void dfs(int u,int p,int d){
    st[u] = tim++;
    par[u][0] = p;
    dep[u] = d;
    for(auto v:adj[u]){
        if(v != p){
            dfs(v,u,d+1);
        }
    }
    fin[u] = tim;
}

bool cmp(int x,int y){
    return st[x] < st[y];
}

int lca(int u,int v){
    if(dep[u] > dep[v]) swap(u,v);
    FORD(j,LOGN-1,0){
        if(dep[v]-(1<<j) >= dep[u]) v = par[v][j];
    }
    if(u == v) return u;
    FORD(j,LOGN-1,0){
        if(par[u][j] != par[v][j]){
            u = par[u][j];
            v = par[v][j];
        }
    }
    return par[u][0];
}

void dfs_ans(int u){
    for(auto v:adj[u]){
        if(v != par[u][0]){
            dfs_ans(v);
            pref[u] += pref[v];
        }
    }
}
 
void solvethetestcase(){
    cin >> n >> m >> k;
    REP(i,n-1){
        int u,v; cin >> u >> v;
        edges.pb({u,v});
        adj[u].pb(v);
        adj[v].pb(u);
    }
    tim = 0;
    dfs(1,1,0);
    FOR(j,1,LOGN){
        FOR(i,1,n+1){
            par[i][j] = par[par[i][j-1]][j-1];
        }
    }
    REP(i,m){
        vi v;
        int sz; cin >> sz;
        REP(j,sz){
            int x; cin >> x;
            v.pb(x);
        }
        sort(all(v),cmp);
        int l = v[0];
        REP(j,sz-1){
            int l1 = lca(v[j],v[j+1]);
            if(dep[l1] < dep[l]){
                pref[l]++;
                pref[l1]--;
            }
            pref[l1]--;
            pref[v[j+1]]++;
            l = lca(l,v[j+1]);
        }
    }
    dfs_ans(1);
    vi ans;
    REP(i,n-1){
        int u = edges[i].F,v = edges[i].S;
        if(par[u][0] == v) swap(u,v);
        if(pref[v] >= k) ans.pb(i+1);
    }
    cout << SZ(ans) << "\n";
    for(auto x:ans) cout << x << " ";
    cout << "\n";
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 8 ms 5224 KB Output is correct
3 Correct 8 ms 5352 KB Output is correct
4 Correct 2 ms 2668 KB Output is correct
5 Correct 2 ms 2668 KB Output is correct
6 Correct 11 ms 5864 KB Output is correct
7 Correct 9 ms 5480 KB Output is correct
8 Correct 8 ms 5352 KB Output is correct
9 Correct 8 ms 5484 KB Output is correct
10 Correct 2 ms 2668 KB Output is correct
11 Correct 2 ms 2668 KB Output is correct
12 Correct 2 ms 2668 KB Output is correct
13 Correct 2 ms 2668 KB Output is correct
14 Correct 2 ms 2756 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 8 ms 5224 KB Output is correct
3 Correct 8 ms 5352 KB Output is correct
4 Correct 2 ms 2668 KB Output is correct
5 Correct 2 ms 2668 KB Output is correct
6 Correct 11 ms 5864 KB Output is correct
7 Correct 9 ms 5480 KB Output is correct
8 Correct 8 ms 5352 KB Output is correct
9 Correct 8 ms 5484 KB Output is correct
10 Correct 2 ms 2668 KB Output is correct
11 Correct 2 ms 2668 KB Output is correct
12 Correct 2 ms 2668 KB Output is correct
13 Correct 2 ms 2668 KB Output is correct
14 Correct 2 ms 2756 KB Output is correct
15 Correct 37 ms 5864 KB Output is correct
16 Correct 41 ms 5864 KB Output is correct
17 Correct 37 ms 5992 KB Output is correct
18 Correct 9 ms 5736 KB Output is correct
19 Correct 9 ms 5480 KB Output is correct
20 Correct 43 ms 6120 KB Output is correct
21 Correct 44 ms 5864 KB Output is correct
22 Correct 2 ms 2668 KB Output is correct
23 Correct 10 ms 5336 KB Output is correct
24 Correct 9 ms 5352 KB Output is correct
25 Correct 2 ms 2668 KB Output is correct
26 Correct 2 ms 2668 KB Output is correct
27 Correct 9 ms 5864 KB Output is correct
28 Correct 8 ms 5480 KB Output is correct
29 Correct 7 ms 5352 KB Output is correct
30 Correct 8 ms 5352 KB Output is correct
31 Correct 2 ms 2668 KB Output is correct
32 Correct 2 ms 2668 KB Output is correct
33 Correct 3 ms 2796 KB Output is correct
34 Correct 3 ms 2668 KB Output is correct
35 Correct 2 ms 2668 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 162 ms 36060 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 165 ms 35108 KB Output is correct
4 Correct 156 ms 34140 KB Output is correct
5 Correct 210 ms 36188 KB Output is correct
6 Correct 170 ms 36444 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 31324 KB Output is correct
2 Correct 137 ms 28764 KB Output is correct
3 Correct 147 ms 28512 KB Output is correct
4 Correct 146 ms 28512 KB Output is correct
5 Correct 145 ms 28384 KB Output is correct
6 Correct 120 ms 31580 KB Output is correct
7 Correct 122 ms 31580 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 31324 KB Output is correct
2 Correct 137 ms 28764 KB Output is correct
3 Correct 147 ms 28512 KB Output is correct
4 Correct 146 ms 28512 KB Output is correct
5 Correct 145 ms 28384 KB Output is correct
6 Correct 120 ms 31580 KB Output is correct
7 Correct 122 ms 31580 KB Output is correct
8 Correct 164 ms 31708 KB Output is correct
9 Correct 157 ms 31708 KB Output is correct
10 Correct 176 ms 36444 KB Output is correct
11 Correct 183 ms 36316 KB Output is correct
12 Correct 137 ms 28636 KB Output is correct
13 Correct 137 ms 29940 KB Output is correct
14 Correct 154 ms 30176 KB Output is correct
15 Correct 157 ms 30048 KB Output is correct
16 Correct 146 ms 30176 KB Output is correct
17 Correct 151 ms 30304 KB Output is correct
18 Correct 160 ms 30176 KB Output is correct
19 Correct 142 ms 30556 KB Output is correct
20 Correct 123 ms 33756 KB Output is correct
21 Correct 131 ms 34396 KB Output is correct
22 Correct 126 ms 34012 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 8 ms 5224 KB Output is correct
3 Correct 8 ms 5352 KB Output is correct
4 Correct 2 ms 2668 KB Output is correct
5 Correct 2 ms 2668 KB Output is correct
6 Correct 11 ms 5864 KB Output is correct
7 Correct 9 ms 5480 KB Output is correct
8 Correct 8 ms 5352 KB Output is correct
9 Correct 8 ms 5484 KB Output is correct
10 Correct 2 ms 2668 KB Output is correct
11 Correct 2 ms 2668 KB Output is correct
12 Correct 2 ms 2668 KB Output is correct
13 Correct 2 ms 2668 KB Output is correct
14 Correct 2 ms 2756 KB Output is correct
15 Correct 37 ms 5864 KB Output is correct
16 Correct 41 ms 5864 KB Output is correct
17 Correct 37 ms 5992 KB Output is correct
18 Correct 9 ms 5736 KB Output is correct
19 Correct 9 ms 5480 KB Output is correct
20 Correct 43 ms 6120 KB Output is correct
21 Correct 44 ms 5864 KB Output is correct
22 Correct 2 ms 2668 KB Output is correct
23 Correct 10 ms 5336 KB Output is correct
24 Correct 9 ms 5352 KB Output is correct
25 Correct 2 ms 2668 KB Output is correct
26 Correct 2 ms 2668 KB Output is correct
27 Correct 9 ms 5864 KB Output is correct
28 Correct 8 ms 5480 KB Output is correct
29 Correct 7 ms 5352 KB Output is correct
30 Correct 8 ms 5352 KB Output is correct
31 Correct 2 ms 2668 KB Output is correct
32 Correct 2 ms 2668 KB Output is correct
33 Correct 3 ms 2796 KB Output is correct
34 Correct 3 ms 2668 KB Output is correct
35 Correct 2 ms 2668 KB Output is correct
36 Correct 162 ms 36060 KB Output is correct
37 Correct 2 ms 2668 KB Output is correct
38 Correct 165 ms 35108 KB Output is correct
39 Correct 156 ms 34140 KB Output is correct
40 Correct 210 ms 36188 KB Output is correct
41 Correct 170 ms 36444 KB Output is correct
42 Correct 121 ms 31324 KB Output is correct
43 Correct 137 ms 28764 KB Output is correct
44 Correct 147 ms 28512 KB Output is correct
45 Correct 146 ms 28512 KB Output is correct
46 Correct 145 ms 28384 KB Output is correct
47 Correct 120 ms 31580 KB Output is correct
48 Correct 122 ms 31580 KB Output is correct
49 Correct 164 ms 31708 KB Output is correct
50 Correct 157 ms 31708 KB Output is correct
51 Correct 176 ms 36444 KB Output is correct
52 Correct 183 ms 36316 KB Output is correct
53 Correct 137 ms 28636 KB Output is correct
54 Correct 137 ms 29940 KB Output is correct
55 Correct 154 ms 30176 KB Output is correct
56 Correct 157 ms 30048 KB Output is correct
57 Correct 146 ms 30176 KB Output is correct
58 Correct 151 ms 30304 KB Output is correct
59 Correct 160 ms 30176 KB Output is correct
60 Correct 142 ms 30556 KB Output is correct
61 Correct 123 ms 33756 KB Output is correct
62 Correct 131 ms 34396 KB Output is correct
63 Correct 126 ms 34012 KB Output is correct
64 Correct 142 ms 33756 KB Output is correct
65 Correct 167 ms 30316 KB Output is correct
66 Correct 179 ms 30048 KB Output is correct
67 Correct 171 ms 30128 KB Output is correct
68 Correct 119 ms 29916 KB Output is correct
69 Correct 116 ms 29920 KB Output is correct
70 Correct 142 ms 34396 KB Output is correct
71 Correct 188 ms 33244 KB Output is correct
72 Correct 2 ms 2668 KB Output is correct
73 Correct 8 ms 5352 KB Output is correct
74 Correct 8 ms 5352 KB Output is correct
75 Correct 2 ms 2796 KB Output is correct
76 Correct 2 ms 2668 KB Output is correct
77 Correct 9 ms 5864 KB Output is correct
78 Correct 9 ms 5480 KB Output is correct
79 Correct 9 ms 5352 KB Output is correct
80 Correct 8 ms 5480 KB Output is correct
81 Correct 2 ms 2668 KB Output is correct
82 Correct 2 ms 2668 KB Output is correct
83 Correct 2 ms 2668 KB Output is correct
84 Correct 2 ms 2668 KB Output is correct
85 Correct 2 ms 2668 KB Output is correct
86 Correct 35 ms 5736 KB Output is correct
87 Correct 36 ms 5864 KB Output is correct
88 Correct 36 ms 5864 KB Output is correct
89 Correct 9 ms 5736 KB Output is correct
90 Correct 9 ms 5480 KB Output is correct
91 Correct 41 ms 5992 KB Output is correct
92 Correct 42 ms 5864 KB Output is correct
93 Correct 2 ms 2668 KB Output is correct
94 Correct 162 ms 38108 KB Output is correct
95 Correct 176 ms 36956 KB Output is correct
96 Correct 153 ms 35804 KB Output is correct
97 Correct 207 ms 38108 KB Output is correct
98 Correct 179 ms 38440 KB Output is correct
99 Correct 146 ms 30176 KB Output is correct
100 Correct 146 ms 30176 KB Output is correct
101 Correct 146 ms 30176 KB Output is correct
102 Correct 155 ms 30432 KB Output is correct
103 Correct 124 ms 33372 KB Output is correct
104 Correct 124 ms 34140 KB Output is correct
105 Correct 123 ms 33372 KB Output is correct
106 Correct 160 ms 33756 KB Output is correct
107 Correct 155 ms 33372 KB Output is correct
108 Correct 173 ms 38236 KB Output is correct
109 Correct 175 ms 38236 KB Output is correct
110 Correct 153 ms 30008 KB Output is correct
111 Correct 137 ms 29916 KB Output is correct
112 Correct 156 ms 30048 KB Output is correct
113 Correct 157 ms 30176 KB Output is correct