oj.uz

Submission #135708

# Submission time Handle Problem Language Result Execution time Memory
135708 2019-07-24T09:55:57 Z khsoo01 Railway (BOI17_railway) C++11
100 / 100
 194 ms 24172 KB 
#include<bits/stdc++.h>
using namespace std;
int n, m, x, sum[100005], a[200005];
int  ord[100005], pord[100005], co;
int dep[100005], spt[20][100005];
vector<int> adj[100005], ans;
vector<pair<int,int> > road;

bool comp (int A, int B) {
	return ord[A] < ord[B];
}

void calc (int cur, int prv) {
	ord[cur] = ++co;
	dep[cur] = dep[prv] + 1;
	spt[0][cur] = prv;
	for(auto &nxt : adj[cur]) {
		if(nxt == prv) continue;
		calc(nxt, cur);
	}
	pord[cur] = co;
}

void wrap (int cur, int prv) {
	for(auto &nxt : adj[cur]) {
		if(nxt == prv) continue;
		wrap(nxt, cur);
		sum[cur] += sum[nxt];
	}
}

int getlca (int A, int B) {
	if(dep[A] < dep[B]) swap(A, B);
	for(int i=20;i--;) {
		if(dep[A] - dep[B] >= (1<<i)) A = spt[i][A];
	}
	if(A == B) return A;
	for(int i=20;i--;) {
		if(spt[i][A] != spt[i][B]) {
			A = spt[i][A]; B = spt[i][B];
		}
	}
	return spt[0][A];
}

bool isanc (int A, int B) {
	return (ord[A] <= ord[B] && pord[B] <= pord[A]);
}

void solve () {
	int N;
	scanf("%d",&N);
	for(int i=1;i<=N;i++) {
		scanf("%d",&a[i]);
	}
	sort(a+1, a+1+N, comp);
	for(int i=1;i<N;i++) {
		a[N+i] = getlca(a[i], a[i+1]);
	}
	sort(a+1, a+2*N, comp);
	vector<int> stk;
	for(int i=1;i<2*N;i++) {
		while(!stk.empty()) {
			if(isanc(stk.back(), a[i])) break;
			else stk.pop_back();
		}
		if(!stk.empty()) {
			sum[stk.back()]--;
			sum[a[i]]++;
		}
		stk.push_back(a[i]);
	}
}

int main()
{
	scanf("%d%d%d",&n,&m,&x);
	for(int i=1;i<n;i++) {
		int A, B;
		scanf("%d%d",&A,&B);
		adj[A].push_back(B);
		adj[B].push_back(A);
		road.push_back({A, B});
	}
	calc(1, 0);
	for(int k=1;k<20;k++) {
		for(int i=1;i<=n;i++) {
			spt[k][i] = spt[k-1][spt[k-1][i]];
		}
	}
	while(m--) solve();
	wrap(1, 0);
	for(int i=0;i<road.size();i++) {
		int A = road[i].first, B = road[i].second;
		int T = (ord[A] > ord[B] ? A : B);
		if(sum[T] >= x) ans.push_back(i+1);
	}
	printf("%d\n",ans.size());
	for(int i=0;i<ans.size();i++) {
		printf("%d ",ans[i]);
	}
	puts("");
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:93:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<road.size();i++) {
              ~^~~~~~~~~~~~
railway.cpp:98:26: 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:99:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<ans.size();i++) {
              ~^~~~~~~~~~~
railway.cpp: In function 'void solve()':
railway.cpp:52:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&N);
  ~~~~~^~~~~~~~~
railway.cpp:54:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&a[i]);
   ~~~~~^~~~~~~~~~~~
railway.cpp: In function 'int main()':
railway.cpp:77:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d",&n,&m,&x);
  ~~~~~^~~~~~~~~~~~~~~~~~~
railway.cpp:80:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&A,&B);
   ~~~~~^~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2752 KB Output is correct
