oj.uz

Submission #213600

# Submission time Handle Problem Language Result Execution time Memory
213600 2020-03-26T09:11:40 Z MKopchev Railway (BOI17_railway) C++14
100 / 100
 189 ms 25332 KB 
#include<bits/stdc++.h>
using namespace std;
const int nmax=1e5+42;
int n,m,k;
pair<int,int> edges[nmax];

vector<int> adj[nmax];

int SZ,want[nmax];

int in[nmax],out[nmax],t=0;

int up[20][nmax],height[nmax];

int lca(int u,int v)
{
    if(height[u]<height[v])swap(u,v);
    for(int st=19;st>=0;st--)
        if(height[u]-(1<<st)>=height[v])u=up[st][u];
    if(u==v)return u;
    for(int st=19;st>=0;st--)
        if(up[st][u]!=up[st][v])u=up[st][u],v=up[st][v];
    return up[0][u];
}

void dfs(int node,int parent)
{
    up[0][node]=parent;
    t++;
    in[node]=t;

    height[node]=height[parent]+1;

    for(auto k:adj[node])
        if(k!=parent)
            dfs(k,node);

    out[node]=t;
}

int pref[nmax];

void dfs_collect(int node,int parent)
{
    for(auto k:adj[node])
        if(k!=parent)
        {
            dfs_collect(k,node);
            pref[node]+=pref[k];
        }
}
bool cmp(int u,int v)
{
    return in[u]<in[v];
}

stack<int> active;

void add()
{
    scanf("%i",&SZ);
    for(int i=1;i<=SZ;i++)scanf("%i",&want[i]);

    sort(want+1,want+SZ+1,cmp);

    set<int> noted={};
    for(int i=1;i<=SZ;i++)noted.insert(want[i]);
    for(int i=2;i<=SZ;i++)noted.insert(lca(want[i-1],want[i]));

    SZ=0;
    for(auto k:noted)
    {
        SZ++;
        want[SZ]=k;
    }

    sort(want+1,want+SZ+1,cmp);

    while(active.size())active.pop();
    active.push(want[1]);
    for(int i=2;i<=SZ;i++)
    {
        while(lca(active.top(),want[i])!=active.top())active.pop();

        pref[want[i]]++;
        pref[active.top()]--;

        active.push(want[i]);
    }
}
int main()
{
    scanf("%i%i%i",&n,&m,&k);

    for(int i=1;i<n;i++)
    {
        scanf("%i%i",&edges[i].first,&edges[i].second);

        adj[edges[i].first].push_back(edges[i].second);
        adj[edges[i].second].push_back(edges[i].first);
    }

    dfs(1,1);

    for(int st=1;st<20;st++)
        for(int i=1;i<=n;i++)
            up[st][i]=up[st-1][up[st-1][i]];

    for(int i=1;i<=m;i++)
        add();

    dfs_collect(1,1);

    for(int i=1;i<n;i++)
    {
        if(height[edges[i].first]<height[edges[i].second])swap(edges[i].first,edges[i].second);
        in[i]=pref[edges[i].first];
    }

    vector<int> output={};
    for(int i=1;i<n;i++)
        if(in[i]>=k)output.push_back(i);

    printf("%i\n",output.size());
    for(int i=0;i<output.size();i++)
    {
        printf("%i",output[i]);
        if(i==output.size()-1)printf("\n");
        else printf(" ");
    }
    return 0;
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:124:32: warning: format '%i' expects argument of type 'int', but argument 2 has type 'std::vector<int>::size_type {aka long unsigned int}' [-Wformat=]
     printf("%i\n",output.size());
                   ~~~~~~~~~~~~~^
railway.cpp:125:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<output.size();i++)
                 ~^~~~~~~~~~~~~~
railway.cpp:128:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(i==output.size()-1)printf("\n");
            ~^~~~~~~~~~~~~~~~~
railway.cpp: In function 'void add()':
railway.cpp:61:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%i",&SZ);
     ~~~~~^~~~~~~~~~
railway.cpp:62:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i=1;i<=SZ;i++)scanf("%i",&want[i]);
                           ~~~~~^~~~~~~~~~~~~~~
railway.cpp: In function 'int main()':
railway.cpp:93:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%i%i%i",&n,&m,&k);
     ~~~~~^~~~~~~~~~~~~~~~~~~
