```cpp
void add(int x){
res-=b[a[x]]*b[a[x]];
b[a[x]]++;
res+=b[a[x]]*b[a[x]];
}
void del(int x){
res-=b[a[x]]*b[a[x]];
b[a[x]]--;
res+=b[a[x]]*b[a[x]];
}
```
```
#define int long long
```
这两个都TLE一点
by LiaoYF @ 2024-03-16 12:57:58
@[LiaoYF](/user/633466) 建议存一下每个元素所在块，除法比较慢
by diqiuyi @ 2024-03-16 13:08:55
你排序 id 改成 l
by critnos @ 2024-03-16 13:42:24
@[critnos](/user/203623) 看到了，谢谢
by LiaoYF @ 2024-03-16 14:46:49