题目描述
有n个数,m个操作,求m个操作结束后的所有数
有三种操作
1.从k开始往后,每个数+1
2.从k开始往后,第i位+i
3.从k开始往后,第i位+i^2
初始每个数都为0
思路
一开始想1跟2是可以边输出边处理,但是3没有想到怎么解决
所以还是30分
然后我们看这个平方
(
x
+
1
)
2
=
x
2
+
2
x
+
1
(x + 1)^2 = x^2 + 2x + 1
(x+1)2=x2+2x+1
意识就是加上2x+1就行了👍
代码
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#define ll long long
using namespace std;
const ll INF = 1e9 + 7;
ll n, m, aa, bb, bn, cm, T, x, y, cc, cn;
ll a[100250], b[100250], c[100250];
inline ll read()
{
ll x = 0, r = 1; char c = getchar();
while(c < '0' || c > '9'){if(c == '-')r = -1;c = getchar();}
while('0' <= c && c <= '9')x = x * 10 + c - 48, c = getchar();
return x * r;
}
void write(ll k)
{if(k > 9)write(k / 10); putchar(k % 10 + '0');}
int main()
{
T = read();
while(T--)
{
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
memset(c, 0, sizeof(c));
n = read(), m = read();
for(ll i = 1; i <= m; ++i)
{
x = read(), y = read();
if(x == 1)a[y]++;
if(x == 2)b[y]++;
if(x == 3)c[y]++;
}
aa = bb = bn = cc = cm = cn = 0;
for(ll i = 1; i <= n; ++i)
{
aa = (aa + a[i]) % INF;//1的操作
bb = (bb + bn) % INF;//2的操作
if(b[i])bn += b[i], bb += b[i];
cc = (cc + 2 * cm + cn) % INF;//3的操作
cm += cn;//同上
if(c[i])cc += c[i], cm += c[i], cn += c[i];
write((aa + bb + cc) % INF);putchar(' ');
}
putchar('\n');
}
return 0;
}