oj.uz

Submission #584753

# Submission time Handle Problem Language Result Execution time Memory
584753 2022-06-28T01:41:34 Z Huy Railway (BOI17_railway) C++17
100 / 100
 112 ms 25800 KB 
#include<bits/stdc++.h>
//#define int long long
#define pii pair<int,ll>
#define fi first
#define se second
/*#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")*/
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ldb = long double;
const ll N = (int)1e9 + 1;
const int maxN = (int)2e5 + 1;
const int mod = 1e9 + 7;
//const int mod = 998244353;
const int infty = 2e9 + 7;
const int base = (int)4e5;

void InputFile()
{
    //freopen("scrivener.inp","r",stdin);
    //freopen("scrivener.out","w",stdout);
    //freopen("test.out","r",stdin);
}

void FastInput()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
}

int n,m,k;
vector<vector<int>> adj;
int x[maxN],y[maxN];

void Read()
{
    cin >> n >> m >> k;
    adj.resize(n+1);
    for(int i = 1;i < n;i++)
    {
        cin >> x[i] >> y[i];
        adj[x[i]].push_back(i);
        adj[y[i]].push_back(i);
    }
}

int TimeDFS = 0;
int sta[maxN];
int of_edge[maxN];
int anc[25][maxN];
int depth[maxN];
int dp[maxN];

void PreDFS(int u,int p)
{
    sta[u] = ++TimeDFS;
    for(int i : adj[u])
    {
        int v = x[i] + y[i] - u;
        if(v == p) continue;
        of_edge[v] = i;
        depth[v] = depth[u] + 1;
        anc[0][v] = u;
        for(int i = 1;(1 << i) <= n;i++)
        {
            anc[i][v] = anc[i-1][anc[i-1][v]];
        }
        PreDFS(v,u);
    }
}

int LCA(int u,int v)
{
    if(depth[u] < depth[v]) swap(u,v);
    int k = (depth[u] - depth[v]);
    for(int i = log2(n);i >= 0;i--)
    {
        if(k & (1 << i))
        {
            u = anc[i][u];
            k ^= (1 << i);
        }
    }
    if(u == v) return u;
    for(int i = log2(n);i >= 0;i--)
    {
        if(anc[i][u] != anc[i][v])
        {
            u = anc[i][u];
            v = anc[i][v];
        }
    }
    return anc[0][u];
}

bool FA(int i,int j)
{
    return sta[i] < sta[j];
}

void DFS(int u,int p)
{
    for(int i : adj[u])
    {
        int v = x[i] + y[i] - u;
        if(v == p) continue;
        DFS(v,u);
        dp[u] += dp[v];
    }
}

void Solve()
{
    PreDFS(1,0);
    while(m--)
    {
        int sz;
        cin >> sz;
        vector<int> chosen;
        chosen.resize(sz);
        for(int i = 0;i < sz;i++)
        {
            cin >> chosen[i];
            dp[chosen[i]]++;
        }
        sort(chosen.begin(),chosen.end(),FA);
        for(int i = 0;i < sz;i++)
        {
            int nxt = (i + 1) % sz;
            dp[LCA(chosen[i],chosen[nxt])]--;
        }
    }
    DFS(1,0);
    vector<int> res;
    for(int i = 2;i <= n;i++)
    {
        if(dp[i] >= k)
        {
            res.push_back(of_edge[i]);
        }
    }

    //cout << of_edge[6];return;
    sort(res.begin(),res.end());
    cout << res.size() <<'\n';
    for(int i : res)
        cout << i <<' ';
}

void Debug()
{

}


