oj.uz

Submission #500855

# Submission time Handle Problem Language Result Execution time Memory
500855 2022-01-01T12:40:34 Z MohamedAliSaidane Railway (BOI17_railway) C++14
100 / 100
 507 ms 36020 KB 
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef tuple<int,int,int> ti;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<ld,ld> pld;
#define pb push_back
#define popb pop_back()
#define pf push_front
#define popf pop_front
#define ff first
#define ss second
#define MOD (ll)(1000000007)
#define INF (ll) (1e18)
#define all(v) (v).begin(),(v).end()
const int nx[8] = {0, 0, 1, -1,1,1,-1,-1}, ny[8] = {1, -1, 0, 0,1,-1,1,-1}; //East, West, South, North+
ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;}
ll lcm(ll a, ll b){return (a / gcd(a, b)) * b;}
////////////******SOLUTION******\\\\\\\\\\\

const int MAX_N = 2e5 + 4;;

int n, m, k, sz = 1;
vi adj[MAX_N];
int heavy[MAX_N];
vi st, lazy;
int p[MAX_N];
int head[MAX_N];
int subtree[MAX_N];
int d[MAX_N];
int eul[MAX_N];
int cur_eul = -1;
map<pii,int> key;
bool comp(int a, int b)
{
    return eul[a] < eul[b];
}
void propagate(int p, int l, int r)
{
    if(lazy[p] != 0)
    {
        st[p] += lazy[p] * (r-l+1);
        if(l != r)
        {
            lazy[2*p] += lazy[p];
            lazy[2*p+1] += lazy[p];
        }
        lazy[p] = 0;
    }
}
int query(int p, int l, int r, int i, int j)
{
    propagate(p,l,r);
    if( i > j)
        return 0;
    if(l >= i && r <= j)
        return st[p];
    int mid = (l+r)/2;
    return query(2*p,l,mid,i,min(mid,j))
        + query(2*p+1,mid+1,r,max(i,mid+1),j);
}
void update(int p, int l, int r, int i, int j, int val)
{
    propagate(p,l,r);
    if(i > j )
        return ;
    if(l >= i && r <= j)
    {
        lazy[p] += val;
        propagate(p,l,r);
    }
    else
    {
        int mid = (l+r)/2;
        update(2*p,l,mid,i,min(j,mid),val);
        update(2*p+1,mid+1,r,max(i,mid+1),j,val);
        int lsubtree = (lazy[2*p] * (r-l+1))/2 + st[2*p];
        int rsubtree = (lazy[2*p+1] * (r-l+1))/2 + st[2*p+1];
        st[p] = lsubtree + rsubtree;
    }
}
void dfs(int x, int par)
{
    d[x] = d[par] + 1;
    p[x] = par;
    subtree[x] = 1;
    for(auto e: adj[x])
    {
        if(e == par) continue;
        dfs(e,x);
        subtree[x] += subtree[e];
        if(subtree[e] > subtree[heavy[x]])
            heavy[x] = e;
    }
}
void decompose(int x, int h)
{
    head[x] = h;
    eul[x] = ++cur_eul;
    if(heavy[x] != 0)
        decompose(heavy[x],h);
    for(auto e: adj[x])
    {
        if(e != p[x] && e != heavy[x])
        {
            decompose(e,e);
        }
    }
}
void upd(int a, int b)
{
    for(;head[a] != head[b]; b = p[head[b]])
    {
        if(d[head[a]] > d[head[b]])
            swap(a,b);
        update(1,0,sz-1,eul[head[b]],eul[b],1);
    }
    if(d[a] > d[b])
        swap(a,b);
    update(1,0,sz-1,eul[a]+1,eul[b],1);
    return ;
}
void solve()
{
    cin >> n >> m >> k;
    while(sz < n) sz = (sz << 1);
    st.assign(2*sz+1,0);
    lazy.assign(2*sz+1,0);
    for(int i = 1; i <n; i ++)
    {
        int a,b;
        cin >> a >> b;
        adj[a].pb(b);
        adj[b].pb(a);
        key[{a,b}] = key[{b,a}] = i;
    }
    d[0] = -1;
    dfs(1,0);
    decompose(1,1);
    for(int i = 1; i<= m; i ++)
    {
        int s; cin >> s;
        int nodes[s];
        for(int j = 0; j <s; j ++)
            cin >> nodes[j];
        sort(nodes,nodes+s,comp);
        for(int j = 0; j <s; j ++)
        {
            int u =nodes[j];
            int v = nodes[(j+1)%s];
            upd(u,v);
        }
    }
    vi ans;
    for(int i=  2; i <=n; i ++)
    {
        int val = query(1,0,sz-1,eul[i],eul[i]);
        if(val >= 2*k)
        {
            ans.pb(key[{i,p[i]}]);
        }
    }
    sort(all(ans));
    cout << ans.size() << '\n';
    for(auto e: ans)
        cout << e << ' ';
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    int tt =1;
    while(tt--)
    {
        solve();
    }

}
/*

*/

Compilation message

