oj.uz

답안 #594221

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
594221 2022-07-12T08:44:38 Z andrei_boaca Nuclearia (CEOI15_nuclearia) C++14
80 / 100
 1000 ms 269248 KB 
#include <bits/stdc++.h>
//#pragma GCC optimize("O3")
#define int long long
using namespace std;
typedef long long ll;
typedef long double ld;
vector<vector<ll>> v,S1,S2,toadd;
int n,m,k,q;
int nradds=0;
void add(int x1,int y1,int x2,int y2,ll val)
{
    x1=max(x1,1LL);
    y1=max(y1,1LL);
    x2=min(x2,n);
    y2=min(y2,m);
    v[x1][y1]+=val;
    v[x2+1][y1]-=val;
    v[x1][y2+1]-=val;
    v[x2+1][y2+1]+=val;
}
void putadd(int x1,int y1,int x2,int y2,ll val)
{
    toadd[x1][y1]+=val;
    toadd[x2+1][y1]-=val;
    toadd[x1][y2+1]-=val;
    toadd[x2+1][y2+1]+=val;
}
ll getsum(int x1,int y1,int x2,int y2)
{
    return v[x2][y2]-v[x1-1][y2]-v[x2][y1-1]+v[x1-1][y1-1];
}
ll put[2][2500005];
ll s[2500005];
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>m>>k;
    if(m==1)
    {
        for(int z=1;z<=k;z++)
        {
            ll x,y,a,b;
            cin>>x>>y>>a>>b;
            //assert(y==1);
            ll nr=a/b;
            put[0][x]+=a;
            put[0][x+1]-=a;
            ll st=x-nr;
            ll dr=x-1;
            if(dr>0)
            {
                st=max(st,1LL);
                ll lg=dr-st+2;
                put[0][st]+=a-lg*b;
                put[0][dr+1]-=a-lg*b;
                put[0][dr+1]-=(lg-1)*b;
                put[1][st]+=b;
                put[1][dr+1]-=b;
            }
            st=x+1;
            dr=x+nr;
            if(st<=n)
            {
                dr=min(dr,n*1LL);
                ll lg=dr-st+2;
                put[0][st]+=a;
                put[0][dr+1]-=a;
                put[0][dr+1]-=(lg-1)*(-b);
                put[1][st]-=b;
                put[1][dr+1]+=b;
            }
        }
        ll suma=0;
        for(int i=1;i<=n;i++)
        {
            suma+=put[0][i];
            s[i]=suma;
        }
        ll si=0;
        suma=0;
        for(int i=1;i<=n;i++)
        {
            si+=put[1][i];
            suma+=si;
            s[i]+=suma;
        }
        for(int i=1;i<=n;i++)
            s[i]+=s[i-1];
        cin>>q;
        while(q--)
        {
            int x1,y1,x2,y2;
            cin>>x1>>y1>>x2>>y2;
            //assert(y1==1&&y2==1);
            ll val=s[x2]-s[x1-1];
            ll rez=round(ld(val)/ld(x2-x1+1));
            cout<<rez<<'\n';
        }
        return 0;
    }
    v.resize(n+10);
    S1.resize(n+10);
    S2.resize(n+10);
    toadd.resize(n+10);
    for(int i=0;i<=n+9;i++)
    {
        v[i].resize(m+10);
        S1[i].resize(m+10);
        S2[i].resize(m+10);
        toadd[i].resize(m+10);
    }
    for(int z=1;z<=k;z++)
    {
        int x,y,a,b;
        cin>>x>>y>>a>>b;
        int nr=a;
        int x1=x,y1=y,x2=x,y2=y;
        int cnt=a/b;
        if(a%b==0)
            cnt--;
        if(cnt==0)
        {
            add(x,y,x,y,a);
            continue;
        }
        x1=x-cnt;
        x2=x+cnt;
        y1=y-cnt;
        y2=y+cnt;

        add(x1,y1,x2,y2,a);
        add(x1,y1,x2,y2,-(cnt+1)*b);
        /*while(x1<=x)
        {
            add(x1,y1,x2,y2,b);
            x1++;
            y1++;
            x2--;
            y2--;
        }*/



        int i=x1,j=y1;
        /*while(i<=x)
        {
            int p=max(i,1LL);
            int q=max(j,1LL);
            v[p][q]+=b;
            i++;
            j++;
        }*/
        ll nr11=max(0LL,min(1-x1,1-y1));
        v[1][1]+=nr11*b;
        i+=nr11;
        j+=nr11;

        if(i<1)
        {
            ll cnt=1-i;
            ll st=j;
            ll dr=j+cnt-1;
            putadd(1,st,1,dr,b);
            i+=cnt;
            j+=cnt;
        }
        if(j<1)
        {
            ll cnt=1-j;
            ll st=i;
            ll dr=i+cnt-1;
            putadd(st,1,dr,1,b);
            i+=cnt;
            j+=cnt;
        }

        S1[i][j]+=b;
        S1[x+1][y+1]-=b;

        i=x+1;
        j=y+1;
        /*while(i<=x2+1&&i<=n&&j<=m&&j<=y2+1)
        {
            v[i][j]+=b;
            i++;
            j++;
        }*/
        S1[i][j]+=b;
        if(!(x2+2>n||y2+2>m))
            S1[x2+2][y2+2]-=b;




        i=x1;
        j=y2+1;
        ll num=max(0LL,j-m);

        i+=num;
        j-=num;

        if(i<1)
        {
            ll cnt=1-i;
            ll st=j-cnt+1;
            ll dr=j;
            putadd(1,st,1,dr,-b);
            i+=cnt;
            j-=cnt;
        }
        num=x-i;
        S2[i][j]-=b;
        S2[i+num+1][j-(num+1)]+=b;

        /*while(i<=x)
        {
            int p=max(i,1LL);
            int q=j;
            if(q<=m)
                v[p][q]-=b;
            i++;
            j--;
        }*/
        i=i+num+1;
        j=j-(num+1);
        while(i<=x2+1&&i<=n)
        {
            int p=i;
            int q=max(j,1LL);
            v[p][q]-=b;
            i++;
            j--;
        }
        //S2[i][j]-=b;
        /*if(x2+2>n||y1-1<1)
            continue;
        S2[x2+2][y1-1]+=b;*/
    }
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            toadd[i][j]+=toadd[i-1][j]+toadd[i][j-1]-toadd[i-1][j-1];
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            v[i][j]+=toadd[i][j];
    for(int i=1;i<=n;i++)
    {
        ll x=i,y=1;
        ll suma=0;
        while(x<=n&&y<=m)
        {
            suma+=S1[x][y];
            v[x][y]+=suma;
            x++;
            y++;
        }
    }
    for(int j=2;j<=m;j++)
    {
        ll x=1,y=j;
        ll suma=0;
        while(x<=n&&y<=m)
        {
            suma+=S1[x][y];
            v[x][y]+=suma;
            x++;
            y++;
        }
    }
    for(int i=1;i<=n;i++)
    {
        ll x=i,y=m;
        ll suma=0;
        while(x<=n&&y>0)
        {
            suma+=S2[x][y];
            v[x][y]+=suma;
            x++;
            y--;
        }
    }
    for(int j=1;j<m;j++)
    {
        ll x=1,y=j;
        ll suma=0;
        while(x<=n&&y>0)
        {
            suma+=S2[x][y];
            v[x][y]+=suma;
            x++;
            y--;
        }
    }
    /*for(int i=1;i<=n;i++,cout<<'\n')
        for(int j=1;j<=m;j++)
            cout<<v[i][j]<<' ';*/
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            v[i][j]+=v[i-1][j]+v[i][j-1]-v[i-1][j-1];
    /*for(int i=1;i<=n;i++,cout<<'\n')
        for(int j=1;j<=m;j++)
            cout<<v[i][j]<<' ';*/
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
        {
            v[i][j]=v[i][j]+v[i-1][j]+v[i][j-1]-v[i-1][j-1];
            //cout<<s[i][j]<<' ';
        }
    //assert(nradds<=k*max(n,m));
    cin>>q;
    while(q--)
    {
        int x1,y1,x2,y2;
        cin>>x1>>y1>>x2>>y2;
        ll suma=getsum(x1,y1,x2,y2);
        ll cells=(y2-y1+1)*(x2-x1+1);
        ll rez=round(ld(suma)/ld(cells));
        cout<<rez<<'\n';
    }
    return 0;
}

