oj.uz

답안 #592759

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
592759 2022-07-09T14:43:03 Z andrei_boaca Nuclearia (CEOI15_nuclearia) C++14
65 / 100
 1000 ms 61620 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;
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;
}
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++)
        {
            /*if(suma>(1LL<<63)+put[0][i])
                assert(false);*/
            suma+=put[0][i];
            s[i]=suma;
        }
        ll si=0;
        suma=0;
        for(int i=1;i<=n;i++)
        {
            /*if(si>(1LL<<63)+put[1][i])
                assert(false);*/
            si+=put[1][i];
            /*if(suma>(1LL<<63)+si)
                assert(false);*/
            suma+=si;
            s[i]+=suma;
            //cout<<s[i]<<' ';
        }
        //cout<<'\n';
        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+2);
    for(int i=0;i<=n+1;i++)
        v[i].resize(m+2);
    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=0;
        while(nr>0&&cnt<=max(n,m))
        {
            add(x1,y1,x2,y2,b);
            nr-=b;
            cnt++;
            x1--;
            x2++;
            y1--;
            y2++;
            if(x1<=0&&y1<=0&&x2>n&&y2>m)
                break;
        }
        //cout<<v[1][1]<<' ';
        x1++;
        x2--;
        y1++;
        y2--;
        add(x1,y1,x2,y2,a);
        add(x1,y1,x2,y2,-cnt*b);
    }
    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++)
        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;
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 20348 KB Output is correct
2 Correct 59 ms 2744 KB Output is correct
3 Correct 51 ms 2348 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 20436 KB Output is correct
2 Correct 64 ms 2756 KB Output is correct

Subtask #3
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 20172 KB Output is correct
2 Correct 63 ms 2612 KB Output is correct

Subtask #4
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 21844 KB Output is correct
2 Correct 58 ms 2708 KB Output is correct

Subtask #5
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 114 ms 22188 KB Output is correct
2 Correct 59 ms 2868 KB Output is correct

Subtask #6
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 97 ms 11752 KB Output is correct
2 Correct 58 ms 2692 KB Output is correct

Subtask #7
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 136 ms 22324 KB Output is correct
2 Correct 58 ms 2940 KB Output is correct

Subtask #8
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 428 ms 37944 KB Output is correct
2 Correct 57 ms 2688 KB Output is correct

Subtask #9
15.0 / 15.0

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

Subtask #10
10.0 / 10.0

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

Subtask #11
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 557 ms 22208 KB Output is correct
2 Execution timed out 1096 ms 19924 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #12
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 984 ms 22216 KB Output is correct
2 Correct 651 ms 21936 KB Output is correct

Subtask #13
0 / 12.0

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

Subtask #14
0 / 8.0

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