답안 #27155 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
27155	2017-07-09T17:18:56 Z	wwiiiii	트리 (KOI16_tree)	C++14	36 / 100	2000 ms	38536 KB

tree

#include <cstdio>
#include <vector>
#include <queue>
#include <set>
using namespace std;
const int N = 200100;
set<int> adj[N];
int parent[N];
int treeidx[N];
int n, q, maxidx, visitmax;
int visited[N];
void reindex(int node) {
	treeidx[node] = maxidx;
	for (auto next : adj[node]) {
		if (treeidx[next] != maxidx) {
			treeidx[next] = maxidx;
			reindex(next);
		}
	}
}

void cut(int node)
{
	visitmax++;
	if (node == parent[node]) return;
	adj[node].erase(parent[node]);
	adj[parent[node]].erase(node);
	queue<int> q, pq;
	q.push(node); pq.push(parent[node]);
	int qnow = -1, pqnow = -1;
	set<int>::iterator qit, pqit;
	while ((!q.empty()) && (!pq.empty()))
	{
		while (qnow == -1 || qit == adj[qnow].end()) {
			if (q.empty()) break;
			qnow = q.front(); q.pop();
			qit = adj[qnow].begin();
			while (qit != adj[qnow].end() && visited[*qit] == visitmax) qit++;
		}
		if (!q.empty()) {
			visited[*qit] = visitmax;
			q.push(*qit); qit++;
		}
		while (pqnow == -1 || pqit == adj[pqnow].end()) {
			if (pq.empty()) break;
			pqnow = pq.front(); pq.pop();
			pqit = adj[pqnow].begin();
			while (pqit != adj[pqnow].end() && visited[*pqit] == visitmax) pqit++;
		}
		if (!pq.empty()) {
			visited[*qit] = visitmax;
			pq.push(*pqit); pqit++;
		}
	}

	maxidx++;
	if (q.empty()) reindex(node);
	else reindex(parent[node]);

	parent[node] = node;

}

int main()
{
	scanf("%d %d", &n, &q);
	for (int i = 2; i <= n; i++) {
		scanf("%d", &parent[i]);
		adj[parent[i]].insert(i);
		adj[i].insert(parent[i]);
	}
	while (q--) {
		int b, c, d; scanf("%d %d %d", &b, &c, &d);
		switch (d)
		{
		case 0:
			puts(treeidx[b] == treeidx[c] ? "YES" : "NO"); break;
		case 1:
			if (treeidx[b] == treeidx[c])
			{
				puts("YES"); cut(b);
			}
			else
			{
				puts("NO"); cut(c);
			}
		}
	}
}

Compilation message

tree.cpp: In function 'int main()':
tree.cpp:66:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &q);
                        ^
tree.cpp:68:26: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &parent[i]);
                          ^
tree.cpp:73:45: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int b, c, d; scanf("%d %d %d", &b, &c, &d);
                                             ^

Subtask #1
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	13796 KB	Output is correct
2	Correct	3 ms	13796 KB	Output is correct
3	Correct	6 ms	13796 KB	Output is correct
4	Correct	3 ms	13796 KB	Output is correct
5	Correct	3 ms	13796 KB	Output is correct
6	Correct	3 ms	13796 KB	Output is correct
7	Correct	3 ms	13796 KB	Output is correct
8	Correct	3 ms	13796 KB	Output is correct
9	Correct	0 ms	13796 KB	Output is correct
10	Correct	6 ms	13796 KB	Output is correct

Subtask #2
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	13796 KB	Output is correct
2	Correct	3 ms	13796 KB	Output is correct
3	Correct	6 ms	13796 KB	Output is correct
4	Correct	3 ms	13796 KB	Output is correct
5	Correct	3 ms	13796 KB	Output is correct
6	Correct	3 ms	13796 KB	Output is correct
7	Correct	3 ms	13796 KB	Output is correct
8	Correct	3 ms	13796 KB	Output is correct
9	Correct	0 ms	13796 KB	Output is correct
10	Correct	6 ms	13796 KB	Output is correct
11	Correct	3 ms	13796 KB	Output is correct
12	Correct	3 ms	13796 KB	Output is correct
13	Correct	0 ms	13796 KB	Output is correct
14	Correct	0 ms	13796 KB	Output is correct
15	Correct	0 ms	13796 KB	Output is correct
16	Correct	3 ms	13796 KB	Output is correct
17	Correct	0 ms	13796 KB	Output is correct
18	Correct	3 ms	13796 KB	Output is correct
19	Correct	3 ms	13796 KB	Output is correct
20	Correct	3 ms	13796 KB	Output is correct
21	Correct	3 ms	13796 KB	Output is correct

