oj.uz

Submission #90972

# Submission time Handle Problem Language Result Execution time Memory
90972 2018-12-25T10:42:56 Z davitmarg Birthday gift (IZhO18_treearray) C++17
56 / 100
 1736 ms 79748 KB 
/*
DEATH-MATCH
Davit-Marg
*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <iterator>
#include <ctype.h>
#include <stdlib.h>  
#include <fstream>  
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
using namespace std;

int n, m, q, used[300005],d[300005], tin[300005],a[300005], timer;
vector<int> g[300005],ord;
set<int> pos1[300005], pos2[300005];
vector<int> t;

void build(int v,int l,int r)
{
	if (l == r)
	{
		t[v] = ord[l];
		return;
	}
	int m = (l + r) / 2;
	build(v * 2, l, m);
	build(v * 2 + 1, m + 1, r);
	if (d[t[v * 2]] <= d[t[v * 2 + 1]])
		t[v] = t[v * 2];
	else
		t[v] = t[v * 2 + 1];
}

int query(int v,int l,int r,int i,int j)
{
	int m = (l + r) / 2;
	if (l == i && r == j)
		return t[v];
	if (j <= m)
		return query(v * 2, l, m, i, j);
	else if (i >= m + 1)
		return query(v * 2 + 1, m + 1, r, i, j);
	else
	{
		int m1 = query(v * 2, l, m, i, m);
		int m2 = query(v * 2+1, m + 1, r, m + 1, j);
		if (d[m1] <= d[m2])
			return m1;
		else
			return m2;
	}
}

void dfs(int v)
{
	used[v] = 1;
	tin[v] = ord.size();
	ord.PB(v);
	for (int i = 0; i < g[v].size(); i++)
	{
		int to = g[v][i];
		if (used[to])
			continue;
		d[to] = d[v] + 1;
		dfs(to);
		ord.PB(v);
	}
}


int LCA(int a,int b)
{
	if (tin[a] > tin[b])
		swap(a,b);
	int res = query(1, 0, ord.size() - 1, tin[a], tin[b]);
	return res;
}

int main()
{
	cin >> n >> m >> q;
	for (int i = 1; i < n; i++)
	{
		int a, b;
		cin >> a >> b;
		g[a].PB(b);
		g[b].PB(a);
	}
	dfs(1);
	t.resize(ord.size()*4+10);
	build(1,0,ord.size()-1);
	for (int i = 0; i < m; i++)
		cin >> a[i];

	for (int i = 0; i < m; i++)
		pos1[a[i]].insert(i);
	for (int i = 0; i < m - 1; i++)
		pos2[LCA(a[i],a[i+1])].insert(i);


	for (int ii = 0; ii < q; ii++)
	{
		int t;
		scanf("%d",&t);
		if (t == 1)
		{
			int p, v;
			scanf("%d%d", &p,&v);
			p--;
			pos1[a[p]].erase(p);
			if (p + 1 < n)
				pos2[LCA(a[p], a[p + 1])].erase(p);
			if (p - 1 >= 0)
				pos2[LCA(a[p-1], a[p])].erase(p-1);

			a[p] = v;

			pos1[a[p]].insert(p);
			if (p + 1 < n)
				pos2[LCA(a[p], a[p + 1])].insert(p);
			if (p - 1 >= 0)
				pos2[LCA(a[p-1], a[p])].insert(p - 1);
		}
		else
		{
			int L, R, v;
			scanf("%d%d%d", &L, &R, &v);
			pair<int, int> ans = MP(-1, -1);
			L--;
			R--;
			set<int>::iterator it;
			it = pos1[v].lower_bound(L);
			if (it != pos1[v].end() && a[(*it)]==v && (*it) <= R)
				ans = MP((*it)+1, (*it)+1);

			it = pos2[v].lower_bound(L);
			if (it != pos2[v].end() && (*it)+1 <= R)
				ans = MP((*it)+1, (*it)+2);

			cout << ans.first << " " << ans.second << endl;
		}
	}


	return 0;
}
/*

5 4 4
1 2
3 1
3 4
5 3
4 5 2 3
2 1 3 1
1 3 5
2 3 4 5
2 1 3 1

*/