2 Correct 10 ms 4216 KB Output is correct
3 Correct 11 ms 4344 KB Output is correct
4 Correct 4 ms 2808 KB Output is correct
5 Correct 4 ms 2808 KB Output is correct
6 Correct 11 ms 4484 KB Output is correct
7 Correct 10 ms 4216 KB Output is correct
8 Correct 9 ms 4216 KB Output is correct
9 Correct 9 ms 4216 KB Output is correct
10 Correct 4 ms 2804 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 2812 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 2752 KB Output is correct
2 Correct 10 ms 4216 KB Output is correct
3 Correct 11 ms 4344 KB Output is correct
4 Correct 4 ms 2808 KB Output is correct
5 Correct 4 ms 2808 KB Output is correct
6 Correct 11 ms 4484 KB Output is correct
7 Correct 10 ms 4216 KB Output is correct
8 Correct 9 ms 4216 KB Output is correct
9 Correct 9 ms 4216 KB Output is correct
10 Correct 4 ms 2804 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 2812 KB Output is correct
14 Correct 4 ms 2808 KB Output is correct
15 Correct 46 ms 4640 KB Output is correct
16 Correct 48 ms 4672 KB Output is correct
17 Correct 47 ms 4640 KB Output is correct
18 Correct 11 ms 4472 KB Output is correct
19 Correct 10 ms 4216 KB Output is correct
20 Correct 38 ms 4828 KB Output is correct
21 Correct 43 ms 4700 KB Output is correct
22 Correct 4 ms 2808 KB Output is correct
23 Correct 11 ms 4220 KB Output is correct
24 Correct 10 ms 4216 KB Output is correct
25 Correct 4 ms 2808 KB Output is correct
26 Correct 4 ms 2712 KB Output is correct
27 Correct 11 ms 4476 KB Output is correct
28 Correct 11 ms 4216 KB Output is correct
29 Correct 9 ms 4192 KB Output is correct
30 Correct 10 ms 4216 KB Output is correct
31 Correct 4 ms 2716 KB Output is correct
32 Correct 4 ms 2808 KB Output is correct
33 Correct 4 ms 2728 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 142 ms 23908 KB Output is correct
2 Correct 5 ms 2812 KB Output is correct
3 Correct 147 ms 23184 KB Output is correct
4 Correct 126 ms 22504 KB Output is correct
5 Correct 176 ms 23784 KB Output is correct
6 Correct 134 ms 24172 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 20116 KB Output is correct
2 Correct 130 ms 18152 KB Output is correct
3 Correct 123 ms 17924 KB Output is correct
4 Correct 116 ms 17964 KB Output is correct
5 Correct 119 ms 17896 KB Output is correct
6 Correct 104 ms 20328 KB Output is correct
7 Correct 104 ms 20324 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 20116 KB Output is correct
2 Correct 130 ms 18152 KB Output is correct
3 Correct 123 ms 17924 KB Output is correct
4 Correct 116 ms 17964 KB Output is correct
5 Correct 119 ms 17896 KB Output is correct
6 Correct 104 ms 20328 KB Output is correct
7 Correct 104 ms 20324 KB Output is correct
8 Correct 131 ms 20300 KB Output is correct
9 Correct 124 ms 20308 KB Output is correct
10 Correct 132 ms 23868 KB Output is correct
11 Correct 131 ms 23864 KB Output is correct
12 Correct 109 ms 17812 KB Output is correct
13 Correct 110 ms 17736 KB Output is correct
14 Correct 127 ms 17780 KB Output is correct
15 Correct 127 ms 17744 KB Output is correct
16 Correct 125 ms 17924 KB Output is correct
17 Correct 130 ms 17828 KB Output is correct
18 Correct 118 ms 17944 KB Output is correct
19 Correct 111 ms 18156 KB Output is correct
20 Correct 104 ms 20560 KB Output is correct
21 Correct 107 ms 20712 KB Output is correct
22 Correct 104 ms 20564 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2752 KB Output is correct
2 Correct 10 ms 4216 KB Output is correct
3 Correct 11 ms 4344 KB Output is correct
4 Correct 4 ms 2808 KB Output is correct
5 Correct 4 ms 2808 KB Output is correct
6 Correct 11 ms 4484 KB Output is correct
7 Correct 10 ms 4216 KB Output is correct
8 Correct 9 ms 4216 KB Output is correct
9 Correct 9 ms 4216 KB Output is correct
10 Correct 4 ms 2804 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 2812 KB Output is correct
14 Correct 4 ms 2808 KB Output is correct
15 Correct 46 ms 4640 KB Output is correct
16 Correct 48 ms 4672 KB Output is correct
17 Correct 47 ms 4640 KB Output is correct
18 Correct 11 ms 4472 KB Output is correct
19 Correct 10 ms 4216 KB Output is correct
20 Correct 38 ms 4828 KB Output is correct
21 Correct 43 ms 4700 KB Output is correct
22 Correct 4 ms 2808 KB Output is correct
23 Correct 11 ms 4220 KB Output is correct
24 Correct 10 ms 4216 KB Output is correct
25 Correct 4 ms 2808 KB Output is correct
26 Correct 4 ms 2712 KB Output is correct
27 Correct 11 ms 4476 KB Output is correct
28 Correct 11 ms 4216 KB Output is correct
29 Correct 9 ms 4192 KB Output is correct
30 Correct 10 ms 4216 KB Output is correct
31 Correct 4 ms 2716 KB Output is correct
32 Correct 4 ms 2808 KB Output is correct
33 Correct 4 ms 2728 KB Output is correct
34 Correct 4 ms 2808 KB Output is correct
35 Correct 4 ms 2808 KB Output is correct
36 Correct 142 ms 23908 KB Output is correct
37 Correct 5 ms 2812 KB Output is correct
38 Correct 147 ms 23184 KB Output is correct
39 Correct 126 ms 22504 KB Output is correct
40 Correct 176 ms 23784 KB Output is correct
41 Correct 134 ms 24172 KB Output is correct
42 Correct 106 ms 20116 KB Output is correct
43 Correct 130 ms 18152 KB Output is correct
44 Correct 123 ms 17924 KB Output is correct
45 Correct 116 ms 17964 KB Output is correct
46 Correct 119 ms 17896 KB Output is correct
47 Correct 104 ms 20328 KB Output is correct
48 Correct 104 ms 20324 KB Output is correct
49 Correct 131 ms 20300 KB Output is correct
50 Correct 124 ms 20308 KB Output is correct
51 Correct 132 ms 23868 KB Output is correct
52 Correct 131 ms 23864 KB Output is correct
53 Correct 109 ms 17812 KB Output is correct
54 Correct 110 ms 17736 KB Output is correct
55 Correct 127 ms 17780 KB Output is correct
56 Correct 127 ms 17744 KB Output is correct
57 Correct 125 ms 17924 KB Output is correct
58 Correct 130 ms 17828 KB Output is correct
59 Correct 118 ms 17944 KB Output is correct
60 Correct 111 ms 18156 KB Output is correct
61 Correct 104 ms 20560 KB Output is correct
62 Correct 107 ms 20712 KB Output is correct
63 Correct 104 ms 20564 KB Output is correct
64 Correct 111 ms 20516 KB Output is correct
65 Correct 131 ms 17924 KB Output is correct
66 Correct 141 ms 17856 KB Output is correct
67 Correct 130 ms 17864 KB Output is correct
68 Correct 95 ms 17640 KB Output is correct
69 Correct 95 ms 17648 KB Output is correct
70 Correct 124 ms 20820 KB Output is correct
71 Correct 127 ms 20052 KB Output is correct
72 Correct 4 ms 2808 KB Output is correct
73 Correct 11 ms 4216 KB Output is correct
74 Correct 11 ms 4216 KB Output is correct
75 Correct 5 ms 2808 KB Output is correct
76 Correct 4 ms 2808 KB Output is correct
77 Correct 11 ms 4600 KB Output is correct
78 Correct 10 ms 4216 KB Output is correct
79 Correct 9 ms 4216 KB Output is correct
80 Correct 10 ms 4252 KB Output is correct
81 Correct 4 ms 2732 KB Output is correct
82 Correct 4 ms 2828 KB Output is correct
83 Correct 4 ms 2812 KB Output is correct
84 Correct 4 ms 2808 KB Output is correct
85 Correct 4 ms 2808 KB Output is correct
86 Correct 46 ms 4600 KB Output is correct
87 Correct 47 ms 4600 KB Output is correct
88 Correct 47 ms 4696 KB Output is correct
89 Correct 12 ms 4476 KB Output is correct
90 Correct 11 ms 4216 KB Output is correct
91 Correct 41 ms 4860 KB Output is correct
92 Correct 44 ms 4728 KB Output is correct
93 Correct 5 ms 2808 KB Output is correct
94 Correct 157 ms 23908 KB Output is correct
95 Correct 132 ms 23132 KB Output is correct
96 Correct 191 ms 22508 KB Output is correct
97 Correct 194 ms 23788 KB Output is correct
98 Correct 136 ms 24168 KB Output is correct
99 Correct 124 ms 18012 KB Output is correct
100 Correct 118 ms 17896 KB Output is correct
101 Correct 118 ms 17912 KB Output is correct
102 Correct 114 ms 18152 KB Output is correct
103 Correct 103 ms 20328 KB Output is correct
104 Correct 116 ms 20800 KB Output is correct
105 Correct 112 ms 20332 KB Output is correct
106 Correct 136 ms 20520 KB Output is correct
107 Correct 135 ms 20332 KB Output is correct
108 Correct 143 ms 23888 KB Output is correct
109 Correct 130 ms 23840 KB Output is correct
110 Correct 109 ms 17844 KB Output is correct
111 Correct 148 ms 17768 KB Output is correct
112 Correct 126 ms 17772 KB Output is correct
113 Correct 128 ms 17768 KB Output is correct