railway.cpp:24:1: warning: multi-line comment [-Wcomment]
   24 | ////////////******SOLUTION******\\\\\\\\\\\
      | ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5024 KB Output is correct
2 Correct 13 ms 7204 KB Output is correct
3 Correct 15 ms 7116 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 5032 KB Output is correct
6 Correct 13 ms 7628 KB Output is correct
7 Correct 13 ms 7236 KB Output is correct
8 Correct 12 ms 7212 KB Output is correct
9 Correct 14 ms 7100 KB Output is correct
10 Correct 2 ms 5020 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 5024 KB Output is correct
13 Correct 2 ms 4940 KB Output is correct
14 Correct 2 ms 4940 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5024 KB Output is correct
2 Correct 13 ms 7204 KB Output is correct
3 Correct 15 ms 7116 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 5032 KB Output is correct
6 Correct 13 ms 7628 KB Output is correct
7 Correct 13 ms 7236 KB Output is correct
8 Correct 12 ms 7212 KB Output is correct
9 Correct 14 ms 7100 KB Output is correct
10 Correct 2 ms 5020 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 5024 KB Output is correct
13 Correct 2 ms 4940 KB Output is correct
14 Correct 2 ms 4940 KB Output is correct
15 Correct 81 ms 7572 KB Output is correct
16 Correct 77 ms 7604 KB Output is correct
17 Correct 75 ms 7576 KB Output is correct
18 Correct 14 ms 7620 KB Output is correct
19 Correct 14 ms 7320 KB Output is correct
20 Correct 70 ms 7640 KB Output is correct
21 Correct 66 ms 7608 KB Output is correct
22 Correct 3 ms 5012 KB Output is correct
23 Correct 19 ms 7236 KB Output is correct
24 Correct 14 ms 7212 KB Output is correct
25 Correct 3 ms 4940 KB Output is correct
26 Correct 2 ms 4940 KB Output is correct
27 Correct 14 ms 7756 KB Output is correct
28 Correct 13 ms 7224 KB Output is correct
29 Correct 12 ms 7096 KB Output is correct
30 Correct 13 ms 7212 KB Output is correct
31 Correct 2 ms 4940 KB Output is correct
32 Correct 3 ms 4940 KB Output is correct
33 Correct 3 ms 4940 KB Output is correct
34 Correct 2 ms 5020 KB Output is correct
35 Correct 3 ms 5024 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 210 ms 35612 KB Output is correct
2 Correct 2 ms 4940 KB Output is correct
3 Correct 169 ms 35232 KB Output is correct
4 Correct 175 ms 34628 KB Output is correct
5 Correct 172 ms 35548 KB Output is correct
6 Correct 171 ms 35972 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 225 ms 30756 KB Output is correct
2 Correct 297 ms 27356 KB Output is correct
3 Correct 369 ms 26912 KB Output is correct
4 Correct 442 ms 26916 KB Output is correct
5 Correct 368 ms 26912 KB Output is correct
6 Correct 209 ms 31104 KB Output is correct
7 Correct 225 ms 30800 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 225 ms 30756 KB Output is correct
2 Correct 297 ms 27356 KB Output is correct
3 Correct 369 ms 26912 KB Output is correct
4 Correct 442 ms 26916 KB Output is correct
5 Correct 368 ms 26912 KB Output is correct
6 Correct 209 ms 31104 KB Output is correct
7 Correct 225 ms 30800 KB Output is correct
8 Correct 259 ms 30920 KB Output is correct
9 Correct 232 ms 31040 KB Output is correct
10 Correct 161 ms 35700 KB Output is correct
11 Correct 170 ms 35704 KB Output is correct
12 Correct 180 ms 26468 KB Output is correct
13 Correct 189 ms 26436 KB Output is correct
14 Correct 350 ms 26948 KB Output is correct
15 Correct 323 ms 26960 KB Output is correct
16 Correct 407 ms 26896 KB Output is correct
17 Correct 416 ms 26984 KB Output is correct
18 Correct 364 ms 26896 KB Output is correct
19 Correct 287 ms 27484 KB Output is correct
20 Correct 226 ms 31220 KB Output is correct
21 Correct 247 ms 31424 KB Output is correct
22 Correct 282 ms 31140 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5024 KB Output is correct
2 Correct 13 ms 7204 KB Output is correct
3 Correct 15 ms 7116 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 5032 KB Output is correct
6 Correct 13 ms 7628 KB Output is correct
7 Correct 13 ms 7236 KB Output is correct
8 Correct 12 ms 7212 KB Output is correct
9 Correct 14 ms 7100 KB Output is correct
10 Correct 2 ms 5020 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 5024 KB Output is correct
13 Correct 2 ms 4940 KB Output is correct
14 Correct 2 ms 4940 KB Output is correct
15 Correct 81 ms 7572 KB Output is correct
16 Correct 77 ms 7604 KB Output is correct
17 Correct 75 ms 7576 KB Output is correct
18 Correct 14 ms 7620 KB Output is correct
19 Correct 14 ms 7320 KB Output is correct
20 Correct 70 ms 7640 KB Output is correct
21 Correct 66 ms 7608 KB Output is correct
22 Correct 3 ms 5012 KB Output is correct
23 Correct 19 ms 7236 KB Output is correct
24 Correct 14 ms 7212 KB Output is correct
25 Correct 3 ms 4940 KB Output is correct
26 Correct 2 ms 4940 KB Output is correct
27 Correct 14 ms 7756 KB Output is correct
28 Correct 13 ms 7224 KB Output is correct
29 Correct 12 ms 7096 KB Output is correct
30 Correct 13 ms 7212 KB Output is correct
31 Correct 2 ms 4940 KB Output is correct
32 Correct 3 ms 4940 KB Output is correct
33 Correct 3 ms 4940 KB Output is correct
34 Correct 2 ms 5020 KB Output is correct
35 Correct 3 ms 5024 KB Output is correct
36 Correct 210 ms 35612 KB Output is correct
37 Correct 2 ms 4940 KB Output is correct
38 Correct 169 ms 35232 KB Output is correct
39 Correct 175 ms 34628 KB Output is correct
40 Correct 172 ms 35548 KB Output is correct
41 Correct 171 ms 35972 KB Output is correct
42 Correct 225 ms 30756 KB Output is correct
43 Correct 297 ms 27356 KB Output is correct
44 Correct 369 ms 26912 KB Output is correct
45 Correct 442 ms 26916 KB Output is correct
46 Correct 368 ms 26912 KB Output is correct
47 Correct 209 ms 31104 KB Output is correct
48 Correct 225 ms 30800 KB Output is correct
49 Correct 259 ms 30920 KB Output is correct
50 Correct 232 ms 31040 KB Output is correct
51 Correct 161 ms 35700 KB Output is correct
52 Correct 170 ms 35704 KB Output is correct
53 Correct 180 ms 26468 KB Output is correct
54 Correct 189 ms 26436 KB Output is correct
55 Correct 350 ms 26948 KB Output is correct
56 Correct 323 ms 26960 KB Output is correct
57 Correct 407 ms 26896 KB Output is correct
58 Correct 416 ms 26984 KB Output is correct
59 Correct 364 ms 26896 KB Output is correct
60 Correct 287 ms 27484 KB Output is correct
61 Correct 226 ms 31220 KB Output is correct
62 Correct 247 ms 31424 KB Output is correct
63 Correct 282 ms 31140 KB Output is correct
64 Correct 226 ms 31068 KB Output is correct
65 Correct 507 ms 27092 KB Output is correct
66 Correct 417 ms 26940 KB Output is correct
67 Correct 346 ms 26820 KB Output is correct
68 Correct 178 ms 26440 KB Output is correct
69 Correct 176 ms 26312 KB Output is correct
70 Correct 280 ms 31440 KB Output is correct
71 Correct 214 ms 30808 KB Output is correct
72 Correct 3 ms 4940 KB Output is correct
73 Correct 13 ms 7236 KB Output is correct
74 Correct 13 ms 7116 KB Output is correct
75 Correct 3 ms 5028 KB Output is correct
76 Correct 3 ms 5008 KB Output is correct
77 Correct 13 ms 7616 KB Output is correct
78 Correct 15 ms 7244 KB Output is correct
79 Correct 12 ms 7220 KB Output is correct
80 Correct 15 ms 7212 KB Output is correct
81 Correct 3 ms 4940 KB Output is correct
82 Correct 3 ms 4940 KB Output is correct
83 Correct 4 ms 4940 KB Output is correct
84 Correct 3 ms 4940 KB Output is correct
85 Correct 3 ms 4940 KB Output is correct
86 Correct 68 ms 7492 KB Output is correct
87 Correct 71 ms 7572 KB Output is correct
88 Correct 72 ms 7564 KB Output is correct
89 Correct 15 ms 7628 KB Output is correct
90 Correct 14 ms 7316 KB Output is correct
91 Correct 64 ms 7620 KB Output is correct
92 Correct 82 ms 7608 KB Output is correct
93 Correct 3 ms 4952 KB Output is correct
94 Correct 182 ms 35620 KB Output is correct
95 Correct 172 ms 35284 KB Output is correct
96 Correct 162 ms 34712 KB Output is correct
97 Correct 169 ms 35584 KB Output is correct
98 Correct 204 ms 36020 KB Output is correct
99 Correct 395 ms 27108 KB Output is correct
100 Correct 420 ms 27092 KB Output is correct
101 Correct 488 ms 26992 KB Output is correct
102 Correct 310 ms 27392 KB Output is correct
103 Correct 242 ms 30916 KB Output is correct
104 Correct 226 ms 31292 KB Output is correct
105 Correct 226 ms 30860 KB Output is correct
106 Correct 219 ms 31044 KB Output is correct
107 Correct 227 ms 31008 KB Output is correct
108 Correct 158 ms 35608 KB Output is correct
109 Correct 160 ms 35700 KB Output is correct
110 Correct 179 ms 26436 KB Output is correct
111 Correct 215 ms 26400 KB Output is correct
112 Correct 339 ms 26848 KB Output is correct
113 Correct 320 ms 26820 KB Output is correct