railway.cpp:97:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%i%i",&edges[i].first,&edges[i].second);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2816 KB Output is correct
2 Correct 12 ms 3968 KB Output is correct
3 Correct 12 ms 4096 KB Output is correct
4 Correct 6 ms 2816 KB Output is correct
5 Correct 6 ms 2816 KB Output is correct
6 Correct 13 ms 4480 KB Output is correct
7 Correct 16 ms 4352 KB Output is correct
8 Correct 11 ms 4224 KB Output is correct
9 Correct 11 ms 4224 KB Output is correct
10 Correct 6 ms 2816 KB Output is correct
11 Correct 6 ms 2816 KB Output is correct
12 Correct 6 ms 2816 KB Output is correct
13 Correct 6 ms 2816 KB Output is correct
14 Correct 6 ms 2816 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2816 KB Output is correct
2 Correct 12 ms 3968 KB Output is correct
3 Correct 12 ms 4096 KB Output is correct
4 Correct 6 ms 2816 KB Output is correct
5 Correct 6 ms 2816 KB Output is correct
6 Correct 13 ms 4480 KB Output is correct
7 Correct 16 ms 4352 KB Output is correct
8 Correct 11 ms 4224 KB Output is correct
9 Correct 11 ms 4224 KB Output is correct
10 Correct 6 ms 2816 KB Output is correct
11 Correct 6 ms 2816 KB Output is correct
12 Correct 6 ms 2816 KB Output is correct
13 Correct 6 ms 2816 KB Output is correct
14 Correct 6 ms 2816 KB Output is correct
15 Correct 72 ms 4224 KB Output is correct
16 Correct 72 ms 4216 KB Output is correct
17 Correct 72 ms 4224 KB Output is correct
18 Correct 13 ms 4480 KB Output is correct
19 Correct 12 ms 4224 KB Output is correct
20 Correct 57 ms 4224 KB Output is correct
21 Correct 66 ms 4224 KB Output is correct
22 Correct 6 ms 2816 KB Output is correct
23 Correct 12 ms 4224 KB Output is correct
24 Correct 12 ms 4352 KB Output is correct
25 Correct 6 ms 2816 KB Output is correct
26 Correct 6 ms 2816 KB Output is correct
27 Correct 13 ms 4480 KB Output is correct
28 Correct 12 ms 4352 KB Output is correct
29 Correct 11 ms 4224 KB Output is correct
30 Correct 11 ms 4224 KB Output is correct
31 Correct 6 ms 2816 KB Output is correct
32 Correct 6 ms 2816 KB Output is correct
33 Correct 6 ms 2816 KB Output is correct
34 Correct 6 ms 2816 KB Output is correct
35 Correct 6 ms 2816 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 131 ms 23668 KB Output is correct
2 Correct 6 ms 2816 KB Output is correct
3 Correct 125 ms 24696 KB Output is correct
4 Correct 124 ms 23928 KB Output is correct
5 Correct 155 ms 24948 KB Output is correct
6 Correct 148 ms 25332 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 19576 KB Output is correct
2 Correct 120 ms 18296 KB Output is correct
3 Correct 134 ms 17912 KB Output is correct
4 Correct 130 ms 17912 KB Output is correct
5 Correct 135 ms 17912 KB Output is correct
6 Correct 104 ms 21112 KB Output is correct
7 Correct 102 ms 21124 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 19576 KB Output is correct
2 Correct 120 ms 18296 KB Output is correct
3 Correct 134 ms 17912 KB Output is correct
4 Correct 130 ms 17912 KB Output is correct
5 Correct 135 ms 17912 KB Output is correct
6 Correct 104 ms 21112 KB Output is correct
7 Correct 102 ms 21124 KB Output is correct
8 Correct 148 ms 21112 KB Output is correct
9 Correct 146 ms 20984 KB Output is correct
10 Correct 137 ms 25076 KB Output is correct
11 Correct 134 ms 25076 KB Output is correct
12 Correct 148 ms 17784 KB Output is correct
13 Correct 142 ms 17784 KB Output is correct
14 Correct 164 ms 17784 KB Output is correct
15 Correct 172 ms 17784 KB Output is correct
16 Correct 127 ms 17912 KB Output is correct
17 Correct 134 ms 17912 KB Output is correct
18 Correct 130 ms 17912 KB Output is correct
19 Correct 120 ms 18184 KB Output is correct
20 Correct 111 ms 21444 KB Output is correct
21 Correct 109 ms 21496 KB Output is correct
22 Correct 107 ms 21372 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2816 KB Output is correct
2 Correct 12 ms 3968 KB Output is correct
3 Correct 12 ms 4096 KB Output is correct
4 Correct 6 ms 2816 KB Output is correct
5 Correct 6 ms 2816 KB Output is correct
6 Correct 13 ms 4480 KB Output is correct
7 Correct 16 ms 4352 KB Output is correct
8 Correct 11 ms 4224 KB Output is correct
9 Correct 11 ms 4224 KB Output is correct
10 Correct 6 ms 2816 KB Output is correct
11 Correct 6 ms 2816 KB Output is correct
12 Correct 6 ms 2816 KB Output is correct
13 Correct 6 ms 2816 KB Output is correct
14 Correct 6 ms 2816 KB Output is correct
15 Correct 72 ms 4224 KB Output is correct
16 Correct 72 ms 4216 KB Output is correct
17 Correct 72 ms 4224 KB Output is correct
18 Correct 13 ms 4480 KB Output is correct
19 Correct 12 ms 4224 KB Output is correct
20 Correct 57 ms 4224 KB Output is correct
21 Correct 66 ms 4224 KB Output is correct
22 Correct 6 ms 2816 KB Output is correct
23 Correct 12 ms 4224 KB Output is correct
24 Correct 12 ms 4352 KB Output is correct
25 Correct 6 ms 2816 KB Output is correct
26 Correct 6 ms 2816 KB Output is correct
27 Correct 13 ms 4480 KB Output is correct
28 Correct 12 ms 4352 KB Output is correct
29 Correct 11 ms 4224 KB Output is correct
30 Correct 11 ms 4224 KB Output is correct
31 Correct 6 ms 2816 KB Output is correct
32 Correct 6 ms 2816 KB Output is correct
33 Correct 6 ms 2816 KB Output is correct
34 Correct 6 ms 2816 KB Output is correct
35 Correct 6 ms 2816 KB Output is correct
36 Correct 131 ms 23668 KB Output is correct
37 Correct 6 ms 2816 KB Output is correct
38 Correct 125 ms 24696 KB Output is correct
39 Correct 124 ms 23928 KB Output is correct
40 Correct 155 ms 24948 KB Output is correct
41 Correct 148 ms 25332 KB Output is correct
42 Correct 104 ms 19576 KB Output is correct
43 Correct 120 ms 18296 KB Output is correct
44 Correct 134 ms 17912 KB Output is correct
45 Correct 130 ms 17912 KB Output is correct
46 Correct 135 ms 17912 KB Output is correct
47 Correct 104 ms 21112 KB Output is correct
48 Correct 102 ms 21124 KB Output is correct
49 Correct 148 ms 21112 KB Output is correct
50 Correct 146 ms 20984 KB Output is correct
51 Correct 137 ms 25076 KB Output is correct
52 Correct 134 ms 25076 KB Output is correct
53 Correct 148 ms 17784 KB Output is correct
54 Correct 142 ms 17784 KB Output is correct
55 Correct 164 ms 17784 KB Output is correct
56 Correct 172 ms 17784 KB Output is correct
57 Correct 127 ms 17912 KB Output is correct
58 Correct 134 ms 17912 KB Output is correct
59 Correct 130 ms 17912 KB Output is correct
60 Correct 120 ms 18184 KB Output is correct
61 Correct 111 ms 21444 KB Output is correct
62 Correct 109 ms 21496 KB Output is correct
63 Correct 107 ms 21372 KB Output is correct
64 Correct 116 ms 21240 KB Output is correct
65 Correct 142 ms 17912 KB Output is correct
66 Correct 189 ms 17784 KB Output is correct
67 Correct 162 ms 17912 KB Output is correct
68 Correct 115 ms 17784 KB Output is correct
69 Correct 112 ms 17784 KB Output is correct
70 Correct 121 ms 21624 KB Output is correct
71 Correct 153 ms 20984 KB Output is correct
72 Correct 6 ms 2816 KB Output is correct
73 Correct 12 ms 4224 KB Output is correct
74 Correct 12 ms 4224 KB Output is correct
75 Correct 6 ms 2816 KB Output is correct
76 Correct 6 ms 2816 KB Output is correct
77 Correct 13 ms 4608 KB Output is correct
78 Correct 12 ms 4352 KB Output is correct
79 Correct 11 ms 4224 KB Output is correct
80 Correct 11 ms 4352 KB Output is correct
81 Correct 6 ms 2816 KB Output is correct
82 Correct 6 ms 2816 KB Output is correct
83 Correct 6 ms 2816 KB Output is correct
84 Correct 6 ms 2816 KB Output is correct
85 Correct 6 ms 2816 KB Output is correct
86 Correct 73 ms 4608 KB Output is correct
87 Correct 73 ms 4728 KB Output is correct
88 Correct 74 ms 4600 KB Output is correct
89 Correct 13 ms 4608 KB Output is correct
90 Correct 12 ms 4352 KB Output is correct
91 Correct 58 ms 4856 KB Output is correct
92 Correct 68 ms 4728 KB Output is correct
93 Correct 7 ms 2816 KB Output is correct
94 Correct 129 ms 24948 KB Output is correct
95 Correct 124 ms 24696 KB Output is correct
96 Correct 121 ms 24060 KB Output is correct
97 Correct 149 ms 24952 KB Output is correct
98 Correct 150 ms 25332 KB Output is correct
99 Correct 131 ms 17980 KB Output is correct
100 Correct 127 ms 17912 KB Output is correct
101 Correct 130 ms 17912 KB Output is correct
102 Correct 125 ms 18296 KB Output is correct
103 Correct 105 ms 21112 KB Output is correct
104 Correct 108 ms 21496 KB Output is correct
105 Correct 106 ms 20984 KB Output is correct
106 Correct 149 ms 21240 KB Output is correct
107 Correct 143 ms 21112 KB Output is correct
108 Correct 139 ms 25076 KB Output is correct
109 Correct 134 ms 25076 KB Output is correct
110 Correct 141 ms 17784 KB Output is correct
111 Correct 138 ms 17784 KB Output is correct
112 Correct 170 ms 17784 KB Output is correct
113 Correct 164 ms 17788 KB Output is correct