Range Update Point Query（cf-1791-f）

Problem - F - Codeforces

Range Update Point Query - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)

有两个操作 1-> 将[l,r]的每个数都修改为原来的数的每一位的和，2->查询这个位置的数
用线段树维护

#include <iostream>
#include <bits/stdc++.h>
#include <algorithm>
#include <sstream>
#include <unordered_map>
#include <set>
#include <queue>
#include <deque>
#include <map>
#include <string>
#include <cstring>

#define x first
#define y second
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;

typedef pair<int,int> PII;
typedef pair<char,int> PCI;
typedef long long LL;
typedef unsigned long long ULL;

const int N=2e5 + 10, INF = 0x3f3f3f3f ;



int a[N];

struct tree{
    int l,r,x,mx;
}tr[N * 4];

void pushup(int u)
{
    tr[u].x = tr[u << 1 ].x + tr[u << 1|1].x ;
    tr[u].mx = max(tr[u << 1].mx,tr[u<<1|1].mx);    
}


void build(int u,int l,int r)
{
    tr[u]={l,r};
    if(l == r ) 
    {
        tr[u].mx = tr[u].x = a[r];
        return;
    }
    int mid = l+ r >> 1;
    build(u << 1 ,l,mid );
    build(u << 1|1,mid+1,r );
    
    
    pushup(u);
}

int change(int x)
{
    int res=0;
    while(x > 0) res +=x %10 ,x /=10;
    return res;
}

void modify(int u,int l,int r)
{
    if(tr[u].mx <= 9 ) return ;
    if(tr[u].l == tr[u].r ) 
    {
        tr[u].mx = tr[u].x = change(tr[u].x);
        return;
    }
    int mid = tr[u].l + tr[u].r >> 1;
    if(l <= mid ) modify(u << 1,l,r);
    if(r > mid ) modify(u << 1 |1,l, r);
    
    
    
    pushup(u);    
}


int query(int u,int l,int r)
{
    if(tr[u].l >= l && tr[u].r <= r )return tr[u].x;
    
    int mid = tr[u].l + tr[u].r >> 1;
    int ans =0;
    if(l <= mid ) ans += query(u << 1,l,r);
    if(r > mid )ans += query(u<<1|1,l,r);
    
    return ans;
    
}



void solve()
{
    int n,m;cin>>n>>m;
    for(int i=1;i <= n;i ++ ) cin >> a[i];
    int op,x,y;
    build(1,1,n);    
    for(int i=1;i<=m;i ++ )
    {
        cin>>op>>x;
        if(op == 1 )
        {
            cin>>y;
            modify(1,x,y);
        }
        else 
        {
            cout<<query(1,x,x)<<endl;
        }
        
    }
    
    
    
    
}


int main()
{
    ios 
    int T=1;
    cin>>T;
    while(T -- )
    {
        solve();
    }    
    
    
    
    
    return 0;
}