oj.uz

답안 #620912

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
620912 2022-08-03T10:20:42 Z amin 말 (IOI15_horses) C++14
0 / 100
 79 ms 56748 KB 
#include "horses.h"
#include<bits/stdc++.h>
using namespace std;

long long x[500001];
long long seg[1000002],segg[1000002],mu[1000002];
long long y[500001];
long long h=(1e9+1);
long long mod=1e9+7;
void build(long v,long tl,long tr)
{
    if(tl==tr)
    {
        seg[v]=x[tl];
        mu[v]=seg[v];
        return ;
    }
    long tm=(tl+tr)/2;
    build(v*2,tl,tm);
    build(v*2+1,tm+1,tr);
    seg[v]=seg[v*2]*seg[v*2+1];
    mu[v]=(mu[v*2]*mu[v*2+1])%mod;

    if(seg[v]>h)
    {
        seg[v]=h;
    }
}
void update(long v,long tl,long tr,long in)
{
    if(tl==tr&&tl==in)
    {
        seg[v]=x[in];
        mu[v]=seg[v];
        return ;
    }
    long tm=(tl+tr)/2;
    if(tm>=in)
    {
        update(v*2,tl,tm,in);
    }else
    {
        update(v*2+1,tm+1,tr,in);
    }
    seg[v]=seg[v*2]*seg[v*2+1];
    mu[v]=(mu[v*2]*mu[v*2+1])%mod;
    if(seg[v]>h)
    {
        seg[v]=h;
    }
}
long long get(long v,long tl,long tr,long l,long r)
{
    if(l==tl&&r==tr)
    {
        return seg[v];
    }
    long tm=(tl+tr)/2;
    if(r<=tm)
    {
        return get(v*2,tl,tm,l,r);
    }
    if(l>tm)
    {
        return get(v*2+1,tm+1,tr,l,r);
    }
    long long j=get(v*2,tl,tm,l,tm)*get(v*2+1,tm+1,tr,tm+1,r);
    if(j>h)
    {
        j=h;
    }
    return j;
}
long n;

void build2(long v,long tl,long tr)
{
    if(tl==tr)
    {
        segg[v]=tl;
        return ;
    }
    long tm=(tl+tr)/2;
    build2(v*2,tl,tm);
    build2(v*2+1,tm+1,tr);
    long long a=segg[v*2];
    long long b=segg[v*2+1];
   // cout<<a<<' '<<b<<' ';
   // cout<<y[a]<<' '<<y[b]*get(1,0,n-1,a+1,b)<<endl;
    if(y[a]>(y[b]*get(1,0,n-1,a+1,b)))
    {
      segg[v]=a;

    }else
    {
        segg[v]=b;
    }
}
void update2(long v,long tl,long tr,long in)
{
    if(tl==tr)
    {
        segg[v]=tl;
        return ;
    }
    long tm=(tl+tr)/2;
    if(tm>=in)
    {
        update2(v*2,tl,tm,in);
    }else
    {
        update2(v*2+1,tm+1,tr,in);
    }
      long long a=segg[v*2];
    long long b=segg[v*2+1];
   // cout<<a<<' '<<b<<' ';
   // cout<<y[a]<<' '<<y[b]*get(1,0,n-1,a+1,b)<<endl;
    if(y[a]>(y[b]*get(1,0,n-1,a+1,b)))
    {
      segg[v]=a;

    }else
    {
        segg[v]=b;
    }

}
long long get2(long v,long tl,long tr,long l,long r)
{

    if(l==tl&&r==tr)
    {
        return mu[v];
    }
    long tm=(tl+tr)/2;
    if(r<=tm)
    {
        return get2(v*2,tl,tm,l,r);
    }
    if(l>tm)
    {
        return get2(v*2+1,tm+1,tr,l,r);
    }
    long long j=(get2(v*2,tl,tm,l,tm)*get2(v*2+1,tm+1,tr,tm+1,r))%mod;

    return j;
}
int init(int N, int X[], int Y[]) {
  //  cout<<mod<<endl;
    n=N;
    for(long i=0;i<n;i++)
    {
        x[i]=X[i];
        y[i]=Y[i];
    }
    build(1,0,n-1);
    long jj=0;
   long in=max(n-40,jj);
   long long ans=y[in];
   long long o=1;
   long long t=in;
   for(long i=in+1;i<n;i++)
   {
       o*=x[i];
       if(o*y[i]<y[t])
       {
           continue;
       }else
       {
           t=i;
           o=1;
       }
   }
   cout<<get(1,0,n-1,0,t)*y[t]<<endl;



}

int updateX(int pos, int val) {
x[pos]=val;
 update(1,0,n-1,pos);
  long jj=0;
   long in=max(n-40,jj);
   long long ans=y[in];
   long long o=1;
   long long t=in;
   for(long i=in+1;i<n;i++)
   {
       o*=x[i];
       if(o*y[i]<y[t])
       {
           continue;
       }else
       {
           t=i;
           o=1;
       }
   }
   cout<<get(1,0,n-1,0,t)*y[t]<<endl;

}

int updateY(int pos, int val) {
    y[pos]=val;
    update(1,0,n-1,pos);
     long jj=0;
   long in=max(n-40,jj);
   long long ans=y[in];
   long long o=1;
   long long t=in;
   for(long i=in+1;i<n;i++)
   {
       o*=x[i];
       if(o*y[i]<y[t])
       {
           continue;
       }else
       {
           t=i;
           o=1;
       }
   }
   cout<<get(1,0,n-1,0,t)*y[t]<<endl;
}

Compilation message

horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:159:14: warning: unused variable 'ans' [-Wunused-variable]
  159 |    long long ans=y[in];
      |              ^~~
horses.cpp:178:1: warning: no return statement in function returning non-void [-Wreturn-type]
  178 | }
      | ^
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:185:14: warning: unused variable 'ans' [-Wunused-variable]
  185 |    long long ans=y[in];
      |              ^~~
horses.cpp:202:1: warning: no return statement in function returning non-void [-Wreturn-type]
  202 | }
      | ^
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:209:14: warning: unused variable 'ans' [-Wunused-variable]
  209 |    long long ans=y[in];
      |              ^~~
horses.cpp:225:1: warning: no return statement in function returning non-void [-Wreturn-type]
  225 | }
      | ^

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 416 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 79 ms 56748 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 480 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -