Submission #863298

# Submission time Handle Problem Language Result Execution time Memory
863298 2023-10-20T01:51:28 Z ibm2006 Meteors (POI11_met) C++17
74 / 100
5956 ms 65536 KB
#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx")
using namespace std;
typedef long long int ll;
typedef __int128 lll;
ll x,z,w,l,r,m,lazy[1100000];
int le[330000],ri[330000],q,i,j,k,n,s,e,a[330000];
ll te1,te2,te3;
lll seg[1100000],y;
vector<int> v[330000],u[330000];
pair<pair<int,int>,ll> upd[330000];
void h(ll x,ll y,ll z)
{
    if(lazy[z]==0)
        return;
    if(z>=524288)
    {
        seg[z]+=lazy[z];
        lazy[z]=0;
        return;
    }
    seg[z]+=(y-x+1)*lazy[z];
    lazy[z<<1]+=lazy[z];
    lazy[(z<<1)+1]+=lazy[z];
    lazy[z]=0;
    return;
}
void Clear()
{
    ll i;
    for(i=0;i<1100000;i++)
    {
        seg[i]=0;
        lazy[i]=0;
    }
}
void f(ll x,ll y,ll z,ll w)
{
    h(x,y,z);
    if(l>y||x>r)
        return;
    if(l<=x&&y<=r)
    {
        lazy[z]+=w;
        h(x,y,z);
        return;
    }
    f(x,(x+y)>>1,z<<1,w);
    f(((x+y)>>1)+1,y,(z<<1)+1,w);
    seg[z]=seg[z<<1]+seg[(z<<1)+1];
}
lll g(ll x,ll y,ll z)
{
    h(x,y,z);
    if(l>y||x>r)
        return 0;
    if(l<=x&&y<=r)
    {
        return seg[z];
    }
    return g(x,(x+y)>>1,z<<1)+g(((x+y)>>1)+1,y,(z<<1)+1);
}
int main()
{
    scanf("%lld %lld",&te1,&te2);
    n=te1;
    m=te2;
    for(i=1;i<=m;i++)
    {
        scanf("%lld",&te1);
        x=te1;
        //x=1;
        v[x].push_back(i);
    }
    for(i=1;i<=n;i++)
    {
        scanf("%lld",&te1);
        a[i]=te1;
    //a[i]=1e9;
    }
    scanf("%lld",&te1);
    q=te1;
    for(i=1;i<=q;i++)
    {
        scanf("%lld %lld %lld",&te1,&te2,&te3);
        x=te1;
        w=te2;
        z=te3;
        //x=1;  w=m;  z=1;
        upd[i]={{x,w},z};
    }
    for(i=1;i<=n;i++)
    {
        le[i]=1;
        ri[i]=q+1;
    }
    for(e=0;e<19;e++)
    {
        //printf("!");
        //for(i=1;i<=n;i++)
          //  printf("(%lld,%lld)\n",le[i],ri[i]);
        Clear();
        s=1;
        for(i=1;i<=q+1;i++)
        {
            u[i].clear();
        }
        for(i=1;i<=n;i++)
            u[(le[i]+ri[i])>>1].push_back(i);
        for(i=1;i<=q+1;i++)
        {
            //printf("%lld\n",i);
            if(i<=q)
            {x=upd[i].first.first;
            y=upd[i].first.second;
            z=upd[i].second;
            if(x<=y)
            {
                l=x;
                r=y;
                f(1,524288,1,z);
            }
            else
            {
                l=x;
                r=m;
                f(1,524288,1,z);
                l=1;
                r=y;
                f(1,524288,1,z);
            }
            }
            //printf("?");
            for(j=0;j<u[i].size();j++)
            {
                x=u[i][j];
                y=0;
                for(k=0;k<v[x].size();k++)
                {
                l=v[x][k];
                r=v[x][k];
                y+=g(1,524288,1);}
                if(a[x]<=y)
                {
                    ri[x]=i;
                }
                else
                    le[x]=i+1;
                    le[x]=min(le[x],q+1);
       // printf("[%lld,%lld]\n",(le[x]+ri[x])/2,x);
                //p[s]={(le[x]+ri[x])/2,x};
                s++;

            }
        }
        //swap(p,pp);
    }
    for(i=1;i<=n;i++)
    {
        a[i]=le[i];
    }
    for(i=1;i<=n;i++)
    {
        te1=a[i];
        if(a[i]>=q+1)
        {
            printf("NIE\n");
        }
        else
            printf("%lld\n",te1);
    }
}

Compilation message

met.cpp: In function 'int main()':
met.cpp:135:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  135 |             for(j=0;j<u[i].size();j++)
      |                     ~^~~~~~~~~~~~
met.cpp:139:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  139 |                 for(k=0;k<v[x].size();k++)
      |                         ~^~~~~~~~~~~~
met.cpp:148:17: warning: this 'else' clause does not guard... [-Wmisleading-indentation]
  148 |                 else
      |                 ^~~~
met.cpp:150:21: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'else'
  150 |                     le[x]=min(le[x],q+1);
      |                     ^~
met.cpp:66:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |     scanf("%lld %lld",&te1,&te2);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~
met.cpp:71:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   71 |         scanf("%lld",&te1);
      |         ~~~~~^~~~~~~~~~~~~
met.cpp:78:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   78 |         scanf("%lld",&te1);
      |         ~~~~~^~~~~~~~~~~~~
met.cpp:82:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   82 |     scanf("%lld",&te1);
      |     ~~~~~^~~~~~~~~~~~~
met.cpp:86:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   86 |         scanf("%lld %lld %lld",&te1,&te2,&te3);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 47 ms 46428 KB Output is correct
2 Correct 47 ms 46424 KB Output is correct
3 Correct 51 ms 46424 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 47 ms 46428 KB Output is correct
2 Correct 47 ms 46424 KB Output is correct
3 Correct 48 ms 46592 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 630 ms 49488 KB Output is correct
2 Correct 822 ms 51280 KB Output is correct
3 Correct 758 ms 50948 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 803 ms 50516 KB Output is correct
2 Correct 761 ms 50512 KB Output is correct
3 Correct 832 ms 51348 KB Output is correct
4 Correct 243 ms 48208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 357 ms 49732 KB Output is correct
2 Correct 540 ms 52056 KB Output is correct
3 Correct 413 ms 48752 KB Output is correct
4 Correct 724 ms 51316 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 805 ms 49072 KB Output is correct
2 Correct 749 ms 50272 KB Output is correct
3 Correct 669 ms 49204 KB Output is correct
4 Correct 844 ms 52344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5782 ms 63220 KB Output is correct
2 Correct 2720 ms 52140 KB Output is correct
3 Correct 1849 ms 50840 KB Output is correct
4 Runtime error 2795 ms 65536 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 5956 ms 62028 KB Output is correct
2 Correct 1778 ms 52148 KB Output is correct
3 Correct 1501 ms 50816 KB Output is correct
4 Runtime error 2279 ms 65536 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -