oj.uz

Submission #1093486

# Submission time Handle Problem Language Result Execution time Memory
1093486 2024-09-27T01:07:13 Z vjudge1 Railway (BOI17_railway) C++17
100 / 100
 107 ms 41720 KB 
#include<bits/allocator.h>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,popcnt,lzcnt")
 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define int128 __int128_t
#define double long double
#define gcd __gcd
#define lcm(a, b) ((a)/gcd(a, b)*(b))
#define sqrt sqrtl
#define log2 log2l
#define log10 log10l
#define floor floorl
#define to_string str
#define yes cout << "YES"
#define no cout << "NO"
#define trav(i, a) for (auto &i: (a))
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) (int)a.size()
#define Max(a) *max_element(all(a))
#define Min(a) *min_element(all(a))
#define Find(a, n) (find(all(a), n) - a.begin())
#define Count(a, n) count(all(a), n)
#define Upper(a, n) (upper_bound(all(a), n) - a.begin())
#define Lower(a, n) (lower_bound(all(a), n) - a.begin())
#define next_perm(a) next_permutation(all(a))
#define prev_perm(a) prev_permutation(all(a))
#define sorted(a) is_sorted(all(a))
#define sum(a) accumulate(all(a), 0)
#define sumll(a) accumulate(all(a), 0ll)
#define Sort(a) sort(all(a))
#define Reverse(a) reverse(all(a))
#define Unique(a) Sort(a), (a).resize(unique(all(a)) - a.begin())
#define pb push_back
#define eb emplace_back
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define clz __builtin_clz
#define clzll __buitlin_clzll
#define ctz __builtin_ctz
#define ctzll __builtin_ctzll
#define open(s) freopen(s, "r", stdin)
#define write(s) freopen(s, "w", stdout)
#define fileopen(s) open((string(s) + ".inp").c_str()), write((string(s) + ".out").c_str());
#define For(i, a, b) for (auto i = (a); i < (b); i++)
#define Fore(i, a, b) for (auto i = (a); i >= (b); i--)
#define FOR(i, a, b) for (auto i = (a); i <= (b); i++)
#define ret(s) return void(cout << s);

const int mod = 1e9 + 7, mod2 = 998244353;
const double PI = acos(-1), eps = 1e-9;
const ull npos = string::npos;
const int dx[] = {0, 0, -1, 1}, dy[] = {-1, 1, 0, 0};
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using cd = complex<double>;
mt19937 mt(chrono::system_clock::now().time_since_epoch().count());
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<double> vdo;
typedef vector<vdo> vvdo;
typedef vector<string> vs;
typedef vector<pii> vpair;
typedef vector<vpair> vvpair;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<cd> vcd;
typedef priority_queue<int> pq;
typedef priority_queue<int, vi, greater<int>> pqg;
typedef priority_queue<ll> pqll;
typedef priority_queue<ll, vll, greater<ll>> pqgll;

