-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathexam_Array_Copy.cpp
More file actions
106 lines (89 loc) · 2.18 KB
/
exam_Array_Copy.cpp
File metadata and controls
106 lines (89 loc) · 2.18 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
#include <bits/stdc++.h> // all c++ libraries
// defines
#define faster_io ios_base::sync_with_stdio(false);cin.tie()
#define range(i,a,b) for(int i=a;i<=b;i++)
#define rrange(i,a,b) for(int i=a;i>=b;i--)
#define rangev(i,a) for(int i=0;i<a.size();i++)
#define rrangev(i,a) for(int i=a.size()-1;i>=0;i--)
#define rangem(x,v) for(typeof (v).begin() x=(v).begin();x!=(v).end();++x)
#define clr(a) memset(a, 0, sizeof(a))
#define all(a) a.begin(), a.end()
#define mp make_pair
#define pb push_back
#define st first
#define nd second
#define MX 300005
using namespace std;
typedef long long ll;
typedef vector <int> vi;
typedef pair <int, int> pii;
typedef vector <pii> vii;
typedef pair<double, int> pdi;
typedef vector<pdi> vdi;
const ll INF = 1e9 + 100;
const ll MOD = 1e9 + 7;
int N, M;
int A[MX], B[MX], tree[4*MX];
void create(int left, int right, int index) {
if(left == right) {
tree[index] = B[left];
return;
}
int mid = (left + right) / 2;
create(left, mid, index * 2);
create(mid + 1, right, index * 2 + 1);
}
void update(int left, int right, int index, int lA, int rA, int lB, int rB) {
if(left > rB || right < lB || left > right) {
return;
}
if(left >= lB && right <= rB && left == right) {
tree[index] = A[lA - lB + left];
B[left] = A[lA - lB + left];
return;
}
int mid = (left + right) / 2;
update(left, mid, index * 2, lA, rA, lB, rB);
update(mid + 1, right, index * 2 + 1, lA, rA, lB, rB);
return;
}
int main() {
faster_io;
cin >> N >> M;
range(i, 1, N) {
cin >> A[i];
}
range(i, 1, N) {
cin >> B[i];
}
create(2, N, 1);
range(i, 1, M) {
int type;
cin >> type;
if(type == 1) {
int x, v, k;
cin >> x >> v >> k;
update(1, N, 1, x + 1, x + k + 1, v + 1, v + k + 1);
} else if(type == 2) {
int x;
cin >> x;
cout << B[x + 1] << "\n";
}
}
return 0;
}
/*
5 10
1 2 0 -1 3
3 1 5 -2 0
2 4
1 2 2 3
2 4
2 3
2 0
1 1 0 4
2 0
2 3
1 3 1 1
2 1
*/