oj.uz

Submission #148107

# Submission time Handle Problem Language Result Execution time Memory
148107 2019-08-31T13:56:39 Z WhipppedCream Railway (BOI17_railway) C++17
100 / 100
 353 ms 24336 KB 
#include <bits/stdc++.h>
#define ii pair<int, int>
#define X first
#define Y second
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define vii vector< pair<int, int> >
typedef long long ll;
using namespace std;
vii adj[100005];
vi tour;
int dat[100005];
int h[100005];
int dp[25][100005];
int marc[100005];
int toPar[100005];
int in[100005];
bool cmp(int a, int b)
{
    return dat[a] < dat[b];
}
void dfs(int u, int p)
{
    dat[u] = (int) tour.size();
    tour.pb(u);
    dp[0][u] = p;
    for(auto kk : adj[u])
    {
        int v = kk.X;
        if(v == p) continue;
        toPar[v] = kk.Y;
        h[v] = h[u]+1;
        dfs(v, u);
        in[u]++;
    }
}
int LCA(int u, int v)
{
    //printf("%d %d\n", u, v);
    if(h[u]> h[v]) swap(u, v);
    for(int i = 20; i>= 0; i--)
    {
        int xx = dp[i][v];
        if(h[xx]< h[u]) continue;
        v = xx;
    }
    if(u == v) return u;
    for(int i = 20; i>= 0; i--)
    {
        int x = dp[i][u];
        int y = dp[i][v];
        if(x == y) continue;
        u = x; v = y;
    }
    return dp[0][u];
}
void path(int a, int b)
{
    //printf("path %d %d\n", a, b);
	if(a == 0 || b == 0) return;
    marc[a]++; marc[b]++;
    int k = LCA(a, b);
    assert(k);
    marc[k] -= 2;
}
int getndtop(stack<int> &s)
{
	int x = s.top(); s.pop();
	int y = s.top(); s.push(x);
	return y;
}
int main()
{
    int n, m, k;
    scanf("%d %d %d", &n, &m, &k);
    for(int i = 0; i< n-1; i++)
    {
        int a, b; scanf("%d %d", &a, &b);
        adj[a].pb(ii(b, i+1)); adj[b].pb(ii(a, i+1));
    }
    h[1] = 1;
    dfs(1, 0);
    for(int i = 1; i<= 20; i++)
        for(int j = 1; j<= n; j++)
            dp[i][j] = dp[i-1][dp[i-1][j]];
    for(int i = 0; i< m; i++)
    {
        int xx; scanf("%d", &xx);
        vi want;
        while(xx--)
        {
            int foo; scanf("%d", &foo);
            want.pb(foo);
        }
        sort(want.begin(), want.end(), cmp);
        stack<int> s;
		s.push(0);
		int st = want[0];
		for(int j = 1; j< (int) want.size(); j++) st = LCA(st, want[j]);
		s.push(st);
		for(int j = 0; j< (int) want.size(); j++)
		{
			int u = want[j];
			int lca = LCA(u, s.top());
			if(lca == s.top())
			{
				s.push(u);
				continue;
			}
			while(LCA(getndtop(s), u) != getndtop(s))
			{
				int x = s.top(); s.pop();
				path(x, s.top());
			}
			//if(s.top() != lca)
			{
                //printf("dafuq\n");
				path(lca, s.top());
				s.pop();
				s.push(lca);
			}
			s.push(u);
		}
		while(!s.empty() && s.top())
		{
			int x = s.top(); s.pop();
			path(x, s.top());
		}
    }
    queue<int> Q;
    for(int i = 1; i<= n; i++) if(in[i] == 0) Q.push(i);
    vi ans;
    while(!Q.empty())
    {
        int x = Q.front(); Q.pop();
        if(!x) continue;
        if(marc[x]>= k) ans.pb(toPar[x]);
        marc[dp[0][x]] += marc[x];
        assert(marc[x]>= 0);
        in[dp[0][x]]--;
        if(dp[0][x] && in[dp[0][x]] == 0) Q.push(dp[0][x]);
    }
    sort(ans.begin(), ans.end());
    printf("%d\n", ans.size());
    for(auto x : ans) printf("%d ", x);
    printf("\n");
	return 0;
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:145:30: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<int>::size_type {aka long unsigned int}' [-Wformat=]
     printf("%d\n", ans.size());
                    ~~~~~~~~~~^
railway.cpp:76:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d", &n, &m, &k);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
railway.cpp:79:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         int a, b; scanf("%d %d", &a, &b);
                   ~~~~~^~~~~~~~~~~~~~~~~
railway.cpp:89:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         int xx; scanf("%d", &xx);
                 ~~~~~^~~~~~~~~~~
railway.cpp:93:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             int foo; scanf("%d", &foo);
                      ~~~~~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2808 KB Output is correct
2 Correct 12 ms 4344 KB Output is correct
3 Correct 12 ms 4372 KB Output is correct
4 Correct 4 ms 2808 KB Output is correct
5 Correct 4 ms 2808 KB Output is correct
6 Correct 14 ms 4616 KB Output is correct
7 Correct 12 ms 4384 KB Output is correct
8 Correct 11 ms 4344 KB Output is correct
9 Correct 13 ms 4344 KB Output is correct
10 Correct 4 ms 2744 KB Output is correct
11 Correct 4 ms 2808 KB Output is correct
12 Correct 4 ms 2808 KB Output is correct
13 Correct 4 ms 2808 KB Output is correct
14 Correct 4 ms 2808 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2808 KB Output is correct
2 Correct 12 ms 4344 KB Output is correct
3 Correct 12 ms 4372 KB Output is correct
4 Correct 4 ms 2808 KB Output is correct
5 Correct 4 ms 2808 KB Output is correct
6 Correct 14 ms 4616 KB Output is correct
7 Correct 12 ms 4384 KB Output is correct
8 Correct 11 ms 4344 KB Output is correct
9 Correct 13 ms 4344 KB Output is correct
10 Correct 4 ms 2744 KB Output is correct
11 Correct 4 ms 2808 KB Output is correct
12 Correct 4 ms 2808 KB Output is correct
13 Correct 4 ms 2808 KB Output is correct
14 Correct 4 ms 2808 KB Output is correct
15 Correct 102 ms 4700 KB Output is correct
16 Correct 105 ms 4768 KB Output is correct
17 Correct 116 ms 4728 KB Output is correct
18 Correct 13 ms 4600 KB Output is correct
19 Correct 12 ms 4472 KB Output is correct
20 Correct 98 ms 4864 KB Output is correct
21 Correct 113 ms 4808 KB Output is correct
22 Correct 4 ms 2808 KB Output is correct
23 Correct 12 ms 4344 KB Output is correct
24 Correct 12 ms 4344 KB Output is correct
25 Correct 4 ms 2808 KB Output is correct
26 Correct 5 ms 2808 KB Output is correct
27 Correct 12 ms 4600 KB Output is correct
28 Correct 12 ms 4344 KB Output is correct
29 Correct 11 ms 4344 KB Output is correct
30 Correct 11 ms 4344 KB Output is correct
31 Correct 4 ms 2808 KB Output is correct
32 Correct 4 ms 2808 KB Output is correct
33 Correct 4 ms 2808 KB Output is correct
34 Correct 4 ms 2808 KB Output is correct
35 Correct 4 ms 2808 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 239 ms 23752 KB Output is correct
2 Correct 4 ms 2808 KB Output is correct
3 Correct 254 ms 23716 KB Output is correct
4 Correct 260 ms 23156 KB Output is correct
5 Correct 293 ms 23800 KB Output is correct
6 Correct 254 ms 24336 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 21168 KB Output is correct
2 Correct 174 ms 19192 KB Output is correct
3 Correct 200 ms 18928 KB Output is correct
4 Correct 203 ms 18928 KB Output is correct
5 Correct 204 ms 19032 KB Output is correct
6 Correct 147 ms 21264 KB Output is correct
7 Correct 141 ms 21236 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 21168 KB Output is correct
2 Correct 174 ms 19192 KB Output is correct
3 Correct 200 ms 18928 KB Output is correct
4 Correct 203 ms 18928 KB Output is correct
5 Correct 204 ms 19032 KB Output is correct
6 Correct 147 ms 21264 KB Output is correct
7 Correct 141 ms 21236 KB Output is correct
8 Correct 223 ms 21168 KB Output is correct
9 Correct 225 ms 21360 KB Output is correct
10 Correct 239 ms 23844 KB Output is correct
11 Correct 247 ms 23844 KB Output is correct
12 Correct 236 ms 18532 KB Output is correct
13 Correct 225 ms 18620 KB Output is correct
14 Correct 260 ms 19012 KB Output is correct
15 Correct 241 ms 18944 KB Output is correct
16 Correct 206 ms 18928 KB Output is correct
17 Correct 209 ms 19008 KB Output is correct
18 Correct 192 ms 19028 KB Output is correct
19 Correct 173 ms 19196 KB Output is correct
20 Correct 152 ms 21616 KB Output is correct
21 Correct 151 ms 21836 KB Output is correct
22 Correct 149 ms 21588 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2808 KB Output is correct
2 Correct 12 ms 4344 KB Output is correct
3 Correct 12 ms 4372 KB Output is correct
4 Correct 4 ms 2808 KB Output is correct
5 Correct 4 ms 2808 KB Output is correct
6 Correct 14 ms 4616 KB Output is correct
7 Correct 12 ms 4384 KB Output is correct
8 Correct 11 ms 4344 KB Output is correct
9 Correct 13 ms 4344 KB Output is correct
10 Correct 4 ms 2744 KB Output is correct
11 Correct 4 ms 2808 KB Output is correct
12 Correct 4 ms 2808 KB Output is correct
13 Correct 4 ms 2808 KB Output is correct
14 Correct 4 ms 2808 KB Output is correct
15 Correct 102 ms 4700 KB Output is correct
16 Correct 105 ms 4768 KB Output is correct
17 Correct 116 ms 4728 KB Output is correct
18 Correct 13 ms 4600 KB Output is correct
19 Correct 12 ms 4472 KB Output is correct
20 Correct 98 ms 4864 KB Output is correct
21 Correct 113 ms 4808 KB Output is correct
22 Correct 4 ms 2808 KB Output is correct
23 Correct 12 ms 4344 KB Output is correct
24 Correct 12 ms 4344 KB Output is correct
25 Correct 4 ms 2808 KB Output is correct
26 Correct 5 ms 2808 KB Output is correct
27 Correct 12 ms 4600 KB Output is correct
28 Correct 12 ms 4344 KB Output is correct
29 Correct 11 ms 4344 KB Output is correct
30 Correct 11 ms 4344 KB Output is correct
31 Correct 4 ms 2808 KB Output is correct
32 Correct 4 ms 2808 KB Output is correct
33 Correct 4 ms 2808 KB Output is correct
34 Correct 4 ms 2808 KB Output is correct
35 Correct 4 ms 2808 KB Output is correct
36 Correct 239 ms 23752 KB Output is correct
37 Correct 4 ms 2808 KB Output is correct
38 Correct 254 ms 23716 KB Output is correct
39 Correct 260 ms 23156 KB Output is correct
40 Correct 293 ms 23800 KB Output is correct
41 Correct 254 ms 24336 KB Output is correct
42 Correct 158 ms 21168 KB Output is correct
43 Correct 174 ms 19192 KB Output is correct
44 Correct 200 ms 18928 KB Output is correct
45 Correct 203 ms 18928 KB Output is correct
46 Correct 204 ms 19032 KB Output is correct
47 Correct 147 ms 21264 KB Output is correct
48 Correct 141 ms 21236 KB Output is correct
49 Correct 223 ms 21168 KB Output is correct
50 Correct 225 ms 21360 KB Output is correct
51 Correct 239 ms 23844 KB Output is correct
52 Correct 247 ms 23844 KB Output is correct
53 Correct 236 ms 18532 KB Output is correct
54 Correct 225 ms 18620 KB Output is correct
55 Correct 260 ms 19012 KB Output is correct
56 Correct 241 ms 18944 KB Output is correct
57 Correct 206 ms 18928 KB Output is correct
58 Correct 209 ms 19008 KB Output is correct
59 Correct 192 ms 19028 KB Output is correct
60 Correct 173 ms 19196 KB Output is correct
61 Correct 152 ms 21616 KB Output is correct
62 Correct 151 ms 21836 KB Output is correct
63 Correct 149 ms 21588 KB Output is correct
64 Correct 184 ms 21320 KB Output is correct
65 Correct 283 ms 18940 KB Output is correct
66 Correct 353 ms 18900 KB Output is correct
67 Correct 285 ms 18928 KB Output is correct
68 Correct 182 ms 18628 KB Output is correct
69 Correct 190 ms 18676 KB Output is correct
70 Correct 185 ms 21804 KB Output is correct
71 Correct 254 ms 21164 KB Output is correct
72 Correct 4 ms 2808 KB Output is correct
73 Correct 12 ms 4472 KB Output is correct
74 Correct 12 ms 4348 KB Output is correct
75 Correct 4 ms 2812 KB Output is correct
76 Correct 4 ms 2936 KB Output is correct
77 Correct 12 ms 4572 KB Output is correct
78 Correct 12 ms 4344 KB Output is correct
79 Correct 12 ms 4272 KB Output is correct
80 Correct 11 ms 4344 KB Output is correct
81 Correct 4 ms 2808 KB Output is correct
82 Correct 4 ms 2744 KB Output is correct
83 Correct 4 ms 2808 KB Output is correct
84 Correct 4 ms 2808 KB Output is correct
85 Correct 4 ms 2780 KB Output is correct
86 Correct 103 ms 4728 KB Output is correct
87 Correct 104 ms 4728 KB Output is correct
88 Correct 108 ms 4776 KB Output is correct
89 Correct 13 ms 4600 KB Output is correct
90 Correct 12 ms 4344 KB Output is correct
91 Correct 97 ms 4956 KB Output is correct
92 Correct 114 ms 4728 KB Output is correct
93 Correct 4 ms 2808 KB Output is correct
94 Correct 260 ms 23932 KB Output is correct
95 Correct 258 ms 23540 KB Output is correct
96 Correct 283 ms 23024 KB Output is correct
97 Correct 317 ms 23776 KB Output is correct
98 Correct 237 ms 24168 KB Output is correct
99 Correct 223 ms 18956 KB Output is correct
100 Correct 211 ms 18996 KB Output is correct
101 Correct 218 ms 18956 KB Output is correct
102 Correct 174 ms 19256 KB Output is correct
103 Correct 148 ms 21244 KB Output is correct
104 Correct 146 ms 21612 KB Output is correct
105 Correct 150 ms 21196 KB Output is correct
106 Correct 251 ms 21404 KB Output is correct
107 Correct 230 ms 21212 KB Output is correct
108 Correct 266 ms 23788 KB Output is correct
109 Correct 255 ms 23864 KB Output is correct
110 Correct 241 ms 18588 KB Output is correct
111 Correct 230 ms 18516 KB Output is correct
112 Correct 239 ms 18936 KB Output is correct
113 Correct 242 ms 18884 KB Output is correct