oj.uz

답안 #134257

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
134257 2019-07-22T09:55:27 Z Kastanda Railway (BOI17_railway) C++11
100 / 100
 190 ms 22256 KB 
#include<bits/stdc++.h>
#define pb push_back
#define x first
#define y second
using namespace std;
const int N = 100005, LG = 17;
int n, q, k, ts, A[N], st[N], en[N], H[N], P[N][LG], R[N];
vector < pair < int , int > > Adj[N];
void DFS(int v, int p)
{
	st[v] = ts ++;
	P[v][0] = p;
	for (int i = 1; i < LG; i++)
		P[v][i] = P[P[v][i - 1]][i - 1];
	for (auto &u : Adj[v])
		if (u.x != p)
			H[u.x] = H[v] + 1, DFS(u.x, v);
	en[v] = ts;
}
inline int LCA(int v, int u)
{
	if (H[v] < H[u])
		return (LCA(u, v));
	for (int i = 0; i < LG; i++)
		if ((H[v] - H[u]) & (1 << i))
			v = P[v][i];
	if (v == u)
		return (v);
	for (int i = LG - 1; ~ i; i --)
		if (P[v][i] != P[u][i])
			v = P[v][i], u = P[u][i];
	return (P[v][0]);
}
inline bool CMP(int i, int j)
{
	return (st[i] < st[j]);
}
void FNL(int v, int id)
{
	for (auto &u : Adj[v])
		if (u.y != id)
		{
			FNL(u.x, u.y);
			A[v] += A[u.x];
		}
	R[id] = A[v];
}
int main()
{
	scanf("%d%d%d", &n, &q, &k);
	for (int i = 1; i < n; i++)
	{
		int a, b;
		scanf("%d%d", &a, &b);
		Adj[a].pb({b, i});
		Adj[b].pb({a, i});
	}
	DFS(1, 0);
	for (int i = 1; i <= q; i++)
	{
		int m;
		scanf("%d", &m);
		vector < int > vec(m);
		for (int j = 1; j <= m; j++)
			scanf("%d", &vec[j - 1]);
		sort(vec.begin(), vec.end(), CMP);
		for (int j = 0; j < m; j++)
			vec.pb(LCA(vec[j], vec[(j + 1) % m]));
		sort(vec.begin(), vec.end(), CMP);
		vec.resize(unique(vec.begin(), vec.end()) - vec.begin());
		if ((int)vec.size() <= 1)
			continue;
		vector < int > stk; stk.pb(vec[0]);
		for (int j = 1; j < (int)vec.size(); j++)
		{
			while (stk.size() && en[stk.back()] < en[vec[j]])
				stk.pop_back();
			A[vec[j]] ++;
			A[stk.back()] --;
			stk.pb(vec[j]);
		}
	}
	FNL(1, 0);
	vector < int > vec;
	for (int i = 1; i < n; i++)
		if (R[i] >= k)
			vec.pb(i);
	printf("%d\n", (int)vec.size());
	for (int id : vec)
		printf("%d ", id);
	return 0;
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:50:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d", &n, &q, &k);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
railway.cpp:54:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &a, &b);
   ~~~~~^~~~~~~~~~~~~~~~
railway.cpp:62:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &m);
   ~~~~~^~~~~~~~~~
railway.cpp:65:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &vec[j - 1]);
    ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 11 ms 3960 KB Output is correct