ll add(ll a, ll b, int m) {if (a >= m) a%=m;if (b >= m) b%=m;a+=b;return a >= m ? a - m: a;}
ll sub(ll a, ll b, int m) {if (a >= m) a%=m;if (b >= m) b%=m;a-=b;return a < 0 ? a + m: a;}
ll mul(ll a, ll b, int m) {if (a >= m) a%=m;if (b >= m) b%=m;return a*b % m;}
ll bin_mul(ll a, ll b, ll m) {if (a >= m) a%=m;if (b >= m) b%=m;ll x = 0;while (b) {if (b & 1) x = (x + a) % m;a = (a + a) % m;b>>=1;}return x;}
ll power(ll a, ll b, int m) {ll x = 1;if (a >= m) a%=m; while (b) {if (b & 1) x = x*a % m;a = a*a % m;b>>=1;}return x;}
ll power(ll a, ll b) {ll x = 1;while (b) {if (b & 1) x = x*a;a = a*a;b>>=1;}return x;}
ll ceil(ll a, ll b) {return (a + b - 1)/b;}
ll to_int(const string &s) {ll x = 0; for (int i = (s[0] == '-'); i < sz(s); i++) x = x*10 + s[i] - '0';return x*(s[0] == '-' ? -1: 1);}
bool is_prime(ll n) {if (n < 2) return 0;if (n < 4) return 1;if (n % 2 == 0 || n % 3 == 0) return 0;for (ll i = 5; i*i <= n; i+=6) {if(n % i == 0 || n % (i + 2) == 0) return 0;}return 1;}
bool is_square(ll n) {ll k = sqrt(n); return k*k == n;}
ll factorial(int n) {ll x = 1;for (int i = 2; i <= n; i++) x*=i;return x;}
ll factorial(int n, int m) {ll x = 1;for (ll i = 2; i <= n; i++) x = x*i % m;return x;}
bool is_power(ll n, ll k) {while (n % k == 0) n/=k;return n == 1ll;}
string str(ll n) {if (n == 0) return "0"; string s = ""; bool c = 0; if (n < 0) c = 1, n = -n; while (n) {s+=n % 10 + '0'; n/=10;} if (c) s+='-'; Reverse(s); return s;}
string repeat(const string &s, int n) {if (n < 0) return ""; string x = ""; while (n--) x+=s; return x;}
string bin(ll n) {string s = ""; while (n) {s+=(n & 1) + '0'; n>>=1;} Reverse(s); return s;}
void sieve(vector<bool> &a) {int n = a.size(); a[0] = a[1] = 0; for (int i = 4; i < n; i+=2) a[i] = 0; for (int i = 3; i*i < n; i+=2) {if (a[i]) {for (int j = i*i; j < n; j+=(i << 1)) a[j] = 0;}}}
void sieve(bool a[], int n) {a[0] = a[1] = 0; for (int i = 4; i < n; i+=2) a[i] = 0; for (int i = 3; i*i < n; i+=2) {if (a[i]) {for (int j = i*i; j < n; j+=(i << 1)) a[j] = 0;}}}
void sieve(vector<int> &a) {int n = a.size(); for (int i = 2; i < n; i+=2) a[i] = 2; for (int i = 3; i*i < n; i+=2) {if (!a[i]) {for (int j = i; j < n; j+=(i << 1)) a[j] = i;}} for (int i = 3; i < n; i+=2) {if (!a[i]) a[i] = i;}}
void sieve(int a[], int n) {for (int i = 2; i < n; i+=2) a[i] = 2; for (int i = 3; i*i < n; i+=2) {if (!a[i]) {for (int j = i; j < n; j+=(i << 1)) a[j] = i;}} for (int i = 3; i < n; i+=2) {if (!a[i]) a[i] = i;}}
vector<pii> factorize(int n) {vector<pii> a; for (int i = 2; i*i <= n; i++) {if (n % i == 0) {int k = 0; while (n % i == 0) k++, n/=i; a.emplace_back(i, k);}} if (n > 1) a.emplace_back(n, 1); return a;}
int rand(int l, int r) {return uniform_int_distribution<int>(l, r)(mt);}
int Log2(int n) {return 31 - __builtin_clz(n);}
template<class T> void compress(vector<T> &a) {vector<T> b; for (T &i: a) b.push_back(i); sort(all(b)); b.resize(unique(all(b)) - b.begin()); for (T &i: a) i = lower_bound(all(b), i) - b.begin() + 1;}

template<class A, class B> istream& operator>>(istream& in, pair<A, B> &p) {in >> p.first >> p.second; return in;}
template<class A, class B> ostream& operator<<(ostream& out, const pair<A, B> &p) {out << p.first << ' ' << p.second; return out;}
template<class T> istream& operator>>(istream& in, vector<T> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const vector<T> &a) {for (auto &i: a) out << i << ' '; return out;}
template<class T> istream& operator>>(istream& in, vector<vector<T>> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const vector<vector<T>> &a) {for (auto &i: a) out << i << '\n'; return out;}
template<class T> istream& operator>>(istream& in, deque<T> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const deque<T> &a) {for (auto &i: a) out << i << ' '; return out;}
// istream& operator>>(istream& in, __int128_t &a) {string s; in >> s; a = 0; for (auto &i: s) a = a*10 + (i - '0'); return in;}
// ostream& operator<<(ostream& out, __int128_t a) {string s = ""; while (a > 0) {s+=(int)(a % 10) + '0'; a/=10;} Reverse(s); out << s; return out;}

