xiayuyang

题目链接#include<bits/stdc++.h>using namespace std;const int maxn=4e5+5;inline int read(){ char c=getchar();int t=0,f=1; while(!isdigit(c)){if(c=='-')f=-1;c=getchar();} while(isdigit(c)){t=(t...

题意给一棵节点数为n的有根树和根的编号，树上的节点有点权。有m次操作，操作分为3种：询问一个点的点权，询问以一个点为根的子树的点权，将一条链上的点的点权加上一个权值。数据范围1≤n,m≤1e6,−1e6≤点权≤1e61\le n,m \le 1e6,-1e6\le 点权 \le 1e61≤n,m≤1e6,−1e6≤点权≤1e6解法: dfs序+树上差分+树状数组(题外话：树剖做这个应该非...

题意现在有TTT个询问,每个询问给你三个整数n,m,an,m,an,m,a,求对于所有1<=i<=n,1<=j<=m,1<=gcd(i,j)<=a1<=i<=n,1<=j<=m,1<=gcd(i,j)<=a1<=i<=n,1<=j<=m,1<=gcd(i,j)<=a的i,ji,ji,j的...