3 Correct 11 ms 3960 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2704 KB Output is correct
6 Correct 12 ms 4296 KB Output is correct
7 Correct 12 ms 4060 KB Output is correct
8 Correct 10 ms 4088 KB Output is correct
9 Correct 10 ms 4088 KB Output is correct
10 Correct 4 ms 2728 KB Output is correct
11 Correct 4 ms 2680 KB Output is correct
12 Correct 4 ms 2680 KB Output is correct
13 Correct 4 ms 2680 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 11 ms 3960 KB Output is correct
3 Correct 11 ms 3960 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2704 KB Output is correct
6 Correct 12 ms 4296 KB Output is correct
7 Correct 12 ms 4060 KB Output is correct
8 Correct 10 ms 4088 KB Output is correct
9 Correct 10 ms 4088 KB Output is correct
10 Correct 4 ms 2728 KB Output is correct
11 Correct 4 ms 2680 KB Output is correct
12 Correct 4 ms 2680 KB Output is correct
13 Correct 4 ms 2680 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct
15 Correct 46 ms 4472 KB Output is correct
16 Correct 46 ms 4444 KB Output is correct
17 Correct 46 ms 4600 KB Output is correct
18 Correct 12 ms 4344 KB Output is correct
19 Correct 11 ms 4088 KB Output is correct
20 Correct 37 ms 4600 KB Output is correct
21 Correct 42 ms 4552 KB Output is correct
22 Correct 4 ms 2680 KB Output is correct
23 Correct 12 ms 3960 KB Output is correct
24 Correct 12 ms 3964 KB Output is correct
25 Correct 5 ms 2680 KB Output is correct
26 Correct 5 ms 2680 KB Output is correct
27 Correct 13 ms 4348 KB Output is correct
28 Correct 11 ms 4168 KB Output is correct
29 Correct 9 ms 4088 KB Output is correct
30 Correct 10 ms 4088 KB Output is correct
31 Correct 4 ms 2680 KB Output is correct
32 Correct 4 ms 2680 KB Output is correct
33 Correct 4 ms 2680 KB Output is correct
34 Correct 4 ms 2684 KB Output is correct
35 Correct 4 ms 2680 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 151 ms 21976 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 150 ms 21548 KB Output is correct
4 Correct 143 ms 20904 KB Output is correct
5 Correct 190 ms 21808 KB Output is correct
6 Correct 146 ms 22192 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 123 ms 19024 KB Output is correct
2 Correct 138 ms 17056 KB Output is correct
3 Correct 146 ms 16836 KB Output is correct
4 Correct 141 ms 16860 KB Output is correct
5 Correct 172 ms 16912 KB Output is correct
6 Correct 128 ms 19168 KB Output is correct
7 Correct 124 ms 19136 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 123 ms 19024 KB Output is correct
2 Correct 138 ms 17056 KB Output is correct
3 Correct 146 ms 16836 KB Output is correct
4 Correct 141 ms 16860 KB Output is correct
5 Correct 172 ms 16912 KB Output is correct
6 Correct 128 ms 19168 KB Output is correct
7 Correct 124 ms 19136 KB Output is correct
8 Correct 140 ms 19188 KB Output is correct
9 Correct 150 ms 19264 KB Output is correct
10 Correct 148 ms 21940 KB Output is correct
11 Correct 159 ms 21904 KB Output is correct
12 Correct 100 ms 16552 KB Output is correct
13 Correct 103 ms 16616 KB Output is correct
14 Correct 135 ms 16760 KB Output is correct
15 Correct 146 ms 16704 KB Output is correct
16 Correct 143 ms 16828 KB Output is correct
17 Correct 151 ms 16976 KB Output is correct
18 Correct 136 ms 16732 KB Output is correct
19 Correct 142 ms 17052 KB Output is correct
20 Correct 125 ms 19416 KB Output is correct
21 Correct 138 ms 19500 KB Output is correct
22 Correct 126 ms 19448 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 11 ms 3960 KB Output is correct
3 Correct 11 ms 3960 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2704 KB Output is correct
6 Correct 12 ms 4296 KB Output is correct
7 Correct 12 ms 4060 KB Output is correct
8 Correct 10 ms 4088 KB Output is correct
9 Correct 10 ms 4088 KB Output is correct
10 Correct 4 ms 2728 KB Output is correct
11 Correct 4 ms 2680 KB Output is correct
12 Correct 4 ms 2680 KB Output is correct
13 Correct 4 ms 2680 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct
15 Correct 46 ms 4472 KB Output is correct
16 Correct 46 ms 4444 KB Output is correct
17 Correct 46 ms 4600 KB Output is correct
18 Correct 12 ms 4344 KB Output is correct
19 Correct 11 ms 4088 KB Output is correct
20 Correct 37 ms 4600 KB Output is correct
21 Correct 42 ms 4552 KB Output is correct
22 Correct 4 ms 2680 KB Output is correct
23 Correct 12 ms 3960 KB Output is correct
24 Correct 12 ms 3964 KB Output is correct
25 Correct 5 ms 2680 KB Output is correct
26 Correct 5 ms 2680 KB Output is correct
27 Correct 13 ms 4348 KB Output is correct
28 Correct 11 ms 4168 KB Output is correct
29 Correct 9 ms 4088 KB Output is correct
30 Correct 10 ms 4088 KB Output is correct
31 Correct 4 ms 2680 KB Output is correct
32 Correct 4 ms 2680 KB Output is correct
33 Correct 4 ms 2680 KB Output is correct
34 Correct 4 ms 2684 KB Output is correct
35 Correct 4 ms 2680 KB Output is correct
36 Correct 151 ms 21976 KB Output is correct
37 Correct 4 ms 2680 KB Output is correct
38 Correct 150 ms 21548 KB Output is correct
39 Correct 143 ms 20904 KB Output is correct
40 Correct 190 ms 21808 KB Output is correct
41 Correct 146 ms 22192 KB Output is correct
42 Correct 123 ms 19024 KB Output is correct
43 Correct 138 ms 17056 KB Output is correct
44 Correct 146 ms 16836 KB Output is correct
45 Correct 141 ms 16860 KB Output is correct
46 Correct 172 ms 16912 KB Output is correct
47 Correct 128 ms 19168 KB Output is correct
48 Correct 124 ms 19136 KB Output is correct
49 Correct 140 ms 19188 KB Output is correct
50 Correct 150 ms 19264 KB Output is correct
51 Correct 148 ms 21940 KB Output is correct
52 Correct 159 ms 21904 KB Output is correct
53 Correct 100 ms 16552 KB Output is correct
54 Correct 103 ms 16616 KB Output is correct
55 Correct 135 ms 16760 KB Output is correct
56 Correct 146 ms 16704 KB Output is correct
57 Correct 143 ms 16828 KB Output is correct
58 Correct 151 ms 16976 KB Output is correct
59 Correct 136 ms 16732 KB Output is correct
60 Correct 142 ms 17052 KB Output is correct
61 Correct 125 ms 19416 KB Output is correct
62 Correct 138 ms 19500 KB Output is correct
63 Correct 126 ms 19448 KB Output is correct
64 Correct 136 ms 19304 KB Output is correct
65 Correct 160 ms 16828 KB Output is correct
66 Correct 150 ms 16696 KB Output is correct
67 Correct 140 ms 16760 KB Output is correct
68 Correct 96 ms 16568 KB Output is correct
69 Correct 96 ms 16504 KB Output is correct
70 Correct 136 ms 19700 KB Output is correct
71 Correct 137 ms 18936 KB Output is correct
72 Correct 4 ms 2680 KB Output is correct
73 Correct 12 ms 4088 KB Output is correct
74 Correct 10 ms 3960 KB Output is correct
75 Correct 4 ms 2680 KB Output is correct
76 Correct 4 ms 2680 KB Output is correct
77 Correct 11 ms 4316 KB Output is correct
78 Correct 11 ms 4088 KB Output is correct
79 Correct 10 ms 4088 KB Output is correct
80 Correct 10 ms 4088 KB Output is correct
81 Correct 4 ms 2680 KB Output is correct
82 Correct 5 ms 2680 KB Output is correct
83 Correct 5 ms 2808 KB Output is correct
84 Correct 4 ms 2680 KB Output is correct
85 Correct 4 ms 2684 KB Output is correct
86 Correct 46 ms 4600 KB Output is correct
87 Correct 46 ms 4428 KB Output is correct
88 Correct 46 ms 4472 KB Output is correct
89 Correct 14 ms 4348 KB Output is correct
90 Correct 13 ms 4088 KB Output is correct
91 Correct 37 ms 4728 KB Output is correct
92 Correct 42 ms 4472 KB Output is correct
93 Correct 4 ms 2680 KB Output is correct
94 Correct 149 ms 21948 KB Output is correct
95 Correct 145 ms 21496 KB Output is correct
96 Correct 143 ms 20908 KB Output is correct
97 Correct 171 ms 21804 KB Output is correct
98 Correct 146 ms 22256 KB Output is correct
99 Correct 139 ms 16836 KB Output is correct
100 Correct 145 ms 16868 KB Output is correct
101 Correct 138 ms 16760 KB Output is correct
102 Correct 134 ms 17016 KB Output is correct
103 Correct 123 ms 19140 KB Output is correct
104 Correct 128 ms 19504 KB Output is correct
105 Correct 121 ms 19068 KB Output is correct
106 Correct 138 ms 19444 KB Output is correct
107 Correct 137 ms 19192 KB Output is correct
108 Correct 148 ms 21936 KB Output is correct
109 Correct 144 ms 22004 KB Output is correct
110 Correct 96 ms 16548 KB Output is correct
111 Correct 101 ms 16528 KB Output is correct
112 Correct 132 ms 16760 KB Output is correct
113 Correct 136 ms 16648 KB Output is correct