oj.uz

Submission #680065

# Submission time Handle Problem Language Result Execution time Memory
680065 2023-01-09T20:54:51 Z bin9638 Nuclearia (CEOI15_nuclearia) C++17
92 / 100
 1000 ms 574296 KB 
#include<bits/stdc++.h>
 //
using namespace std;
#define N  2500010
#define ll long long
#define ii pair<int,int>
#define fs first
#define sc second
#define pb push_back
#define iii pair<int,ii>
#define int ll
#define ld long double
 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("omit-frame-pointer")
#pragma GCC optimize("unroll-loops")
 
struct haha
{
    int x,y,a,b;
}tv[200010];
 
int n,m,q,tmp[1010][1010];
vector<int>a[N];
vector<ii>f[N],sum[N];
 
void solve(int check)
{
    //duoi
    //cout<<"cc\n";
    for(int i=0;i<=n;i++)
        for(int j=0;j<=m+1;j++)
            f[i][j]=sum[i][j]={0,0};
    for(int i=1;i<=q;i++)
    {
        f[tv[i].x][tv[i].y].fs+=tv[i].a-tv[i].b*tv[i].x;
        f[tv[i].x][tv[i].y].sc+=tv[i].b;
        int L=(tv[i].a+tv[i].b-1)/tv[i].b;
        if(tv[i].x-L>=1)
        {
            f[tv[i].x-L][max(1ll,tv[i].y-L)].fs-=(tv[i].a-tv[i].b*tv[i].x);
            f[tv[i].x-L][max(1ll,tv[i].y-L)].sc-=tv[i].b;
        }
    }
    for(int i=n;i>=1;i--)
        for(int j=m;j>=1;j--)
        {
            sum[i][j].fs+=f[i][j].fs;
            sum[i][j].sc+=f[i][j].sc;
            if(i>1)
            {
                f[i-1][max(1ll,j-1)].fs+=f[i][j].fs;
                f[i-1][max(1ll,j-1)].sc+=f[i][j].sc;
            }
        }
     for(int i=0;i<=n;i++)
        for(int j=0;j<=m+1;j++)
            f[i][j]={0,0};
     for(int i=1;i<=q;i++)
    {
        f[tv[i].x][tv[i].y].fs-=(tv[i].a-tv[i].b*tv[i].x);
        f[tv[i].x][tv[i].y].sc-=(tv[i].b);
        int L=(tv[i].a+tv[i].b-1)/tv[i].b;
        if(tv[i].x-L>=1)
        {
          //  cout<<i<<" "<<L<<endl;
            f[tv[i].x-L][min(m+1,tv[i].y+L)].fs+=(tv[i].a-tv[i].b*tv[i].x);
            f[tv[i].x-L][min(m+1,tv[i].y+L)].sc+=tv[i].b;
        }
    }
    for(int i=n;i>=1;i--)
        for(int j=m;j>=1;j--)
        {
            sum[i][j].fs+=f[i][j].fs;
            sum[i][j].sc+=f[i][j].sc;
            if(i>1)
            {
                f[i-1][min(m+1,j+1)].fs+=f[i][j].fs;
                f[i-1][min(m+1,j+1)].sc+=f[i][j].sc;
            }
        }
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
        {
            sum[i][j].fs+=sum[i][j-1].fs;
            sum[i][j].sc+=sum[i][j-1].sc;
             a[(check==0 ? i : n-i+1)][(check==0 ? j : m-j+1)]+=(sum[i][j].fs+sum[i][j].sc*i);
        }
 
    //trai
    for(int i=0;i<=n;i++)
        for(int j=0;j<=m+1;j++)
            f[i][j]=sum[i][j]={0,0};
    for(int i=1;i<=q;i++)
    {
        f[tv[i].x][tv[i].y].fs-=(tv[i].a-tv[i].b*tv[i].y);
        f[tv[i].x][tv[i].y].sc-=(tv[i].b);
        int L=(tv[i].a+tv[i].b-1)/tv[i].b;
      //  cout<<tv[i].y<<" "<<L<<endl;
        if(tv[i].y-L>=1)
        {
         //   cout<<i<<endl;
            f[max(0ll,tv[i].x-L)][tv[i].y-L].fs+=(tv[i].a-tv[i].b*tv[i].y);
            f[max(0ll,tv[i].x-L)][tv[i].y-L].sc+=tv[i].b;
        }
    }
    for(int j=m;j>=1;j--)
        for(int i=n;i>=1;i--)
        {
            sum[i][j].fs+=f[i][j].fs;
            sum[i][j].sc+=f[i][j].sc;
            if(j>1)
            {
                f[max(0ll,i-1)][j-1].fs+=f[i][j].fs;
                f[max(0ll,i-1)][j-1].sc+=f[i][j].sc;
            }
        }
    for(int i=0;i<=n;i++)
        for(int j=0;j<=m+1;j++)
            f[i][j]={0,0};
    for(int i=1;i<=q;i++)
    {
        f[tv[i].x][tv[i].y].fs+=(tv[i].a-tv[i].b*tv[i].y);
        f[tv[i].x][tv[i].y].sc+=tv[i].b;
        int L=(tv[i].a+tv[i].b-1)/tv[i].b;
        if(tv[i].y-L>=1)
        {
            f[min(n,tv[i].x+L)][tv[i].y-L].fs-=(tv[i].a-tv[i].b*tv[i].y);
            f[min(n,tv[i].x+L)][tv[i].y-L].sc-=tv[i].b;
        }
    }
   // return;
    for(int j=m;j>=1;j--)
        for(int i=n;i>=1;i--)
        {
            sum[i][j].fs+=f[i][j].fs;
            sum[i][j].sc+=f[i][j].sc;
            if(j>1)
            {
                f[min(n,i+1)][j-1].fs+=f[i][j].fs;
                f[min(n,i+1)][j-1].sc+=f[i][j].sc;
            }
        }
    for(int i=n;i>=1;i--)
        for(int j=1;j<=m;j++)
        {
            if(i<n)
            {
                sum[i][j].fs+=sum[i+1][j].fs;
                sum[i][j].sc+=sum[i+1][j].sc;
            }
            a[(check==0 ? i : n-i+1)][(check==0 ? j : m-j+1)]+=(sum[i][j].fs+sum[i][j].sc*j);
        }
}
 
