noip模拟46

 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

#include <bits/stdc++.h>
#define For(i, l, r) for (long long i = (l), i##end = (r); i <= i##end; ++i)
#define Fordown(i, r, l) for (long long i = (r), i##end = (l); i >= i##end; --i)
#define Set(a, v) memset(a, v, sizeof(a))
using namespace std;
const long long maxn = 300010;

template<typename LDXIN>
LDXIN read() {
  LDXIN s = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    s = s * 10 + ch - '0';
    ch = getchar();
  }
  return s * f;
}

int n;
long long a[maxn];
long long now, nowInc;

int main() {
  n = read<int>();
  For(i, 1, n) {
    a[i] = read<long long>();
  }
  sort(a + 1, a + 1 + n);
  cout << 0 << endl;
  For(i, 0, n / 2 - 1) {
    nowInc += abs(a[n - i] - a[1 + i]);
    now += nowInc;
    printf("%lld\n", now);
    if (n - 3 - i * 2 >= 0) {
      now += nowInc;
      printf("%lld\n", now);
    }
  }
  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
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221

#include <bits/stdc++.h>
#define For(i, l, r) for (long long i = (l), i##end = (r); i <= i##end; ++i)
#define Fordown(i, r, l) for (long long i = (r), i##end = (l); i >= i##end; --i)
#define Set(a, v) memset(a, v, sizeof(a))
using namespace std;
const long long maxn = 500010;

template<typename LDXIN>
LDXIN read() {
  LDXIN s = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    s = s * 10 + ch - '0';
    ch = getchar();
  }
  return s * f;
}

struct EDGE {
  int to, nxt;
} edge[maxn * 2];
int tote, head[maxn];
void addEdge(int from, int to) {
  edge[++tote].to = to;
  edge[tote].nxt = head[from];
  head[from] = tote;
}

int d[maxn], dfn[maxn], tot, fa[maxn], sz[maxn];
int col[maxn], ublk[maxn];

void dfs(int id, int fa, int dep) {
  d[id] = dep;
  sz[id] = 1;
  dfn[id] = ++tot;
  for (int i = head[id]; i; i = edge[i].nxt) {
    int to = edge[i].to;
    if (to == fa) continue;
    dfs(to, id, dep + 1);
    sz[id] += sz[to];
  }
}

class segtreetmp {
#define lid id << 1
#define rid id << 1 | 1
  struct TREE {
    long long l, r;
    uint32_t sum, lazy, maxx;
  } tree[maxn * 4];

  void update(long long id) {
    tree[id].sum = tree[lid].sum + tree[rid].sum;
    tree[id].maxx = max(tree[lid].maxx, tree[rid].maxx);
  }

  void down(long long id) {
    tree[lid].sum +=
        1ll * tree[id].lazy * (tree[lid].r - tree[lid].l + 1);
    tree[rid].sum +=
        1ll * tree[id].lazy * (tree[rid].r - tree[rid].l + 1);
    tree[lid].lazy += tree[id].lazy;
    tree[rid].lazy += tree[id].lazy;
    tree[id].lazy = 0;
  }

 public:
  void build(long long id, long long l, long long r) {
    tree[id].l = l;
    tree[id].r = r;
    if (l == r) {
      return;
    }
    long long mid = (l + r) / 2;
    build(lid, l, mid);
    build(rid, mid + 1, r);
    update(id);
  }

  void addInterval(long long id, long long l, long long r, long long val) {
    if (tree[id].l >= l && tree[id].r <= r) {
      tree[id].lazy += val;
      tree[id].maxx += val;
      tree[id].sum += 1ll * val * (tree[id].r - tree[id].l + 1);
      return;
    }
    if (tree[id].lazy) down(id);
    long long mid = (tree[id].l + tree[id].r) / 2;
    if (l <= mid) addInterval(lid, l, r, val);
    if (r > mid) addInterval(rid, l, r, val);
    update(id);
  }

  uint32_t sumInterval(long long id, long long l, long long r) {
    uint32_t cnt = 0;
    if (tree[id].l >= l && tree[id].r <= r) return tree[id].sum;
    if (tree[id].lazy) down(id);
    long long mid = (tree[id].l + tree[id].r) / 2;
    if (l <= mid) cnt += sumInterval(lid, l, r);
    if (r > mid) cnt += sumInterval(rid, l, r);
    return cnt;
  }

  void addPoint(long long id, long long x, long long val) {
    if (tree[id].l == tree[id].r) {
      tree[id].sum += val;
      tree[id].maxx += val;
      return;
    }
    if (tree[id].lazy) down(id);
    long long mid = (tree[id].l + tree[id].r) / 2;
    if (x <= mid)
      addPoint(lid, x, val);
    else
      addPoint(rid, x, val);
    update(id);
  }
} tr;

int n, m;

vector<int> blk[maxn];

int main() {
  n = read<int>();
  m = read<int>();
  tr.build(1, 1, n);
  For(i, 2, n) {
    fa[i] = read<int>();
    addEdge(fa[i], i);
  }
  col[1] = col[0] = 1;
  dfs(1, 0, 1);
  For(i, 1, m) {
    int opt, k;
    opt = read<int>();
    k = read<int>();
    switch(opt) {
    case 1: {
      cout << tr.sumInterval(1, dfn[k], dfn[k]) << endl;
      break;
    }
    case 2: {
      int w;
      w = read<int>();
      tr.addInterval(1, dfn[k], dfn[k] + sz[k] - 1, w);
      if (blk[k].size()) {
        for (auto i : blk[k]) {
          tr.addInterval(1, dfn[i], dfn[i] + sz[i] - 1, -w);
        }
      }
      break;
    }
    case 3: {
      cout << tr.sumInterval(1, dfn[k], dfn[k] + sz[k] - 1) << endl;
      break;
    }
    case 4: {
      int w = read<int>();
      if (col[k] == 1) {
        tr.addInterval(1, dfn[k], dfn[k] + sz[k] - 1, w);
        break;
      }
      int now = k;
      while (col[now] == 0) now = fa[now];
      if (blk[now].size()) {
      for (auto i : blk[now]) {
        if (dfn[k] <= dfn[i] && dfn[i] <= dfn[k] + sz[k] - 1) {
          tr.addInterval(1, dfn[i], dfn[i] + sz[i] - 1, w);
        }
      }
      }
      break;
      
    }
    case 5: {
      int now = k;
      while (col[now] == 0) now = fa[now];
      ublk[k] = now;
      col[k] = 1;
      int ende = blk[now].size();
      for (int i = 0; i < ende; i++) {
        if (dfn[k] <= dfn[blk[now][i]] && dfn[blk[now][i]] <= dfn[k] + sz[k] - 1) {
          blk[k].push_back(blk[now][i]);
          ublk[blk[now][i]] = k;
          blk[now][i] = blk[now][ende - 1];
          i--;
          blk[now].pop_back();
          ende--;
        }
      }
      blk[now].push_back(k);
      break;
    }
    case 6: {
      int ende = blk[k].size();
      For(i, 0, ende - 1) {
        blk[ublk[k]].push_back(blk[k][i]);
        ublk[blk[k][i]] = ublk[k];
      }
      blk[k].clear();
      ende = blk[ublk[k]].size();
      for (int i = 0; i < ende; i++) {
        if (blk[ublk[k]][i] == k) {
          blk[ublk[k]][i] = blk[ublk[k]][ende - 1];
          blk[ublk[k]].pop_back();
        }
      }
      ublk[k] = 0;
      col[k] = 0;
      break;
    }
    }
  }
  return 0; 
}