寒假集训 数据结构 M Daunting device（分块）

题目链接
正解

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i><=b;i--)
const int mm=1e5+10;

int n,m;
int a[mm],l[mm],r[mm],pos[mm],cnt,sz,lazy[mm],num[mm];


int ask(int x)
{
    int ans=0;
    rep(i,1,cnt)
    {
        if(lazy[i]){
            if(lazy[i]==x)ans+=r[i]-l[i]+1;}
        else
        {
            rep(j,l[i],r[i])
                if(a[j]==x)ans++;
        }
    }
    return ans;
}
void change(int pl,int pr,int x)
{
    rep(i,pos[pl],pos[pr])
    {
        if(l[i]>=pl&&r[i]<=pr)
        {
            lazy[i]=x;
        }
        else
        {
            if(lazy[i]){
                rep(j,l[i],r[i])a[j]=lazy[i];
                lazy[i]=0;
            }
            rep(j,max(pl,l[i]),min(r[i],pr))
            {
                a[j]=x;
            }
        }
    }
}
int main()
{
    int h;
    cin>>n>>h>>m;
    sz=sqrt(n);
    cnt=n/sz;
    if(n%sz)cnt++;


    rep(i,1,cnt)
    {
        l[i]=sz*(i-1)+1;
        r[i]=min(sz*i,n);
    }
    rep(i,1,n)pos[i]=((i-1)/sz)+1;
    rep(i,1,n)a[i]=1;
    while(m--)
    {
        ll p,x,a,b;
        cin>>p>>x>>a>>b;
        ll s=ask(p);
        ll m1=(a+s*s)%n;
        ll m2=(a+(s+b)*(s+b))%n;
        change(min(m1,m2)+1,max(m1,m2)+1,x);
    }
    rep(i,1,cnt)
    {
        if(lazy[i]){
            rep(j,l[i],r[i]) a[j] = lazy[i];
            lazy[i] = 0;
        }
    }
    rep(i,1,n)
        num[a[i]]++;
    int maxx=0;
    rep(i,1,h)
        maxx = max(maxx,num[i]);
    printf("%d\n",maxx);
    return 0;
}

思路一样，但一直wa在第三组的代码，没改出来，博客保存
以后再改

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mx = 1e5 + 5;

int n;
int l;
int c;
int ss[mx];
int ls[mx], rs[mx];
int belong[mx];
int lazy[mx];
int block, cnt;
inline int jishu(int cl)
{
    int res = 0;
    for (int i = 1; i <= cnt; i++)
    {
        if (lazy[i])
        {
            if (lazy[i] == cl)
                res += (rs[i] - ls[i] + 1);
        }

        else
        {
            for (int j = ls[i]; j <= rs[i]; j++)
                if (ss[j] == cl)
                    res++;
        }
    }
    return res;
}
void change(int ll, int rr, int cl)
{
    for (int i = belong[ll]; i <= belong[rr]; i++)
    {
        if (ls[i] >= ll && rs[i] <= rr)
            lazy[i] = cl; 
        else
        {
            if (lazy[i])
            {
                for (int j = ls[i]; j <= rs[i]; j++)
                    ss[j] = lazy[i];
                lazy[i] = 0;
            }
            for (int j = max(ls[i], ll); j <= min(rr, rs[i]); j++)
                ss[j] = cl;
        }
    }
}
int num_c[mx];
int main()
{
    //ios::sync_with_stdio(0);
    memset(num_c, 0, sizeof(num_c));
    cin >> l >> c >> n;//
    block = sqrt(l);//
    cnt = l / block;//
    if (l % block)//
        cnt++;//
    for (int i = 1; i <= cnt; i++)
       { ls[i] = (i - 1) * block + 1;rs[i] = min(i * block,l);}
    for (int i = 1; i <= l; i++)
        ss[i] = 1;
    for (int i = 1; i <= l; i++)
        belong[i] = ((i - 1) / block) + 1;
    long long p, x, a, b;
    int ll, rr;
    while (n--)
    {
        cin >> p >> x >> a >> b;
        int s = jishu(p);
        long long t1 = (a + s * s) % l ;
        long long t2 = (a + (s + b) * (s + b)) % l ;
        ll = min(t1, t2), rr = max(t1, t2);
        change(ll+1, rr+1, x);
    }
    int M = 0;
    for (int i = 1; i <= cnt; i++)
    {
        if (lazy[i])
        {
            for (int j = ls[i]; j <= rs[i]; j++)
            {
                ss[j] = lazy[i];
            }
            lazy[i] = 0;
        }
    }
    for (int i = 1; i <= l; i++)
        num_c[ss[i]]++;
    for (int i = 1; i <= c; i++)
        M = max(num_c[i], M);
    cout << M << endl;
    return 0;
}