oj.uz

Submission #185354

# Submission time Handle Problem Language Result Execution time Memory
185354 2020-01-11T11:23:17 Z nicolaalexandra Railway (BOI17_railway) C++14
100 / 100
 758 ms 131944 KB 
#include <bits/stdc++.h>
#define DIM 1000010
using namespace std;
int whatChain[DIM],positionInChain[DIM],chainFatherNode[DIM],Size[DIM],level[DIM];
int viz[DIM],low[DIM],niv[DIM],b[DIM],E[DIM*3],first[DIM],fth[DIM],p[DIM],v[DIM];
pair <int,int> rmq[20][DIM*3];
map <pair<int,int>,int> mch;
vector <int> chains[DIM],L[DIM],sol;
vector <pair<int,int> > a[DIM];
int n,m,k,i,j,nod,nr_chains,x,y,nr,lca,aux,K;
void dfs (int nod, int tata){
    E[++k] = nod;
    first[nod] = k;
    niv[nod] = 1 + niv[tata];
    fth[nod] = tata;
    for (auto vecin:L[nod]){
        if (vecin != tata){
            dfs (vecin,nod);
            E[++k] = nod;
        }}
}
void pre_dfs (int nod, int tata){
    viz[nod] = Size[nod] = 1;
    level[nod] = 1+level[tata];
    int ok = 0;
    for (int i=0;i<L[nod].size();i++){
        int vecin = L[nod][i];
        if (!viz[vecin]){
            ok = 1;
            pre_dfs (vecin,nod);
            Size[nod] += Size[vecin]; /// cate noduri am in subarbore
        }}
    if (!ok){ /// inseamna ca e frunza deci incep un nou lant
        nr_chains++;
        chains[nr_chains].push_back(0); /// le vreau indexate de la 1
        chains[nr_chains].push_back(nod);
        whatChain[nod] = nr_chains; /// pe ce lant se afla x
        positionInChain[nod] = 1; /// pozitia in lant
    } else {
        /// pun nodul curent la capatul lantului fiului cel mai "greu", adica cel care Size ul maxim
        int maxim = 0, poz = 0;
        for (int i=0;i<L[nod].size();i++){
            int fiu = L[nod][i];
            if (fiu == tata)
                continue;
            if (Size[fiu] > maxim){
                maxim = Size[fiu];
                poz = fiu;
            }}
        /// acum il atasez la fiu
        chains[whatChain[poz]].push_back(nod);
        whatChain[nod] = whatChain[poz];
        positionInChain[nod] = chains[whatChain[poz]].size()-1;
        /// acum calculez chain father node
        for (int i=0;i<L[nod].size();i++){
            int fiu = L[nod][i];
            if (fiu == tata)
                continue;
            if (fiu != poz)
                chainFatherNode[whatChain[fiu]] = nod;
        }}}