const int N = 2e5 + 5;
int n, k, in[N], out[N], f[N], e[N], t[N], s[20][N], w[N], par[N], se = 0, st = 0, T = 0;
vi g[N];
map<pii, int> mp;
void dfs(int u, int p) {
    in[u] = ++T;
    e[++se] = in[u];
    t[++st] = u;
    f[u] = se;
    trav(v,g[u]){
        if (v != p) {
            par[v] = u;
            dfs(v, u);
            e[++se] = in[u];
        }
    }
    out[u] = T;
}
void sparse() {
    For(i,1,2*n) s[0][i] = e[i];
    For(i,1,20){
        FOR(j,1,2*n-(1<<i)) s[i][j] = min(s[i - 1][j], s[i - 1][j + (1 << (i - 1))]);
    }
}
int que(int l, int r) {
    int i = Log2(r - l + 1);
    return min(s[i][l], s[i][r - (1 << i) + 1]);
}
int lca(int u, int v) {
    u = f[u], v = f[v];
    if (u > v) swap(u, v);
    return t[que(u, v)];
}
bool anc(int u, int v) {
    return in[u] <= in[v] && out[u] >= out[v];
}
void solve(int u) {
    trav(v,g[u]){
        if (v != par[u]) {
            solve(v);
            w[u]+=w[v];
        }
    }
}
int main() {
    ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    cout << fixed << setprecision(10);
    int _; cin >> n >> _ >> k;
    For(i,1,n){
        int u, v; cin >> u >> v;
        mp[minmax(u, v)] = i;
        g[u].pb(v); g[v].pb(u);
    }
    dfs(1, 0); sparse();
    while (_--) {
        int m; cin >> m;
        vi q(m); cin >> q;
        sort(all(q), [&](int u, int v){
            return in[u] < in[v];
        });
        For(i,1,m) q.pb(lca(q[i - 1], q[i]));
        Unique(q);
        sort(all(q), [&](int u, int v){
            return in[u] < in[v];
        });
        vi l{q[0]};
        trav(v,q){
            if (v == q[0]) continue;
            while (!anc(l.back(), v)) l.pop_back();
            int u = l.back();
            w[v]++; w[u]--;
            l.pb(v);
        }
    }
    solve(1);
    vi q;
    FOR(i,2,n){
        if (w[i] >= k) q.pb(mp[minmax(i, par[i])]);
    }
    Sort(q);
    cout << sz(q) << '\n' << q;
    cerr << "\nProcess returned 0 (0x0)   execution time :  " << 0.001*clock() << " s";
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5208 KB Output is correct
2 Correct 7 ms 7516 KB Output is correct
3 Correct 10 ms 7464 KB Output is correct
4 Correct 3 ms 5208 KB Output is correct
5 Correct 4 ms 5212 KB Output is correct
6 Correct 7 ms 8028 KB Output is correct
7 Correct 9 ms 7768 KB Output is correct
8 Correct 6 ms 7492 KB Output is correct
9 Correct 6 ms 7516 KB Output is correct
10 Correct 3 ms 5212 KB Output is correct
11 Correct 3 ms 5212 KB Output is correct
12 Correct 3 ms 5208 KB Output is correct
13 Correct 3 ms 5212 KB Output is correct
14 Correct 3 ms 5212 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5208 KB Output is correct
2 Correct 7 ms 7516 KB Output is correct
3 Correct 10 ms 7464 KB Output is correct
4 Correct 3 ms 5208 KB Output is correct
5 Correct 4 ms 5212 KB Output is correct
6 Correct 7 ms 8028 KB Output is correct
7 Correct 9 ms 7768 KB Output is correct
8 Correct 6 ms 7492 KB Output is correct
9 Correct 6 ms 7516 KB Output is correct
10 Correct 3 ms 5212 KB Output is correct
11 Correct 3 ms 5212 KB Output is correct
12 Correct 3 ms 5208 KB Output is correct
13 Correct 3 ms 5212 KB Output is correct
14 Correct 3 ms 5212 KB Output is correct
15 Correct 34 ms 8052 KB Output is correct
16 Correct 30 ms 8056 KB Output is correct
17 Correct 27 ms 8056 KB Output is correct
18 Correct 11 ms 8028 KB Output is correct
19 Correct 8 ms 7768 KB Output is correct
20 Correct 24 ms 8180 KB Output is correct
21 Correct 23 ms 8044 KB Output is correct
22 Correct 3 ms 5208 KB Output is correct
23 Correct 7 ms 7516 KB Output is correct
24 Correct 6 ms 7516 KB Output is correct
25 Correct 2 ms 5212 KB Output is correct
26 Correct 3 ms 5212 KB Output is correct
27 Correct 8 ms 7996 KB Output is correct
28 Correct 7 ms 7764 KB Output is correct
29 Correct 6 ms 7516 KB Output is correct
30 Correct 7 ms 7516 KB Output is correct
31 Correct 4 ms 5464 KB Output is correct
32 Correct 3 ms 5212 KB Output is correct
33 Correct 3 ms 5212 KB Output is correct
34 Correct 4 ms 5212 KB Output is correct
35 Correct 3 ms 5212 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 41168 KB Output is correct
2 Correct 3 ms 5212 KB Output is correct
3 Correct 73 ms 40892 KB Output is correct
4 Correct 66 ms 40272 KB Output is correct
5 Correct 84 ms 41160 KB Output is correct
6 Correct 80 ms 41720 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 36432 KB Output is correct
2 Correct 74 ms 32872 KB Output is correct
3 Correct 72 ms 32596 KB Output is correct
4 Correct 75 ms 32696 KB Output is correct
5 Correct 71 ms 32532 KB Output is correct
6 Correct 64 ms 36740 KB Output is correct
7 Correct 67 ms 36432 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 36432 KB Output is correct
2 Correct 74 ms 32872 KB Output is correct
3 Correct 72 ms 32596 KB Output is correct
4 Correct 75 ms 32696 KB Output is correct
5 Correct 71 ms 32532 KB Output is correct
6 Correct 64 ms 36740 KB Output is correct
7 Correct 67 ms 36432 KB Output is correct
8 Correct 70 ms 36516 KB Output is correct
9 Correct 81 ms 36688 KB Output is correct
10 Correct 80 ms 41380 KB Output is correct
11 Correct 78 ms 41172 KB Output is correct
12 Correct 66 ms 32496 KB Output is correct
13 Correct 66 ms 32592 KB Output is correct
14 Correct 88 ms 32420 KB Output is correct
15 Correct 92 ms 32592 KB Output is correct
16 Correct 71 ms 32692 KB Output is correct
17 Correct 84 ms 32648 KB Output is correct
18 Correct 82 ms 32680 KB Output is correct
19 Correct 75 ms 32960 KB Output is correct
20 Correct 80 ms 36764 KB Output is correct
21 Correct 71 ms 36932 KB Output is correct
22 Correct 64 ms 36804 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5208 KB Output is correct
2 Correct 7 ms 7516 KB Output is correct
3 Correct 10 ms 7464 KB Output is correct
4 Correct 3 ms 5208 KB Output is correct
5 Correct 4 ms 5212 KB Output is correct
6 Correct 7 ms 8028 KB Output is correct
7 Correct 9 ms 7768 KB Output is correct
8 Correct 6 ms 7492 KB Output is correct
9 Correct 6 ms 7516 KB Output is correct
10 Correct 3 ms 5212 KB Output is correct
11 Correct 3 ms 5212 KB Output is correct
12 Correct 3 ms 5208 KB Output is correct
13 Correct 3 ms 5212 KB Output is correct
14 Correct 3 ms 5212 KB Output is correct
15 Correct 34 ms 8052 KB Output is correct
16 Correct 30 ms 8056 KB Output is correct
17 Correct 27 ms 8056 KB Output is correct
18 Correct 11 ms 8028 KB Output is correct
19 Correct 8 ms 7768 KB Output is correct
20 Correct 24 ms 8180 KB Output is correct
21 Correct 23 ms 8044 KB Output is correct
22 Correct 3 ms 5208 KB Output is correct
23 Correct 7 ms 7516 KB Output is correct
24 Correct 6 ms 7516 KB Output is correct
25 Correct 2 ms 5212 KB Output is correct
26 Correct 3 ms 5212 KB Output is correct
27 Correct 8 ms 7996 KB Output is correct
28 Correct 7 ms 7764 KB Output is correct
29 Correct 6 ms 7516 KB Output is correct
30 Correct 7 ms 7516 KB Output is correct
31 Correct 4 ms 5464 KB Output is correct
32 Correct 3 ms 5212 KB Output is correct
33 Correct 3 ms 5212 KB Output is correct
34 Correct 4 ms 5212 KB Output is correct
35 Correct 3 ms 5212 KB Output is correct
36 Correct 77 ms 41168 KB Output is correct
37 Correct 3 ms 5212 KB Output is correct
38 Correct 73 ms 40892 KB Output is correct
39 Correct 66 ms 40272 KB Output is correct
40 Correct 84 ms 41160 KB Output is correct
41 Correct 80 ms 41720 KB Output is correct
42 Correct 84 ms 36432 KB Output is correct
43 Correct 74 ms 32872 KB Output is correct
44 Correct 72 ms 32596 KB Output is correct
45 Correct 75 ms 32696 KB Output is correct
46 Correct 71 ms 32532 KB Output is correct
47 Correct 64 ms 36740 KB Output is correct
48 Correct 67 ms 36432 KB Output is correct
49 Correct 70 ms 36516 KB Output is correct
50 Correct 81 ms 36688 KB Output is correct
51 Correct 80 ms 41380 KB Output is correct
52 Correct 78 ms 41172 KB Output is correct
53 Correct 66 ms 32496 KB Output is correct
54 Correct 66 ms 32592 KB Output is correct
55 Correct 88 ms 32420 KB Output is correct
56 Correct 92 ms 32592 KB Output is correct
57 Correct 71 ms 32692 KB Output is correct
58 Correct 84 ms 32648 KB Output is correct
59 Correct 82 ms 32680 KB Output is correct
60 Correct 75 ms 32960 KB Output is correct
61 Correct 80 ms 36764 KB Output is correct
62 Correct 71 ms 36932 KB Output is correct
63 Correct 64 ms 36804 KB Output is correct
64 Correct 95 ms 36688 KB Output is correct
65 Correct 69 ms 32596 KB Output is correct
66 Correct 77 ms 32596 KB Output is correct
67 Correct 79 ms 32504 KB Output is correct
68 Correct 58 ms 32340 KB Output is correct
69 Correct 62 ms 32312 KB Output is correct
70 Correct 69 ms 37080 KB Output is correct
71 Correct 79 ms 36428 KB Output is correct
72 Correct 2 ms 5212 KB Output is correct
73 Correct 6 ms 7516 KB Output is correct
74 Correct 9 ms 7652 KB Output is correct
75 Correct 3 ms 5208 KB Output is correct
76 Correct 3 ms 5212 KB Output is correct
77 Correct 7 ms 8136 KB Output is correct
78 Correct 7 ms 7772 KB Output is correct
79 Correct 6 ms 7512 KB Output is correct
80 Correct 8 ms 7488 KB Output is correct
81 Correct 3 ms 5212 KB Output is correct
82 Correct 3 ms 5212 KB Output is correct
83 Correct 3 ms 5212 KB Output is correct
84 Correct 3 ms 5212 KB Output is correct
85 Correct 3 ms 5212 KB Output is correct
86 Correct 34 ms 8056 KB Output is correct
87 Correct 33 ms 8024 KB Output is correct
88 Correct 26 ms 8060 KB Output is correct
89 Correct 7 ms 8028 KB Output is correct
90 Correct 7 ms 7768 KB Output is correct
91 Correct 15 ms 8248 KB Output is correct
92 Correct 27 ms 8080 KB Output is correct
93 Correct 3 ms 5212 KB Output is correct
94 Correct 77 ms 41340 KB Output is correct
95 Correct 71 ms 40904 KB Output is correct
96 Correct 68 ms 40408 KB Output is correct
97 Correct 107 ms 41164 KB Output is correct
98 Correct 80 ms 41680 KB Output is correct
99 Correct 67 ms 32584 KB Output is correct
100 Correct 63 ms 32640 KB Output is correct
101 Correct 84 ms 32592 KB Output is correct
102 Correct 66 ms 32836 KB Output is correct
103 Correct 66 ms 36572 KB Output is correct
104 Correct 72 ms 36988 KB Output is correct
105 Correct 63 ms 36388 KB Output is correct
106 Correct 69 ms 36688 KB Output is correct
107 Correct 72 ms 36436 KB Output is correct
108 Correct 82 ms 41372 KB Output is correct
109 Correct 79 ms 41304 KB Output is correct
110 Correct 63 ms 32432 KB Output is correct
111 Correct 65 ms 32348 KB Output is correct
112 Correct 72 ms 32596 KB Output is correct
113 Correct 74 ms 32620 KB Output is correct