Compilation message

treearray.cpp: In function 'void dfs(int)':
treearray.cpp:73:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < g[v].size(); i++)
                  ~~^~~~~~~~~~~~~
treearray.cpp: In function 'int main()':
treearray.cpp:118:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&t);
   ~~~~~^~~~~~~~~
treearray.cpp:122:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d%d", &p,&v);
    ~~~~~^~~~~~~~~~~~~~~
treearray.cpp:141:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d%d%d", &L, &R, &v);
    ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 35576 KB n=5
2 Correct 34 ms 35756 KB n=100
3 Correct 33 ms 35756 KB n=100
4 Correct 33 ms 35768 KB n=100
5 Correct 35 ms 35844 KB n=100
6 Correct 35 ms 35844 KB n=100
7 Correct 34 ms 35920 KB n=100
8 Correct 33 ms 35920 KB n=100
9 Correct 34 ms 35920 KB n=100
10 Correct 34 ms 35920 KB n=100
11 Correct 33 ms 35920 KB n=100
12 Correct 34 ms 35920 KB n=100
13 Correct 29 ms 35920 KB n=100
14 Correct 31 ms 35920 KB n=100
15 Correct 34 ms 35920 KB n=100
16 Correct 34 ms 35920 KB n=100
17 Correct 35 ms 35920 KB n=100
18 Correct 34 ms 35920 KB n=100
19 Correct 34 ms 35920 KB n=100
20 Correct 33 ms 35920 KB n=100
21 Correct 34 ms 35920 KB n=100
22 Correct 33 ms 35920 KB n=100
23 Correct 33 ms 35920 KB n=100
24 Correct 28 ms 35920 KB n=100
25 Correct 33 ms 35920 KB n=100
26 Correct 29 ms 35920 KB n=12
27 Correct 35 ms 35920 KB n=100

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 35576 KB n=5
2 Correct 34 ms 35756 KB n=100
3 Correct 33 ms 35756 KB n=100
4 Correct 33 ms 35768 KB n=100
5 Correct 35 ms 35844 KB n=100
6 Correct 35 ms 35844 KB n=100
7 Correct 34 ms 35920 KB n=100
8 Correct 33 ms 35920 KB n=100
9 Correct 34 ms 35920 KB n=100
10 Correct 34 ms 35920 KB n=100
11 Correct 33 ms 35920 KB n=100
12 Correct 34 ms 35920 KB n=100
13 Correct 29 ms 35920 KB n=100
14 Correct 31 ms 35920 KB n=100
15 Correct 34 ms 35920 KB n=100
16 Correct 34 ms 35920 KB n=100
17 Correct 35 ms 35920 KB n=100
18 Correct 34 ms 35920 KB n=100
19 Correct 34 ms 35920 KB n=100
20 Correct 33 ms 35920 KB n=100
21 Correct 34 ms 35920 KB n=100
22 Correct 33 ms 35920 KB n=100
23 Correct 33 ms 35920 KB n=100
24 Correct 28 ms 35920 KB n=100
25 Correct 33 ms 35920 KB n=100
26 Correct 29 ms 35920 KB n=12
27 Correct 35 ms 35920 KB n=100
28 Correct 36 ms 36000 KB n=500
29 Correct 35 ms 36000 KB n=500
30 Correct 30 ms 36028 KB n=500
31 Correct 30 ms 36044 KB n=500
32 Correct 35 ms 36060 KB n=500
33 Correct 35 ms 36068 KB n=500
34 Correct 35 ms 36068 KB n=500
35 Correct 30 ms 36068 KB n=500
36 Correct 36 ms 36068 KB n=500
37 Correct 31 ms 36068 KB n=500
38 Correct 30 ms 36068 KB n=500
39 Correct 36 ms 36068 KB n=500
40 Correct 35 ms 36068 KB n=500
41 Correct 35 ms 36068 KB n=500
42 Correct 36 ms 36068 KB n=500
43 Correct 35 ms 36188 KB n=500
44 Correct 35 ms 36188 KB n=500
45 Correct 36 ms 36188 KB n=500
46 Correct 36 ms 36188 KB n=500
47 Correct 30 ms 36188 KB n=500
48 Correct 35 ms 36188 KB n=500
49 Correct 30 ms 36188 KB n=500
50 Correct 34 ms 36188 KB n=500
51 Correct 35 ms 36188 KB n=500
52 Correct 35 ms 36188 KB n=500
53 Correct 35 ms 36188 KB n=500
54 Correct 35 ms 36188 KB n=500
55 Correct 33 ms 36188 KB n=278
56 Correct 35 ms 36188 KB n=500
57 Correct 36 ms 36188 KB n=500
58 Correct 34 ms 36188 KB n=500

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 35576 KB n=5
2 Correct 34 ms 35756 KB n=100
3 Correct 33 ms 35756 KB n=100
4 Correct 33 ms 35768 KB n=100
5 Correct 35 ms 35844 KB n=100
6 Correct 35 ms 35844 KB n=100
7 Correct 34 ms 35920 KB n=100
8 Correct 33 ms 35920 KB n=100
9 Correct 34 ms 35920 KB n=100
10 Correct 34 ms 35920 KB n=100
11 Correct 33 ms 35920 KB n=100
12 Correct 34 ms 35920 KB n=100
13 Correct 29 ms 35920 KB n=100
14 Correct 31 ms 35920 KB n=100
15 Correct 34 ms 35920 KB n=100
16 Correct 34 ms 35920 KB n=100
17 Correct 35 ms 35920 KB n=100
18 Correct 34 ms 35920 KB n=100
19 Correct 34 ms 35920 KB n=100
20 Correct 33 ms 35920 KB n=100
21 Correct 34 ms 35920 KB n=100
22 Correct 33 ms 35920 KB n=100
23 Correct 33 ms 35920 KB n=100
24 Correct 28 ms 35920 KB n=100
25 Correct 33 ms 35920 KB n=100
26 Correct 29 ms 35920 KB n=12
27 Correct 35 ms 35920 KB n=100
28 Correct 36 ms 36000 KB n=500
29 Correct 35 ms 36000 KB n=500
30 Correct 30 ms 36028 KB n=500
31 Correct 30 ms 36044 KB n=500
32 Correct 35 ms 36060 KB n=500
33 Correct 35 ms 36068 KB n=500
34 Correct 35 ms 36068 KB n=500
35 Correct 30 ms 36068 KB n=500
36 Correct 36 ms 36068 KB n=500
37 Correct 31 ms 36068 KB n=500
38 Correct 30 ms 36068 KB n=500
39 Correct 36 ms 36068 KB n=500
40 Correct 35 ms 36068 KB n=500
41 Correct 35 ms 36068 KB n=500
42 Correct 36 ms 36068 KB n=500
43 Correct 35 ms 36188 KB n=500
44 Correct 35 ms 36188 KB n=500
45 Correct 36 ms 36188 KB n=500
46 Correct 36 ms 36188 KB n=500
47 Correct 30 ms 36188 KB n=500
48 Correct 35 ms 36188 KB n=500
49 Correct 30 ms 36188 KB n=500
50 Correct 34 ms 36188 KB n=500
51 Correct 35 ms 36188 KB n=500
52 Correct 35 ms 36188 KB n=500
53 Correct 35 ms 36188 KB n=500
54 Correct 35 ms 36188 KB n=500
55 Correct 33 ms 36188 KB n=278
56 Correct 35 ms 36188 KB n=500
57 Correct 36 ms 36188 KB n=500
58 Correct 34 ms 36188 KB n=500
59 Correct 39 ms 36324 KB n=2000
60 Correct 40 ms 36424 KB n=2000
61 Correct 41 ms 36424 KB n=2000
62 Correct 41 ms 36424 KB n=2000
63 Correct 41 ms 36424 KB n=2000
64 Correct 41 ms 36424 KB n=2000
65 Correct 41 ms 36424 KB n=2000
66 Correct 41 ms 36424 KB n=2000
67 Correct 41 ms 36424 KB n=2000
68 Correct 41 ms 36424 KB n=2000
69 Correct 41 ms 36564 KB n=2000
70 Correct 41 ms 36564 KB n=2000
71 Correct 40 ms 36564 KB n=2000
72 Correct 40 ms 36564 KB n=2000
73 Correct 40 ms 36564 KB n=2000
74 Correct 40 ms 36564 KB n=1844
75 Correct 40 ms 36564 KB n=2000
76 Correct 41 ms 36564 KB n=2000
77 Correct 41 ms 36564 KB n=2000
78 Correct 40 ms 36564 KB n=2000
79 Correct 36 ms 36564 KB n=2000
80 Correct 40 ms 36564 KB n=2000
81 Correct 41 ms 36564 KB n=2000
82 Correct 41 ms 36564 KB n=2000
83 Correct 40 ms 36564 KB n=2000
84 Correct 41 ms 36564 KB n=2000
85 Correct 40 ms 36564 KB n=2000
86 Correct 41 ms 36564 KB n=2000
87 Correct 40 ms 36564 KB n=2000
88 Correct 41 ms 36564 KB n=2000
89 Correct 41 ms 36564 KB n=2000
90 Correct 39 ms 36564 KB n=2000
91 Correct 40 ms 36564 KB n=2000