int32_t main()
{
    //freopen("A.inp","r",stdin);
   // freopen("A.out","w",stdout);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    cin>>n>>m>>q;
    swap(n,m);
    for(int i=0;i<=n;i++)
    {
        a[i].resize(m+2,0);
        f[i].resize(m+2);
        sum[i].resize(m+2);
    }
    for(int i=1;i<=q;i++)
    {
        cin>>tv[i].x>>tv[i].y>>tv[i].a>>tv[i].b;
        swap(tv[i].x,tv[i].y);
        a[tv[i].x][tv[i].y]+=tv[i].a;
    }
    solve(0);
    for(int i=1;i<=q;i++)
    {
        tv[i].x=n-tv[i].x+1;
        tv[i].y=m-tv[i].y+1;
    }
    solve(1);
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            a[i][j]+=a[i-1][j];
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            a[i][j]+=a[i][j-1];
   // return 0;
    cin>>q;
    while(q--)
    {
        int xs,ys,xe,ye;
        cin>>xs>>ys>>xe>>ye;
        swap(xs,ys);
        swap(xe,ye);
        int sum=a[xe][ye]+a[xs-1][ys-1]-a[xe][ys-1]-a[xs-1][ye];
        cout<<(ll)(round((ld)1.0*sum/((ld)1.0*(xe-xs+1))/((ld)1.0*(ye-ys+1))))<<"\n";
    }
    return 0;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 398 ms 372156 KB Output is correct
2 Correct 155 ms 178892 KB Output is correct
3 Correct 195 ms 178436 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 417 ms 372144 KB Output is correct
2 Correct 179 ms 178824 KB Output is correct

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 387 ms 274548 KB Output is correct
2 Correct 189 ms 178812 KB Output is correct

Subtask #4
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 759 ms 290056 KB Output is correct
2 Correct 165 ms 178824 KB Output is correct

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 642 ms 374660 KB Output is correct
2 Correct 189 ms 179396 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 325 ms 257348 KB Output is correct
2 Correct 179 ms 179124 KB Output is correct

Subtask #7
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 580 ms 277512 KB Output is correct
2 Correct 157 ms 179332 KB Output is correct

Subtask #8
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 290 ms 237740 KB Output is correct
2 Correct 183 ms 179020 KB Output is correct

Subtask #9
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 629 ms 381280 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 619 ms 381296 KB Output is correct

Subtask #11
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 583 ms 283104 KB Output is correct
2 Correct 804 ms 283196 KB Output is correct

Subtask #12
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 701 ms 283196 KB Output is correct
2 Correct 831 ms 283432 KB Output is correct

Subtask #13
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 863 ms 285456 KB Output is correct
2 Correct 842 ms 285388 KB Output is correct

Subtask #14
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 597 ms 283432 KB Output is correct
2 Execution timed out 1105 ms 574296 KB Time limit exceeded
3 Halted 0 ms 0 KB -