#include <bits/stdc++.h> using namespace std; const int maxN = 500001, maxTreeSize = 1 << 20, INF = 1000000001; struct Tree { int offset, query_begin, query_end, res, T[maxTreeSize]; void query_priv(int v, int left, int right) { if (left >= query_end or right <= query_begin) return; if (left >= query_begin and right <= query_end) { res = min(res, T[v]); return; } query_priv(v * 2, left, (left + right) / 2); query_priv(v*2+1, (left + right) / 2, right); } void init(int n, vector <pair <int, int> >* t) { for (offset = 1; offset < n; offset *= 2); for (int i=0; i<n; i++) T[i + offset] = t[i + 1][0].first; for (int i=offset+n; i<offset*2; i++) T[i] = INF; for (int i=offset-1; i>0; i--) T[i] = min(T[i * 2], T[i*2+1]); } void change(int v, int val) { v += offset - 1; T[v] = val; for (v /= 2; v > 0; v /= 2) T[v] = min(T[v * 2], T[v*2+1]); } int get_min(int a, int b) { query_begin = a + offset - 1; query_end = b + offset - 1; res = INF; query_priv(1, offset, offset * 2); return res; } int fst_smaller(int v, int val) { v += offset - 1; while (T[v] >= val) v = (v & 1) ? v + 1 : v / 2; while (v < offset) v = T[v * 2] < val ? v * 2 : v*2+1; return v - offset + 1; } } tree; struct Node { int begin, end, val; vector <int> children; Node (int a = 0, int b = 0, int c = 0) { begin = a, end = b, val = c; } } T[maxN * 4]; int n, m, Tsize = 1, P[maxN], it[maxN]; vector <pair <int, int> > changes[maxN]; bool cmp(const int& a, const int& b) { if (T[a].val == T[b].val) return a < b; return T[a].val < T[b].val; } void go(int v, int d) { if (tree.get_min(d, n + 1) >= T[v].end) return; int row = tree.fst_smaller(d, T[v].end); int prev_col = T[v].begin; int& j = it[row]; while (changes[row][j].first < T[v].end) { int col = changes[row][j].first; T[v].children.push_back(Tsize); T[Tsize++] = Node(prev_col, col, P[row]); go(Tsize-1, row+1); P[row] = changes[row][j].second; j++; prev_col = col; } T[v].children.push_back(Tsize); T[Tsize++] = Node(prev_col, T[v].end, P[row]); go(Tsize-1, row+1); tree.change(row, changes[row][j].first); sort(T[v].children.begin(), T[v].children.end(), cmp); } void print(int v) { for (int u : T[v].children) print(u); if (T[v].children.empty()) for (int i=T[v].begin; i<T[v].end; i++) printf("%d ", i); } int main() { scanf ("%d%d", &n, &m); for (int i=1; i<=n; i++) scanf ("%d", P + i); for (int i=2; i<=m; i++) { int p, x; scanf ("%d%d", &p, &x); changes[p].push_back(make_pair(i, x)); } for (int i=1; i<=n; i++) changes[i].push_back(make_pair(m+1, 0)); tree.init(n, changes); T[0] = Node(1, m + 1, 0); go(0, 1); print(0); printf("\n"); return 0; }
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 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 | #include <bits/stdc++.h> using namespace std; const int maxN = 500001, maxTreeSize = 1 << 20, INF = 1000000001; struct Tree { int offset, query_begin, query_end, res, T[maxTreeSize]; void query_priv(int v, int left, int right) { if (left >= query_end or right <= query_begin) return; if (left >= query_begin and right <= query_end) { res = min(res, T[v]); return; } query_priv(v * 2, left, (left + right) / 2); query_priv(v*2+1, (left + right) / 2, right); } void init(int n, vector <pair <int, int> >* t) { for (offset = 1; offset < n; offset *= 2); for (int i=0; i<n; i++) T[i + offset] = t[i + 1][0].first; for (int i=offset+n; i<offset*2; i++) T[i] = INF; for (int i=offset-1; i>0; i--) T[i] = min(T[i * 2], T[i*2+1]); } void change(int v, int val) { v += offset - 1; T[v] = val; for (v /= 2; v > 0; v /= 2) T[v] = min(T[v * 2], T[v*2+1]); } int get_min(int a, int b) { query_begin = a + offset - 1; query_end = b + offset - 1; res = INF; query_priv(1, offset, offset * 2); return res; } int fst_smaller(int v, int val) { v += offset - 1; while (T[v] >= val) v = (v & 1) ? v + 1 : v / 2; while (v < offset) v = T[v * 2] < val ? v * 2 : v*2+1; return v - offset + 1; } } tree; struct Node { int begin, end, val; vector <int> children; Node (int a = 0, int b = 0, int c = 0) { begin = a, end = b, val = c; } } T[maxN * 4]; int n, m, Tsize = 1, P[maxN], it[maxN]; vector <pair <int, int> > changes[maxN]; bool cmp(const int& a, const int& b) { if (T[a].val == T[b].val) return a < b; return T[a].val < T[b].val; } void go(int v, int d) { if (tree.get_min(d, n + 1) >= T[v].end) return; int row = tree.fst_smaller(d, T[v].end); int prev_col = T[v].begin; int& j = it[row]; while (changes[row][j].first < T[v].end) { int col = changes[row][j].first; T[v].children.push_back(Tsize); T[Tsize++] = Node(prev_col, col, P[row]); go(Tsize-1, row+1); P[row] = changes[row][j].second; j++; prev_col = col; } T[v].children.push_back(Tsize); T[Tsize++] = Node(prev_col, T[v].end, P[row]); go(Tsize-1, row+1); tree.change(row, changes[row][j].first); sort(T[v].children.begin(), T[v].children.end(), cmp); } void print(int v) { for (int u : T[v].children) print(u); if (T[v].children.empty()) for (int i=T[v].begin; i<T[v].end; i++) printf("%d ", i); } int main() { scanf ("%d%d", &n, &m); for (int i=1; i<=n; i++) scanf ("%d", P + i); for (int i=2; i<=m; i++) { int p, x; scanf ("%d%d", &p, &x); changes[p].push_back(make_pair(i, x)); } for (int i=1; i<=n; i++) changes[i].push_back(make_pair(m+1, 0)); tree.init(n, changes); T[0] = Node(1, m + 1, 0); go(0, 1); print(0); printf("\n"); return 0; } |