oj.uz

답안 #680048

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
680048 2023-01-09T20:36:54 Z bin9638 Nuclearia (CEOI15_nuclearia) C++14
44 / 100
 1000 ms 789328 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

#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],cs[N];

void solve()
{
    //duoi
    //cout<<"cc\n";
    for(int i=0;i<=n+1;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+1;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[cs[i][j].fs][cs[i][j].sc]+=(sum[i][j].fs+sum[i][j].sc*i);
        }

    //trai
    for(int i=0;i<=n+1;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+1;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;
        }
    }
    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++)
        {
            sum[i][j].fs+=sum[i+1][j].fs;
            sum[i][j].sc+=sum[i+1][j].sc;
            a[cs[i][j].fs][cs[i][j].sc]+=(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;
    for(int i=0;i<=n+1;i++)
    {
        a[i].resize(m+2,0);
        f[i].resize(m+2);
        sum[i].resize(m+2);
        cs[i].resize(m+2);
        for(int j=1;j<=m;j++)
            cs[i][j]={i,j};
    }
    for(int i=1;i<=q;i++)
    {
        cin>>tv[i].x>>tv[i].y>>tv[i].a>>tv[i].b;
        a[tv[i].x][tv[i].y]+=tv[i].a;
    }
    /*for(int t=1;t<=q;t++)
    {
        for(int i=1;i<=n;i++)
            for(int j=1;j<=m;j++)
                tmp[i][j]+=max(0ll,tv[t].a-tv[t].b*max(abs(tv[t].x-i),abs(tv[t].y-j)));
    }*/
    solve();
    for(int i=1;i<=q;i++)
    {
        tv[i].x=n-tv[i].x+1;
        tv[i].y=m-tv[i].y+1;
    }
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
           cs[i][j]={n-i+1,m-j+1};
    solve();
   /*  for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)cout<<tmp[i][j]<<" ";cout<<endl;
        }*/
  /*  for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            if(a[i][j]!=tmp[i][j])
            {
                cout<<"NGU";
                return 0;
            }*/
  //  return 0;
    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];
    cin>>q;
    while(q--)
    {
        int xs,ys,xe,ye;
        cin>>xs>>ys>>xe>>ye;
        int sum=a[xe][ye]+a[xs-1][ys-1]-a[xe][ys-1]-a[xs-1][ye];
        cout<<(ll)(round(1.0*sum/(1.0*(xe-xs+1)*(ye-ys+1))))<<"\n";
    }
    return 0;
}

Subtask #1
0 / 3.0

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

Subtask #2
0 / 2.0

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

Subtask #3
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 499 ms 373052 KB Output is correct
2 Correct 158 ms 237516 KB Output is correct

Subtask #4
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 682 ms 386112 KB Output is correct
2 Correct 178 ms 237592 KB Output is correct

Subtask #5
0 / 6.0

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

Subtask #6
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 881 ms 456640 KB Output is correct
2 Correct 161 ms 237516 KB Output is correct

Subtask #7
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 469 ms 375088 KB Output is correct
2 Correct 159 ms 237836 KB Output is correct

Subtask #8
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 644 ms 378360 KB Output is correct
2 Correct 153 ms 237488 KB Output is correct

Subtask #9
0 / 15.0

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

Subtask #10
0 / 10.0

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

Subtask #11
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 775 ms 381228 KB Output is correct
2 Correct 758 ms 381004 KB Output is correct

Subtask #12
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 734 ms 381240 KB Output is correct
2 Correct 593 ms 381124 KB Output is correct

Subtask #13
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 837 ms 384732 KB Output is correct
2 Incorrect 790 ms 382448 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #14
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 751 ms 381612 KB Output isn't correct
2 Halted 0 ms 0 KB -