Subtask #4
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 35576 KB n=5
2 Correct 34 ms 35756 KB n=100
3 Correct 33 ms 35756 KB n=100
4 Correct 33 ms 35768 KB n=100
5 Correct 35 ms 35844 KB n=100
6 Correct 35 ms 35844 KB n=100
7 Correct 34 ms 35920 KB n=100
8 Correct 33 ms 35920 KB n=100
9 Correct 34 ms 35920 KB n=100
10 Correct 34 ms 35920 KB n=100
11 Correct 33 ms 35920 KB n=100
12 Correct 34 ms 35920 KB n=100
13 Correct 29 ms 35920 KB n=100
14 Correct 31 ms 35920 KB n=100
15 Correct 34 ms 35920 KB n=100
16 Correct 34 ms 35920 KB n=100
17 Correct 35 ms 35920 KB n=100
18 Correct 34 ms 35920 KB n=100
19 Correct 34 ms 35920 KB n=100
20 Correct 33 ms 35920 KB n=100
21 Correct 34 ms 35920 KB n=100
22 Correct 33 ms 35920 KB n=100
23 Correct 33 ms 35920 KB n=100
24 Correct 28 ms 35920 KB n=100
25 Correct 33 ms 35920 KB n=100
26 Correct 29 ms 35920 KB n=12
27 Correct 35 ms 35920 KB n=100
28 Correct 36 ms 36000 KB n=500
29 Correct 35 ms 36000 KB n=500
30 Correct 30 ms 36028 KB n=500
31 Correct 30 ms 36044 KB n=500
32 Correct 35 ms 36060 KB n=500
33 Correct 35 ms 36068 KB n=500
34 Correct 35 ms 36068 KB n=500
35 Correct 30 ms 36068 KB n=500
36 Correct 36 ms 36068 KB n=500
37 Correct 31 ms 36068 KB n=500
38 Correct 30 ms 36068 KB n=500
39 Correct 36 ms 36068 KB n=500
40 Correct 35 ms 36068 KB n=500
41 Correct 35 ms 36068 KB n=500
42 Correct 36 ms 36068 KB n=500
43 Correct 35 ms 36188 KB n=500
44 Correct 35 ms 36188 KB n=500
45 Correct 36 ms 36188 KB n=500
46 Correct 36 ms 36188 KB n=500
47 Correct 30 ms 36188 KB n=500
48 Correct 35 ms 36188 KB n=500
49 Correct 30 ms 36188 KB n=500
50 Correct 34 ms 36188 KB n=500
51 Correct 35 ms 36188 KB n=500
52 Correct 35 ms 36188 KB n=500
53 Correct 35 ms 36188 KB n=500
54 Correct 35 ms 36188 KB n=500
55 Correct 33 ms 36188 KB n=278
56 Correct 35 ms 36188 KB n=500
57 Correct 36 ms 36188 KB n=500
58 Correct 34 ms 36188 KB n=500
59 Correct 39 ms 36324 KB n=2000
60 Correct 40 ms 36424 KB n=2000
61 Correct 41 ms 36424 KB n=2000
62 Correct 41 ms 36424 KB n=2000
63 Correct 41 ms 36424 KB n=2000
64 Correct 41 ms 36424 KB n=2000
65 Correct 41 ms 36424 KB n=2000
66 Correct 41 ms 36424 KB n=2000
67 Correct 41 ms 36424 KB n=2000
68 Correct 41 ms 36424 KB n=2000
69 Correct 41 ms 36564 KB n=2000
70 Correct 41 ms 36564 KB n=2000
71 Correct 40 ms 36564 KB n=2000
72 Correct 40 ms 36564 KB n=2000
73 Correct 40 ms 36564 KB n=2000
74 Correct 40 ms 36564 KB n=1844
75 Correct 40 ms 36564 KB n=2000
76 Correct 41 ms 36564 KB n=2000
77 Correct 41 ms 36564 KB n=2000
78 Correct 40 ms 36564 KB n=2000
79 Correct 36 ms 36564 KB n=2000
80 Correct 40 ms 36564 KB n=2000
81 Correct 41 ms 36564 KB n=2000
82 Correct 41 ms 36564 KB n=2000
83 Correct 40 ms 36564 KB n=2000
84 Correct 41 ms 36564 KB n=2000
85 Correct 40 ms 36564 KB n=2000
86 Correct 41 ms 36564 KB n=2000
87 Correct 40 ms 36564 KB n=2000
88 Correct 41 ms 36564 KB n=2000
89 Correct 41 ms 36564 KB n=2000
90 Correct 39 ms 36564 KB n=2000
91 Correct 40 ms 36564 KB n=2000
92 Correct 1404 ms 74480 KB n=200000
93 Correct 1284 ms 76692 KB n=200000
94 Correct 1360 ms 78864 KB n=200000
95 Correct 1392 ms 78864 KB n=200000
96 Correct 1530 ms 78864 KB n=200000
97 Correct 1575 ms 78864 KB n=200000
98 Correct 1514 ms 78864 KB n=200000
99 Correct 1671 ms 78864 KB n=200000
100 Correct 1498 ms 78864 KB n=200000
101 Correct 1449 ms 79584 KB n=200000
102 Correct 901 ms 79584 KB n=200000
103 Correct 966 ms 79584 KB n=200000
104 Correct 981 ms 79584 KB n=200000
105 Correct 990 ms 79584 KB n=200000
106 Correct 911 ms 79584 KB n=200000
107 Correct 929 ms 79584 KB n=200000
108 Correct 1599 ms 79584 KB n=200000
109 Correct 1620 ms 79584 KB n=200000
110 Correct 1434 ms 79584 KB n=200000
111 Correct 1587 ms 79584 KB n=200000
112 Correct 1212 ms 79584 KB n=200000
113 Correct 1444 ms 79584 KB n=200000
114 Correct 1658 ms 79584 KB n=200000
115 Correct 1736 ms 79584 KB n=200000
116 Correct 1404 ms 79584 KB n=200000
117 Correct 1390 ms 79584 KB n=200000
118 Correct 1366 ms 79584 KB n=200000
119 Correct 1252 ms 79584 KB n=200000
120 Correct 1208 ms 79584 KB n=200000
121 Correct 1334 ms 79584 KB n=200000
122 Correct 1365 ms 79748 KB n=200000
123 Correct 966 ms 79748 KB n=200000
124 Incorrect 396 ms 79748 KB Wrong range.