void update_lazy (int chain, int nod, int st, int dr){
    a[chain][nod].first += (dr-st+1)*a[chain][nod].second;
    if (st != dr){
        a[chain][2*nod].second += a[chain][nod].second;
        a[chain][2*nod+1].second += a[chain][nod].second;
    }
    a[chain][nod].second = 0;
    return;
}
void update_aint (int chain, int nod, int st, int dr, int x, int y, int val){
    update_lazy(chain,nod,st,dr);
    if (st > dr || x > y || x > dr || y < st)
        return;
    if (x <= st && dr <= y){
        a[chain][nod].second += val;
        update_lazy (chain,nod,st,dr);
        return;
    }
    int mid = (st+dr)/2;
    update_aint(chain,2*nod,st,mid,x,y,val);
    update_aint(chain,2*nod+1,mid+1,dr,x,y,val);
    a[chain][nod].first = a[chain][2*nod].first + a[chain][2*nod+1].first;
    return;
}
int query_aint (int chain, int nod, int st, int dr, int poz){
    update_lazy(chain,nod,st,dr);
    if (st == dr)
        return a[chain][nod].first;

    int mid = (st+dr)>>1;
    if (poz <= mid)
        query_aint (chain,nod<<1,st,mid,poz);
    else query_aint (chain,(nod<<1)|1,mid+1,dr,poz);
}
void update_heavy (int x, int y, int val){
    if (whatChain[x] == whatChain[y]){
        int posx = positionInChain[x], posy = positionInChain[y];
        if (posx > posy)
            swap (posx,posy);
        if (x == nod)
            posx++;
        if (y == nod)
            posy--;
        if (posx > posy)
            return;
        update_aint (whatChain[x],1,1,chains[whatChain[x]].size()-1,posx,posy,val);
        return;
    }

    if (level[chainFatherNode[whatChain[x]]] <= level[chainFatherNode[whatChain[y]]])
        swap (x,y);


    int poz_st = positionInChain[x], poz_dr = chains[whatChain[x]].size()-1;
    if (chains[whatChain[x]][poz_st] == nod)
        poz_st++;
    if (chains[whatChain[x]][poz_dr] == nod)
        poz_dr--;
    if (poz_st <= poz_dr)
        update_aint (whatChain[x],1,1,chains[whatChain[x]].size()-1,poz_st,poz_dr,val);
    int nr = chainFatherNode[whatChain[x]];
    update_heavy (nr,y,val);
}

int get_lca (int x, int y){
    int pozx = first[x], pozy = first[y];
    if (pozx > pozy)
        swap (pozx,pozy);
    int nr = p[pozy-pozx+1];
    pair <int,int> sol = min (rmq[nr][pozx],rmq[nr][pozy-(1<<nr)+1]);
    return E[sol.second];
}
inline int cmp (int a, int b){
    return first[a] < first[b];
}
int main (){
    //ifstream cin ("date.in");
    //ofstream cout ("date.out");

    cin>>n>>m>>K;
    for (i=1;i<n;i++){
        cin>>x>>y;
        L[x].push_back(y);
        L[y].push_back(x);
        mch[make_pair(x,y)] = i;
        mch[make_pair(y,x)] = i;
    }

    dfs (1,0);

    for (i=1;i<=k;i++)
        rmq[0][i] = make_pair(niv[E[i]],i);

    for (i=1;(1<<i)<=k;i++)
        for (j=1;j<=k;j++){
            rmq[i][j] = rmq[i-1][j];
            if (j+(1<<(i-1)) <= k && rmq[i-1][j+(1<<(i-1))].first < rmq[i][j].first)
                rmq[i][j] = rmq[i-1][j+(1<<(i-1))];
        }

    for (i=2;i<=k;i++)
        p[i] = p[i/2]+1;

    /// heavy
    pre_dfs(1,0);
    for (i=1;i<=nr_chains;i++){
        for (int j=0;j<2*chains[i].size();j++)
            a[i].push_back(make_pair(0,0));
    }

    for (i=1;i<=m;i++){
        cin>>nr;
        for (j=1;j<=nr;j++)
            cin>>v[j];
        /// determin lca-ul tuturor
        int lca = get_lca (v[1],v[2]);
        for (j=3;j<=nr;j++)
            lca = get_lca (lca,v[j]);
        v[++nr] = lca;
        sort (v+1,v+nr+1,cmp);
        /// elimin dublurile
        int nr2 = 1;
        for (j=2;j<=nr;j++)
            v[++nr2] = v[j];
        nr = nr2;

        aux = v[1];
        for (j=2;j<=nr;j++){

            lca = get_lca (aux,v[j]);
            /// fac update pe lantul lca...v[j], dar nu trb sa fac si in lca
            nod = lca;
            update_heavy(v[j],lca,1);

            aux = v[j];
        }

        /*s.clear();
        s.push_back(v[1]);
        for (i=2;i<=n;i++){
            /// elimin din stiva cat timp nu e un stramos
            while (!s.empty() && verif(v[s.back()],v[i]))
                s.pop_back();
            x = v[s.back()], y = v[i];
            /// trb sa fac update pe lantul asta, dar sa nu fac update in x!!
            nod = x;
            update_heavy (x,y,1);
        }*/

    }
    for (i=2;i<=n;i++){
        int val = query_aint (whatChain[i],1,1,chains[whatChain[i]].size()-1,positionInChain[i]);
        if (val >= K)
            sol.push_back(mch[make_pair(i,fth[i])]);
    }

    sort (sol.begin(),sol.end());
    cout<<sol.size()<<"\n";
    for (auto it:sol)
        cout<<it<<" ";


    return 0;
}

