牛客寒训营2 F(写的乱七八糟过的，赛后发现是并查集)

题目
题意: 给定n个数，由n-1个+或连接。有m次查询，永久修改a[x] = y，求整个式子的值。
思路: 用并查集把所有先处理完，然后+上。若修改的数两边都是+，直接求差值；否则，修改它父亲的累乘值，求差值。
  我先求出了*对应的影响区间，然后用map映射了每个点的对应区间，这波太lao了。
时间复杂度: O(n * α(n) + m)
代码:

// Problem: 小沙的算数
// Contest: NowCoder
// URL: https://ac.nowcoder.com/acm/contest/23477/F
// Memory Limit: 524288 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<complex>
#include<cstring>
#include<cmath>
#include<vector>
#include<map>
#include<unordered_map>
#include<list>
#include<set>
#include<queue>
#include<stack>
#define OldTomato ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr)
#define fir(i,a,b) for(int i=a;i<=b;++i) 
#define mem(a,x) memset(a,x,sizeof(a))
#define p_ priority_queue
// round() 四舍五入 ceil() 向上取整 floor() 向下取整
// lower_bound(a.begin(),a.end(),tmp,greater<ll>()) 第一个小于等于的
// #define int long long //QAQ
using namespace std;
typedef complex<double> CP;
typedef pair<int,int> PII;
typedef long long ll;
// typedef __int128 it;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const ll inf = 1e18;
const int N = 2e5+10;
const int M = 1e6+10;
const int mod = 1e9+7;
const double eps = 1e-6;
inline int lowbit(int x){ return x&(-x);}
template<typename T>void write(T x)
{
    if(x<0)
    {
        putchar('-');
        x=-x;
    }
    if(x>9)
    {
        write(x/10);
    }
    putchar(x%10+'0');
}
template<typename T> void read(T &x)
{
    x = 0;char ch = getchar();ll f = 1;
    while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}
    while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;
}
int n,m,k,T;
int a[M];
int fa[M];
ll cnt[M];
string s;
ll qpow(ll a,ll k)
{
	ll res = 1;
	while(k)
	{
		if(k & 1)res = res * a % mod;
		a = a * a % mod;
		k >>= 1;
	}
	return res;
}
ll ni(ll x)
{
	return qpow(x,mod-2);
}
int find(int x)
{
	return x==fa[x]?x:fa[x] = find(fa[x]);
}
void Merge(int u,int v)
{
	u = find(u),v = find(v);
	if(u != v)
	{
		fa[v] = u;
		cnt[u] = cnt[u] * cnt[v] % mod;
	}
}
void solve()
{
   read(n); read(m);
   cin>>s;
   for(int i=1;i<=n;++i) 
   {
   	 read(a[i]); fa[i] = i; cnt[i] = a[i];
   }
   s = "+" + s + "+";
   ll ans = 0;
   for(int i=2;i<=n;++i)
   {
   	 if(s[i-1] == '*') Merge(i-1,i);
   }
   for(int i=1;i<=n;++i)
   {
   	 if(s[i-1] == '+') ans = (ans + cnt[i]) % mod;
   }
   // cout<<ans;
   while(m--)
   {
   	  int x,y; read(x),read(y);
   	  if(s[x-1] == '+' && s[x] == '+')
   	  {
   	  	 ans = (ans + y - a[x]) % mod;
   	  }
   	  else 
   	  {
   	  	 int wh = find(x);
   	  	 ll tmp = cnt[wh];
   	  	 cnt[wh] = cnt[wh] * y % mod * ni(a[x]) % mod;
   	  	 ans = (ans + cnt[wh] - tmp) % mod;
   	  }
   	  a[x] = y;
   	  ans = (ans + mod) % mod;
      write(ans); puts("");
   }
   
}
signed main(void)
{  
   T = 1;
   // OldTomato; cin>>T;
   // read(T);
   while(T--)
   {
   	 solve();
   }
   return 0;
}

// Problem: 小沙的算数
// Contest: NowCoder
// URL: https://ac.nowcoder.com/acm/contest/23477/F
// Memory Limit: 524288 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<complex>
#include<cstring>
#include<cmath>
#include<vector>
#include<map>
#include<unordered_map>
#include<list>
#include<set>
#include<queue>
#include<stack>
#define OldTomato ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr)
#define fir(i,a,b) for(int i=a;i<=b;++i) 
#define mem(a,x) memset(a,x,sizeof(a))
#define p_ priority_queue
// round() 四舍五入 ceil() 向上取整 floor() 向下取整
// lower_bound(a.begin(),a.end(),tmp,greater<ll>()) 第一个小于等于的
// #define int long long //QAQ
using namespace std;
typedef complex<double> CP;
typedef pair<int,int> PII;
typedef long long ll;
// typedef __int128 it;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const ll inf = 1e18;
const int N = 2e5+10;
const int M = 1e6+10;
const int mod = 1e9+7;
const double eps = 1e-6;
inline int lowbit(int x){ return x&(-x);}
template<typename T>void write(T x)
{
    if(x<0)
    {
        putchar('-');
        x=-x;
    }
    if(x>9)
    {
        write(x/10);
    }
    putchar(x%10+'0');
}
template<typename T> void read(T &x)
{
    x = 0;char ch = getchar();ll f = 1;
    while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}
    while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;
}
int n,m,k,T;
int a[M];
int fa[M];
ll cnt[M];
string s;
ll qpow(ll a,ll k)
{
	ll res = 1;
	while(k)
	{
		if(k & 1)res = res * a % mod;
		a = a * a % mod;
		k >>= 1;
	}
	return res;
}
ll ni(ll x)
{
	return qpow(x,mod-2);
}
int find(int x)
{
	return x==fa[x]?x:fa[x] = find(fa[x]);
}
void Merge(int u,int v)
{
	u = find(u),v = find(v);
	if(u != v)
	{
		fa[v] = u;
		cnt[u] = cnt[u] * cnt[v] % mod;
	}
}
void solve()
{
   read(n); read(m);
   cin>>s;
   for(int i=1;i<=n;++i) 
   {
   	 read(a[i]); fa[i] = i; cnt[i] = a[i];
   }
   s = "+" + s + "+";
   ll ans = 0;
   for(int i=2;i<=n;++i)
   {
   	 if(s[i-1] == '*') Merge(i-1,i);
   }
   for(int i=1;i<=n;++i)
   {
   	 if(s[i-1] == '+') ans = (ans + cnt[i]) % mod;
   }
   // cout<<ans;
   while(m--)
   {
   	  int x,y; read(x),read(y);
   	  if(s[x-1] == '+' && s[x] == '+')
   	  {
   	  	 ans = (ans + y - a[x]) % mod;
   	  }
   	  else 
   	  {
   	  	 int wh = find(x);
   	  	 ll tmp = cnt[wh];
   	  	 cnt[wh] = cnt[wh] * y % mod * ni(a[x]) % mod;
   	  	 ans = (ans + cnt[wh] - tmp) % mod;
   	  }
   	  a[x] = y;
   	  ans = (ans + mod) % mod;
      write(ans); puts("");
   }
   
}
signed main(void)
{  
   T = 1;
   // OldTomato; cin>>T;
   // read(T);
   while(T--)
   {
   	 solve();
   }
   return 0;
}