int32_t main()
{
    FastInput();
    //InputFile();
    //int sub_type;
    //cin >> sub_type;
    //Sieve();
    //Prepare();
    int test;
    //cin >> test;
    test = 1;
    while(test--)
        //for(int prc = 1; prc <= test; prc++)
    {
        Read();
        Solve();
        //Debug();
    }
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 4 ms 1876 KB Output is correct
3 Correct 4 ms 1880 KB Output is correct
4 Correct 0 ms 324 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 5 ms 2260 KB Output is correct
7 Correct 5 ms 1968 KB Output is correct
8 Correct 4 ms 1876 KB Output is correct
9 Correct 4 ms 1876 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 324 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 4 ms 1876 KB Output is correct
3 Correct 4 ms 1880 KB Output is correct
4 Correct 0 ms 324 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 5 ms 2260 KB Output is correct
7 Correct 5 ms 1968 KB Output is correct
8 Correct 4 ms 1876 KB Output is correct
9 Correct 4 ms 1876 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 324 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 19 ms 2244 KB Output is correct
16 Correct 27 ms 2272 KB Output is correct
17 Correct 25 ms 2252 KB Output is correct
18 Correct 5 ms 2272 KB Output is correct
19 Correct 5 ms 1872 KB Output is correct
20 Correct 26 ms 2372 KB Output is correct
21 Correct 23 ms 2260 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 5 ms 1876 KB Output is correct
24 Correct 5 ms 1876 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 5 ms 2276 KB Output is correct
28 Correct 5 ms 1876 KB Output is correct
29 Correct 3 ms 1876 KB Output is correct
30 Correct 4 ms 1876 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 25388 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 90 ms 25020 KB Output is correct
4 Correct 80 ms 24452 KB Output is correct
5 Correct 73 ms 25340 KB Output is correct
6 Correct 72 ms 25800 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 20556 KB Output is correct
2 Correct 102 ms 17168 KB Output is correct
3 Correct 95 ms 16792 KB Output is correct
4 Correct 92 ms 16796 KB Output is correct
5 Correct 93 ms 16788 KB Output is correct
6 Correct 78 ms 20812 KB Output is correct
7 Correct 86 ms 20640 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 20556 KB Output is correct
2 Correct 102 ms 17168 KB Output is correct
3 Correct 95 ms 16792 KB Output is correct
4 Correct 92 ms 16796 KB Output is correct
5 Correct 93 ms 16788 KB Output is correct
6 Correct 78 ms 20812 KB Output is correct
7 Correct 86 ms 20640 KB Output is correct
8 Correct 110 ms 20812 KB Output is correct
9 Correct 77 ms 20808 KB Output is correct
10 Correct 67 ms 25468 KB Output is correct
11 Correct 66 ms 25404 KB Output is correct
12 Correct 71 ms 16588 KB Output is correct
13 Correct 65 ms 16600 KB Output is correct
14 Correct 105 ms 16668 KB Output is correct
15 Correct 112 ms 16704 KB Output is correct
16 Correct 104 ms 16784 KB Output is correct
17 Correct 98 ms 16684 KB Output is correct
18 Correct 92 ms 16908 KB Output is correct
19 Correct 89 ms 17172 KB Output is correct
20 Correct 73 ms 20944 KB Output is correct
21 Correct 100 ms 21112 KB Output is correct
22 Correct 79 ms 20940 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 4 ms 1876 KB Output is correct
3 Correct 4 ms 1880 KB Output is correct
4 Correct 0 ms 324 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 5 ms 2260 KB Output is correct
7 Correct 5 ms 1968 KB Output is correct
8 Correct 4 ms 1876 KB Output is correct
9 Correct 4 ms 1876 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 324 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 19 ms 2244 KB Output is correct
16 Correct 27 ms 2272 KB Output is correct
17 Correct 25 ms 2252 KB Output is correct
18 Correct 5 ms 2272 KB Output is correct
19 Correct 5 ms 1872 KB Output is correct
20 Correct 26 ms 2372 KB Output is correct
21 Correct 23 ms 2260 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 5 ms 1876 KB Output is correct
24 Correct 5 ms 1876 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 5 ms 2276 KB Output is correct
28 Correct 5 ms 1876 KB Output is correct
29 Correct 3 ms 1876 KB Output is correct
30 Correct 4 ms 1876 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 86 ms 25388 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 90 ms 25020 KB Output is correct
39 Correct 80 ms 24452 KB Output is correct
40 Correct 73 ms 25340 KB Output is correct
41 Correct 72 ms 25800 KB Output is correct
42 Correct 68 ms 20556 KB Output is correct
43 Correct 102 ms 17168 KB Output is correct
44 Correct 95 ms 16792 KB Output is correct
45 Correct 92 ms 16796 KB Output is correct
46 Correct 93 ms 16788 KB Output is correct
47 Correct 78 ms 20812 KB Output is correct
48 Correct 86 ms 20640 KB Output is correct
49 Correct 110 ms 20812 KB Output is correct
50 Correct 77 ms 20808 KB Output is correct
51 Correct 67 ms 25468 KB Output is correct
52 Correct 66 ms 25404 KB Output is correct
53 Correct 71 ms 16588 KB Output is correct
54 Correct 65 ms 16600 KB Output is correct
55 Correct 105 ms 16668 KB Output is correct
56 Correct 112 ms 16704 KB Output is correct
57 Correct 104 ms 16784 KB Output is correct
58 Correct 98 ms 16684 KB Output is correct
59 Correct 92 ms 16908 KB Output is correct
60 Correct 89 ms 17172 KB Output is correct
61 Correct 73 ms 20944 KB Output is correct
62 Correct 100 ms 21112 KB Output is correct
63 Correct 79 ms 20940 KB Output is correct
64 Correct 74 ms 20940 KB Output is correct
65 Correct 104 ms 16780 KB Output is correct
66 Correct 107 ms 16664 KB Output is correct
67 Correct 98 ms 16668 KB Output is correct
68 Correct 61 ms 16540 KB Output is correct
69 Correct 63 ms 16540 KB Output is correct
70 Correct 86 ms 21160 KB Output is correct
71 Correct 88 ms 20556 KB Output is correct
72 Correct 0 ms 340 KB Output is correct
73 Correct 5 ms 1876 KB Output is correct
74 Correct 4 ms 1876 KB Output is correct
75 Correct 0 ms 340 KB Output is correct
76 Correct 0 ms 340 KB Output is correct
77 Correct 5 ms 2332 KB Output is correct
78 Correct 5 ms 1880 KB Output is correct
79 Correct 4 ms 1876 KB Output is correct
80 Correct 4 ms 1876 KB Output is correct
81 Correct 1 ms 340 KB Output is correct
82 Correct 1 ms 340 KB Output is correct
83 Correct 1 ms 340 KB Output is correct
84 Correct 1 ms 340 KB Output is correct
85 Correct 1 ms 340 KB Output is correct
86 Correct 20 ms 2236 KB Output is correct
87 Correct 19 ms 2260 KB Output is correct
88 Correct 20 ms 2260 KB Output is correct
89 Correct 6 ms 2264 KB Output is correct
90 Correct 5 ms 1876 KB Output is correct
91 Correct 21 ms 2444 KB Output is correct
92 Correct 23 ms 2320 KB Output is correct
93 Correct 0 ms 340 KB Output is correct
94 Correct 78 ms 25344 KB Output is correct
95 Correct 86 ms 25020 KB Output is correct
96 Correct 72 ms 24436 KB Output is correct
97 Correct 72 ms 25416 KB Output is correct
98 Correct 75 ms 25732 KB Output is correct
99 Correct 98 ms 16792 KB Output is correct
100 Correct 98 ms 16708 KB Output is correct
101 Correct 103 ms 16788 KB Output is correct
102 Correct 96 ms 17188 KB Output is correct
103 Correct 75 ms 20684 KB Output is correct
104 Correct 69 ms 21100 KB Output is correct
105 Correct 68 ms 20628 KB Output is correct
106 Correct 103 ms 20940 KB Output is correct
107 Correct 92 ms 20740 KB Output is correct
108 Correct 68 ms 25528 KB Output is correct
109 Correct 70 ms 25596 KB Output is correct
110 Correct 66 ms 16580 KB Output is correct
111 Correct 74 ms 16604 KB Output is correct
112 Correct 96 ms 16652 KB Output is correct
113 Correct 95 ms 16660 KB Output is correct