oj.uz

Submission #145156

# Submission time Handle Problem Language Result Execution time Memory
145156 2019-08-18T22:54:15 Z tincamatei Railway (BOI17_railway) C++14
100 / 100
 170 ms 26024 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 100000;
const int MAX_K = 50000;

vector<int> graph[1+MAX_N];
vector<int> updates[1+MAX_N];
int lim[MAX_K], subtree[1+MAX_N];

struct SubTreeCnt {
	int cnt[MAX_K];
	int active;
	vector<int> history;

	SubTreeCnt() {
		for(int i = 0; i < MAX_K; ++i)
			cnt[i] = 0;
		active = 0;
	}

	void clear() {
		for(auto it: history)
			cnt[it]--;
		active = 0;
		history.clear();
	}

	void insert(int x) {
		if(cnt[x] == 0)
			++active;
		if(cnt[x] == lim[x] - 1)
			--active;
		cnt[x]++;

		history.push_back(x);
	}

	int getActive() {
		return active;
	}
} freq;

struct Edge {
	int a, b;
	int cnt;
	int other(int x) {
		return a ^ b ^ x;
	}
} edges[MAX_N - 1];

void predfs(int nod, int fatherEdge = -1) {
	subtree[nod] = 1;
	for(auto it: graph[nod]) {
		int son = edges[it].other(nod);
		if(it != fatherEdge) {
			predfs(son, it);
			subtree[nod] += subtree[son];
		}
	}
}

void updateDfs(int nod, int fatherEdge = -1) {
	for(auto it: updates[nod])
		freq.insert(it);
	
	for(auto it: graph[nod]) {
		int son = edges[it].other(nod);
		if(it != fatherEdge)
			updateDfs(son, it);
	}
}

void dfs(int nod, int fatherEdge = -1) {
	int heavyson = -1, heavyedge = -1;
	for(auto it: graph[nod]) {
		int son = edges[it].other(nod);
		if(it != fatherEdge && (heavyson == -1 || (heavyson != -1 && subtree[son] > subtree[heavyson]))) {
			heavyson = son;
			heavyedge = it;
		}
	}

	for(auto it: graph[nod]) {
		int son = edges[it].other(nod);
		if(it != fatherEdge && son != heavyson) {
			dfs(son, it);
			edges[it].cnt = freq.getActive();
			freq.clear();
		}
	}

	if(heavyson != -1) {
		dfs(heavyson, heavyedge);
		edges[heavyedge].cnt = freq.getActive();
		for(auto it: graph[nod]) {
			int son = edges[it].other(nod);
			if(it != fatherEdge && son != heavyson)
				updateDfs(son, it);
		}
	}

	for(auto it: updates[nod])
		freq.insert(it);
}

int main() {
	int n, m, k, a, b, s, nr;

	scanf("%d%d%d", &n, &m, &k);
	for(int i = 0; i < n - 1; ++i) {
		scanf("%d%d", &a, &b);
		edges[i].a = a;
		edges[i].b = b;
		graph[a].push_back(i);
		graph[b].push_back(i);
	}
	for(int i = 0; i < m; ++i) {
		scanf("%d", &s);
		for(int j = 0; j < s; ++j) {
			scanf("%d", &a);
			updates[a].push_back(i);
		}
		lim[i] = s;
	}

	predfs(1);
	dfs(1);

	nr = 0;
	for(int i = 0; i < n - 1; ++i)
		if(edges[i].cnt >= k)
			++nr;
	
	printf("%d\n", nr);
	for(int i = 0; i < n - 1; ++i)
		if(edges[i].cnt >= k)
			printf("%d ", i + 1);

	return 0;
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:111:7: 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:113: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:120:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &s);
   ~~~~~^~~~~~~~~~
railway.cpp:122:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &a);
    ~~~~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5240 KB Output is correct