Subtask #3
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	13796 KB	Output is correct
2	Correct	3 ms	13796 KB	Output is correct
3	Correct	6 ms	13796 KB	Output is correct
4	Correct	3 ms	13796 KB	Output is correct
5	Correct	3 ms	13796 KB	Output is correct
6	Correct	3 ms	13796 KB	Output is correct
7	Correct	3 ms	13796 KB	Output is correct
8	Correct	3 ms	13796 KB	Output is correct
9	Correct	0 ms	13796 KB	Output is correct
10	Correct	6 ms	13796 KB	Output is correct
11	Correct	3 ms	13796 KB	Output is correct
12	Correct	3 ms	13796 KB	Output is correct
13	Correct	0 ms	13796 KB	Output is correct
14	Correct	0 ms	13796 KB	Output is correct
15	Correct	0 ms	13796 KB	Output is correct
16	Correct	3 ms	13796 KB	Output is correct
17	Correct	0 ms	13796 KB	Output is correct
18	Correct	3 ms	13796 KB	Output is correct
19	Correct	3 ms	13796 KB	Output is correct
20	Correct	3 ms	13796 KB	Output is correct
21	Correct	3 ms	13796 KB	Output is correct
22	Correct	76 ms	13928 KB	Output is correct
23	Correct	73 ms	13928 KB	Output is correct
24	Correct	66 ms	13928 KB	Output is correct
25	Correct	89 ms	13928 KB	Output is correct
26	Correct	96 ms	13928 KB	Output is correct
27	Correct	76 ms	13928 KB	Output is correct
28	Correct	69 ms	13928 KB	Output is correct
29	Correct	79 ms	13928 KB	Output is correct
30	Correct	73 ms	13928 KB	Output is correct
31	Correct	99 ms	13928 KB	Output is correct

Subtask #4
0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	13796 KB	Output is correct
2	Correct	3 ms	13796 KB	Output is correct
3	Correct	6 ms	13796 KB	Output is correct
4	Correct	3 ms	13796 KB	Output is correct
5	Correct	3 ms	13796 KB	Output is correct
6	Correct	3 ms	13796 KB	Output is correct
7	Correct	3 ms	13796 KB	Output is correct
8	Correct	3 ms	13796 KB	Output is correct
9	Correct	0 ms	13796 KB	Output is correct
10	Correct	6 ms	13796 KB	Output is correct
11	Correct	1223 ms	36712 KB	Output is correct
12	Correct	1279 ms	38200 KB	Output is correct
13	Correct	1279 ms	36664 KB	Output is correct
14	Correct	1163 ms	36792 KB	Output is correct
15	Correct	1163 ms	35480 KB	Output is correct
16	Correct	576 ms	34748 KB	Output is correct
17	Execution timed out	2000 ms	38536 KB	Execution timed out
18	Halted	0 ms	0 KB	-

Subtask #5
0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	13796 KB	Output is correct
2	Correct	3 ms	13796 KB	Output is correct
3	Correct	6 ms	13796 KB	Output is correct
4	Correct	3 ms	13796 KB	Output is correct
5	Correct	3 ms	13796 KB	Output is correct
6	Correct	3 ms	13796 KB	Output is correct
7	Correct	3 ms	13796 KB	Output is correct
8	Correct	3 ms	13796 KB	Output is correct
9	Correct	0 ms	13796 KB	Output is correct
10	Correct	6 ms	13796 KB	Output is correct
11	Correct	3 ms	13796 KB	Output is correct
12	Correct	3 ms	13796 KB	Output is correct
13	Correct	0 ms	13796 KB	Output is correct
14	Correct	0 ms	13796 KB	Output is correct
15	Correct	0 ms	13796 KB	Output is correct
16	Correct	3 ms	13796 KB	Output is correct
17	Correct	0 ms	13796 KB	Output is correct
18	Correct	3 ms	13796 KB	Output is correct
19	Correct	3 ms	13796 KB	Output is correct
20	Correct	3 ms	13796 KB	Output is correct
21	Correct	3 ms	13796 KB	Output is correct
22	Correct	76 ms	13928 KB	Output is correct
23	Correct	73 ms	13928 KB	Output is correct
24	Correct	66 ms	13928 KB	Output is correct
25	Correct	89 ms	13928 KB	Output is correct
26	Correct	96 ms	13928 KB	Output is correct
27	Correct	76 ms	13928 KB	Output is correct
28	Correct	69 ms	13928 KB	Output is correct
29	Correct	79 ms	13928 KB	Output is correct
30	Correct	73 ms	13928 KB	Output is correct
31	Correct	99 ms	13928 KB	Output is correct
32	Correct	1223 ms	36712 KB	Output is correct
33	Correct	1279 ms	38200 KB	Output is correct
34	Correct	1279 ms	36664 KB	Output is correct
35	Correct	1163 ms	36792 KB	Output is correct
36	Correct	1163 ms	35480 KB	Output is correct
37	Correct	576 ms	34748 KB	Output is correct
38	Execution timed out	2000 ms	38536 KB	Execution timed out
39	Halted	0 ms	0 KB	-

답안 #27155

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 13.0 / 13.0

Subtask #3 14.0 / 14.0

Subtask #4 0 / 19.0

Subtask #5 0 / 45.0

Subtask #1
9.0 / 9.0

Subtask #2
13.0 / 13.0

Subtask #3
14.0 / 14.0

Subtask #4
0 / 19.0

Subtask #5
0 / 45.0