Compilation message

nuclearia.cpp: In function 'int main()':
nuclearia.cpp:117:13: warning: unused variable 'nr' [-Wunused-variable]
  117 |         int nr=a;
      |             ^~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 20296 KB Output is correct
2 Correct 62 ms 2892 KB Output is correct
3 Correct 54 ms 2404 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 20464 KB Output is correct
2 Correct 60 ms 2776 KB Output is correct

Subtask #3
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 124 ms 81116 KB Output is correct
2 Correct 73 ms 3212 KB Output is correct

Subtask #4
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 106 ms 118080 KB Output is correct
2 Correct 64 ms 3252 KB Output is correct

Subtask #5
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 123 ms 22384 KB Output is correct
2 Correct 71 ms 3068 KB Output is correct

Subtask #6
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 91 ms 11900 KB Output is correct
2 Correct 75 ms 2868 KB Output is correct

Subtask #7
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 197 ms 83136 KB Output is correct
2 Correct 63 ms 3512 KB Output is correct

Subtask #8
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 590 ms 269248 KB Output is correct
2 Correct 63 ms 3148 KB Output is correct

Subtask #9
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 199 ms 61460 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 215 ms 61540 KB Output is correct

Subtask #11
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 489 ms 83140 KB Output is correct
2 Correct 612 ms 82488 KB Output is correct

Subtask #12
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 608 ms 82296 KB Output is correct
2 Correct 457 ms 82724 KB Output is correct

Subtask #13
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 463 ms 89888 KB Output is correct
2 Execution timed out 1043 ms 84136 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #14
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1071 ms 81248 KB Time limit exceeded
2 Halted 0 ms 0 KB -