2 Correct 14 ms 5880 KB Output is correct
3 Correct 13 ms 5880 KB Output is correct
4 Correct 8 ms 5240 KB Output is correct
5 Correct 6 ms 5240 KB Output is correct
6 Correct 13 ms 6520 KB Output is correct
7 Correct 12 ms 6008 KB Output is correct
8 Correct 11 ms 5880 KB Output is correct
9 Correct 12 ms 6008 KB Output is correct
10 Correct 6 ms 5240 KB Output is correct
11 Correct 7 ms 5240 KB Output is correct
12 Correct 6 ms 5240 KB Output is correct
13 Correct 7 ms 5240 KB Output is correct
14 Correct 7 ms 5240 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5240 KB Output is correct
2 Correct 14 ms 5880 KB Output is correct
3 Correct 13 ms 5880 KB Output is correct
4 Correct 8 ms 5240 KB Output is correct
5 Correct 6 ms 5240 KB Output is correct
6 Correct 13 ms 6520 KB Output is correct
7 Correct 12 ms 6008 KB Output is correct
8 Correct 11 ms 5880 KB Output is correct
9 Correct 12 ms 6008 KB Output is correct
10 Correct 6 ms 5240 KB Output is correct
11 Correct 7 ms 5240 KB Output is correct
12 Correct 6 ms 5240 KB Output is correct
13 Correct 7 ms 5240 KB Output is correct
14 Correct 7 ms 5240 KB Output is correct
15 Correct 33 ms 7544 KB Output is correct
16 Correct 33 ms 7412 KB Output is correct
17 Correct 33 ms 7412 KB Output is correct
18 Correct 12 ms 6392 KB Output is correct
19 Correct 13 ms 6008 KB Output is correct
20 Correct 33 ms 7800 KB Output is correct
21 Correct 33 ms 7796 KB Output is correct
22 Correct 6 ms 5240 KB Output is correct
23 Correct 13 ms 5880 KB Output is correct
24 Correct 14 ms 5880 KB Output is correct
25 Correct 6 ms 5240 KB Output is correct
26 Correct 6 ms 5240 KB Output is correct
27 Correct 13 ms 6392 KB Output is correct
28 Correct 13 ms 6008 KB Output is correct
29 Correct 11 ms 5880 KB Output is correct
30 Correct 12 ms 5880 KB Output is correct
31 Correct 6 ms 5240 KB Output is correct
32 Correct 6 ms 5240 KB Output is correct
33 Correct 6 ms 5240 KB Output is correct
34 Correct 6 ms 5240 KB Output is correct
35 Correct 6 ms 5240 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 23972 KB Output is correct
2 Correct 6 ms 5240 KB Output is correct
3 Correct 105 ms 23924 KB Output is correct
4 Correct 102 ms 23672 KB Output is correct
5 Correct 105 ms 24004 KB Output is correct
6 Correct 101 ms 24044 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 16884 KB Output is correct
2 Correct 106 ms 13832 KB Output is correct
3 Correct 129 ms 13436 KB Output is correct
4 Correct 130 ms 13344 KB Output is correct
5 Correct 123 ms 13436 KB Output is correct
6 Correct 91 ms 18676 KB Output is correct
7 Correct 90 ms 18804 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 16884 KB Output is correct
2 Correct 106 ms 13832 KB Output is correct
3 Correct 129 ms 13436 KB Output is correct
4 Correct 130 ms 13344 KB Output is correct
5 Correct 123 ms 13436 KB Output is correct
6 Correct 91 ms 18676 KB Output is correct
7 Correct 90 ms 18804 KB Output is correct
8 Correct 99 ms 19448 KB Output is correct
9 Correct 98 ms 19448 KB Output is correct
10 Correct 99 ms 25716 KB Output is correct
11 Correct 101 ms 25588 KB Output is correct
12 Correct 87 ms 14324 KB Output is correct
13 Correct 86 ms 14324 KB Output is correct
14 Correct 123 ms 13052 KB Output is correct
15 Correct 128 ms 13048 KB Output is correct
16 Correct 123 ms 13308 KB Output is correct
17 Correct 133 ms 13352 KB Output is correct
18 Correct 122 ms 13300 KB Output is correct
19 Correct 100 ms 13812 KB Output is correct
20 Correct 101 ms 18744 KB Output is correct
21 Correct 100 ms 18800 KB Output is correct
22 Correct 95 ms 18676 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5240 KB Output is correct
2 Correct 14 ms 5880 KB Output is correct
3 Correct 13 ms 5880 KB Output is correct
4 Correct 8 ms 5240 KB Output is correct
5 Correct 6 ms 5240 KB Output is correct
6 Correct 13 ms 6520 KB Output is correct
7 Correct 12 ms 6008 KB Output is correct
8 Correct 11 ms 5880 KB Output is correct
9 Correct 12 ms 6008 KB Output is correct
10 Correct 6 ms 5240 KB Output is correct
11 Correct 7 ms 5240 KB Output is correct
12 Correct 6 ms 5240 KB Output is correct
13 Correct 7 ms 5240 KB Output is correct
14 Correct 7 ms 5240 KB Output is correct
15 Correct 33 ms 7544 KB Output is correct
16 Correct 33 ms 7412 KB Output is correct
17 Correct 33 ms 7412 KB Output is correct
18 Correct 12 ms 6392 KB Output is correct
19 Correct 13 ms 6008 KB Output is correct
20 Correct 33 ms 7800 KB Output is correct
21 Correct 33 ms 7796 KB Output is correct
22 Correct 6 ms 5240 KB Output is correct
23 Correct 13 ms 5880 KB Output is correct
24 Correct 14 ms 5880 KB Output is correct
25 Correct 6 ms 5240 KB Output is correct
26 Correct 6 ms 5240 KB Output is correct
27 Correct 13 ms 6392 KB Output is correct
28 Correct 13 ms 6008 KB Output is correct
29 Correct 11 ms 5880 KB Output is correct
30 Correct 12 ms 5880 KB Output is correct
31 Correct 6 ms 5240 KB Output is correct
32 Correct 6 ms 5240 KB Output is correct
33 Correct 6 ms 5240 KB Output is correct
34 Correct 6 ms 5240 KB Output is correct
35 Correct 6 ms 5240 KB Output is correct
36 Correct 108 ms 23972 KB Output is correct
37 Correct 6 ms 5240 KB Output is correct
38 Correct 105 ms 23924 KB Output is correct
39 Correct 102 ms 23672 KB Output is correct
40 Correct 105 ms 24004 KB Output is correct
41 Correct 101 ms 24044 KB Output is correct
42 Correct 87 ms 16884 KB Output is correct
43 Correct 106 ms 13832 KB Output is correct
44 Correct 129 ms 13436 KB Output is correct
45 Correct 130 ms 13344 KB Output is correct
46 Correct 123 ms 13436 KB Output is correct
47 Correct 91 ms 18676 KB Output is correct
48 Correct 90 ms 18804 KB Output is correct
49 Correct 99 ms 19448 KB Output is correct
50 Correct 98 ms 19448 KB Output is correct
51 Correct 99 ms 25716 KB Output is correct
52 Correct 101 ms 25588 KB Output is correct
53 Correct 87 ms 14324 KB Output is correct
54 Correct 86 ms 14324 KB Output is correct
55 Correct 123 ms 13052 KB Output is correct
56 Correct 128 ms 13048 KB Output is correct
57 Correct 123 ms 13308 KB Output is correct
58 Correct 133 ms 13352 KB Output is correct
59 Correct 122 ms 13300 KB Output is correct
60 Correct 100 ms 13812 KB Output is correct
61 Correct 101 ms 18744 KB Output is correct
62 Correct 100 ms 18800 KB Output is correct
63 Correct 95 ms 18676 KB Output is correct
64 Correct 103 ms 19372 KB Output is correct
65 Correct 170 ms 14692 KB Output is correct
66 Correct 160 ms 14332 KB Output is correct
67 Correct 133 ms 14072 KB Output is correct
68 Correct 85 ms 13416 KB Output is correct
69 Correct 78 ms 13432 KB Output is correct
70 Correct 103 ms 19440 KB Output is correct
71 Correct 100 ms 19448 KB Output is correct
72 Correct 6 ms 5240 KB Output is correct
73 Correct 13 ms 5880 KB Output is correct
74 Correct 13 ms 5880 KB Output is correct
75 Correct 6 ms 5240 KB Output is correct
76 Correct 6 ms 5240 KB Output is correct
77 Correct 12 ms 6392 KB Output is correct
78 Correct 13 ms 6008 KB Output is correct
79 Correct 10 ms 5880 KB Output is correct
80 Correct 11 ms 5880 KB Output is correct
81 Correct 6 ms 5240 KB Output is correct
82 Correct 6 ms 5240 KB Output is correct
83 Correct 6 ms 5240 KB Output is correct
84 Correct 6 ms 5240 KB Output is correct
85 Correct 6 ms 5368 KB Output is correct
86 Correct 32 ms 7412 KB Output is correct
87 Correct 32 ms 7412 KB Output is correct
88 Correct 32 ms 7412 KB Output is correct
89 Correct 13 ms 6520 KB Output is correct
90 Correct 12 ms 6008 KB Output is correct
91 Correct 35 ms 7772 KB Output is correct
92 Correct 33 ms 7796 KB Output is correct
93 Correct 6 ms 5240 KB Output is correct
94 Correct 110 ms 25892 KB Output is correct
95 Correct 108 ms 25588 KB Output is correct
96 Correct 96 ms 25464 KB Output is correct
97 Correct 103 ms 25588 KB Output is correct
98 Correct 118 ms 26024 KB Output is correct
99 Correct 125 ms 13448 KB Output is correct
100 Correct 129 ms 13436 KB Output is correct
101 Correct 132 ms 13308 KB Output is correct
102 Correct 107 ms 13812 KB Output is correct
103 Correct 98 ms 18676 KB Output is correct
104 Correct 95 ms 18796 KB Output is correct
105 Correct 89 ms 18696 KB Output is correct
106 Correct 103 ms 19572 KB Output is correct
107 Correct 109 ms 19596 KB Output is correct
108 Correct 100 ms 25584 KB Output is correct
109 Correct 102 ms 25600 KB Output is correct
110 Correct 91 ms 14324 KB Output is correct
111 Correct 88 ms 14296 KB Output is correct
112 Correct 126 ms 13212 KB Output is correct
113 Correct 131 ms 13048 KB Output is correct