Compilation message

railway.cpp: In function 'void pre_dfs(int, int)':
railway.cpp:26:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0;i<L[nod].size();i++){
                  ~^~~~~~~~~~~~~~
railway.cpp:42:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i=0;i<L[nod].size();i++){
                      ~^~~~~~~~~~~~~~
railway.cpp:55:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i=0;i<L[nod].size();i++){
                      ~^~~~~~~~~~~~~~
railway.cpp: In function 'int main()':
railway.cpp:169:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j=0;j<2*chains[i].size();j++)
                      ~^~~~~~~~~~~~~~~~~~~
railway.cpp: In function 'int query_aint(int, int, int, int, int)':
railway.cpp:96:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 70904 KB Output is correct
2 Correct 105 ms 76196 KB Output is correct
3 Correct 98 ms 76024 KB Output is correct
4 Correct 71 ms 70904 KB Output is correct
5 Correct 71 ms 70904 KB Output is correct
6 Correct 100 ms 76404 KB Output is correct
7 Correct 122 ms 76024 KB Output is correct
8 Correct 95 ms 76408 KB Output is correct
9 Correct 99 ms 76280 KB Output is correct
10 Correct 86 ms 70904 KB Output is correct
11 Correct 96 ms 70904 KB Output is correct
12 Correct 88 ms 71084 KB Output is correct
13 Correct 86 ms 70876 KB Output is correct
14 Correct 73 ms 71032 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 70904 KB Output is correct
2 Correct 105 ms 76196 KB Output is correct
3 Correct 98 ms 76024 KB Output is correct
4 Correct 71 ms 70904 KB Output is correct
5 Correct 71 ms 70904 KB Output is correct
6 Correct 100 ms 76404 KB Output is correct
7 Correct 122 ms 76024 KB Output is correct
8 Correct 95 ms 76408 KB Output is correct
9 Correct 99 ms 76280 KB Output is correct
10 Correct 86 ms 70904 KB Output is correct
11 Correct 96 ms 70904 KB Output is correct
12 Correct 88 ms 71084 KB Output is correct
13 Correct 86 ms 70876 KB Output is correct
14 Correct 73 ms 71032 KB Output is correct
15 Correct 154 ms 76396 KB Output is correct
16 Correct 154 ms 76408 KB Output is correct
17 Correct 157 ms 76556 KB Output is correct
18 Correct 100 ms 76380 KB Output is correct
19 Correct 101 ms 76124 KB Output is correct
20 Correct 162 ms 76920 KB Output is correct
21 Correct 158 ms 76860 KB Output is correct
22 Correct 72 ms 70904 KB Output is correct
23 Correct 119 ms 76024 KB Output is correct
24 Correct 101 ms 76024 KB Output is correct
25 Correct 71 ms 70832 KB Output is correct
26 Correct 70 ms 71032 KB Output is correct
27 Correct 100 ms 76524 KB Output is correct
28 Correct 120 ms 76124 KB Output is correct
29 Correct 93 ms 76280 KB Output is correct
30 Correct 99 ms 76408 KB Output is correct
31 Correct 70 ms 70904 KB Output is correct
32 Correct 72 ms 70852 KB Output is correct
33 Correct 71 ms 70932 KB Output is correct
34 Correct 78 ms 70908 KB Output is correct
35 Correct 71 ms 70904 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 525 ms 129684 KB Output is correct
2 Correct 71 ms 70900 KB Output is correct
3 Correct 512 ms 129140 KB Output is correct
4 Correct 483 ms 128324 KB Output is correct
5 Correct 541 ms 129640 KB Output is correct
6 Correct 567 ms 129760 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 490 ms 127372 KB Output is correct
2 Correct 544 ms 127472 KB Output is correct
3 Correct 545 ms 126712 KB Output is correct
4 Correct 557 ms 126968 KB Output is correct
5 Correct 569 ms 127224 KB Output is correct
6 Correct 507 ms 129372 KB Output is correct
7 Correct 504 ms 129392 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 490 ms 127372 KB Output is correct
2 Correct 544 ms 127472 KB Output is correct
3 Correct 545 ms 126712 KB Output is correct
4 Correct 557 ms 126968 KB Output is correct
5 Correct 569 ms 127224 KB Output is correct
6 Correct 507 ms 129372 KB Output is correct
7 Correct 504 ms 129392 KB Output is correct
8 Correct 525 ms 129392 KB Output is correct
9 Correct 533 ms 129360 KB Output is correct
10 Correct 552 ms 131432 KB Output is correct
11 Correct 550 ms 131556 KB Output is correct
12 Correct 444 ms 129528 KB Output is correct
13 Correct 456 ms 129656 KB Output is correct
14 Correct 545 ms 126884 KB Output is correct
15 Correct 544 ms 126956 KB Output is correct
16 Correct 557 ms 127224 KB Output is correct
17 Correct 558 ms 127096 KB Output is correct
18 Correct 541 ms 127004 KB Output is correct
19 Correct 542 ms 127224 KB Output is correct
20 Correct 507 ms 129512 KB Output is correct
21 Correct 509 ms 129900 KB Output is correct
22 Correct 511 ms 129644 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 70904 KB Output is correct
2 Correct 105 ms 76196 KB Output is correct
3 Correct 98 ms 76024 KB Output is correct
4 Correct 71 ms 70904 KB Output is correct
5 Correct 71 ms 70904 KB Output is correct
6 Correct 100 ms 76404 KB Output is correct
7 Correct 122 ms 76024 KB Output is correct
8 Correct 95 ms 76408 KB Output is correct
9 Correct 99 ms 76280 KB Output is correct
10 Correct 86 ms 70904 KB Output is correct
11 Correct 96 ms 70904 KB Output is correct
12 Correct 88 ms 71084 KB Output is correct
13 Correct 86 ms 70876 KB Output is correct
14 Correct 73 ms 71032 KB Output is correct
15 Correct 154 ms 76396 KB Output is correct
16 Correct 154 ms 76408 KB Output is correct
17 Correct 157 ms 76556 KB Output is correct
18 Correct 100 ms 76380 KB Output is correct
19 Correct 101 ms 76124 KB Output is correct
20 Correct 162 ms 76920 KB Output is correct
21 Correct 158 ms 76860 KB Output is correct
22 Correct 72 ms 70904 KB Output is correct
23 Correct 119 ms 76024 KB Output is correct
24 Correct 101 ms 76024 KB Output is correct
25 Correct 71 ms 70832 KB Output is correct
26 Correct 70 ms 71032 KB Output is correct
27 Correct 100 ms 76524 KB Output is correct
28 Correct 120 ms 76124 KB Output is correct
29 Correct 93 ms 76280 KB Output is correct
30 Correct 99 ms 76408 KB Output is correct
31 Correct 70 ms 70904 KB Output is correct
32 Correct 72 ms 70852 KB Output is correct
33 Correct 71 ms 70932 KB Output is correct
34 Correct 78 ms 70908 KB Output is correct
35 Correct 71 ms 70904 KB Output is correct
36 Correct 525 ms 129684 KB Output is correct
37 Correct 71 ms 70900 KB Output is correct
38 Correct 512 ms 129140 KB Output is correct
39 Correct 483 ms 128324 KB Output is correct
40 Correct 541 ms 129640 KB Output is correct
41 Correct 567 ms 129760 KB Output is correct
42 Correct 490 ms 127372 KB Output is correct
43 Correct 544 ms 127472 KB Output is correct
44 Correct 545 ms 126712 KB Output is correct
45 Correct 557 ms 126968 KB Output is correct
46 Correct 569 ms 127224 KB Output is correct
47 Correct 507 ms 129372 KB Output is correct
48 Correct 504 ms 129392 KB Output is correct
49 Correct 525 ms 129392 KB Output is correct
50 Correct 533 ms 129360 KB Output is correct
51 Correct 552 ms 131432 KB Output is correct
52 Correct 550 ms 131556 KB Output is correct
53 Correct 444 ms 129528 KB Output is correct
54 Correct 456 ms 129656 KB Output is correct
55 Correct 545 ms 126884 KB Output is correct
56 Correct 544 ms 126956 KB Output is correct
57 Correct 557 ms 127224 KB Output is correct
58 Correct 558 ms 127096 KB Output is correct
59 Correct 541 ms 127004 KB Output is correct
60 Correct 542 ms 127224 KB Output is correct
61 Correct 507 ms 129512 KB Output is correct
62 Correct 509 ms 129900 KB Output is correct
63 Correct 511 ms 129644 KB Output is correct
64 Correct 515 ms 129512 KB Output is correct
65 Correct 734 ms 126976 KB Output is correct
66 Correct 758 ms 127028 KB Output is correct
67 Correct 713 ms 126896 KB Output is correct
68 Correct 583 ms 129528 KB Output is correct
69 Correct 595 ms 129664 KB Output is correct
70 Correct 620 ms 129928 KB Output is correct
71 Correct 518 ms 129244 KB Output is correct
72 Correct 70 ms 70904 KB Output is correct
73 Correct 99 ms 76028 KB Output is correct
74 Correct 99 ms 76028 KB Output is correct
75 Correct 71 ms 70964 KB Output is correct
76 Correct 70 ms 70904 KB Output is correct
77 Correct 118 ms 76388 KB Output is correct
78 Correct 111 ms 76012 KB Output is correct
79 Correct 105 ms 76408 KB Output is correct
80 Correct 99 ms 76336 KB Output is correct
81 Correct 72 ms 70840 KB Output is correct
82 Correct 70 ms 70904 KB Output is correct
83 Correct 62 ms 70904 KB Output is correct
84 Correct 71 ms 70904 KB Output is correct
85 Correct 72 ms 70904 KB Output is correct
86 Correct 154 ms 76536 KB Output is correct
87 Correct 158 ms 76536 KB Output is correct
88 Correct 157 ms 76508 KB Output is correct
89 Correct 101 ms 76392 KB Output is correct
90 Correct 104 ms 76396 KB Output is correct
91 Correct 159 ms 76920 KB Output is correct
92 Correct 157 ms 76792 KB Output is correct
93 Correct 83 ms 71072 KB Output is correct
94 Correct 511 ms 131632 KB Output is correct
95 Correct 511 ms 130892 KB Output is correct
96 Correct 583 ms 130216 KB Output is correct
97 Correct 550 ms 131408 KB Output is correct
98 Correct 565 ms 131944 KB Output is correct
99 Correct 569 ms 126968 KB Output is correct
100 Correct 562 ms 127068 KB Output is correct
101 Correct 575 ms 127096 KB Output is correct
102 Correct 539 ms 127224 KB Output is correct
103 Correct 504 ms 129396 KB Output is correct
104 Correct 515 ms 129920 KB Output is correct
105 Correct 495 ms 129360 KB Output is correct
106 Correct 528 ms 129556 KB Output is correct
107 Correct 527 ms 129388 KB Output is correct
108 Correct 540 ms 131572 KB Output is correct
109 Correct 530 ms 131632 KB Output is correct
110 Correct 447 ms 129656 KB Output is correct
111 Correct 436 ms 129616 KB Output is correct
112 Correct 558 ms 127096 KB Output is correct
113 Correct 609 ms 126968 KB Output is correct