Submission #206321

#	Time	Username	Problem	Language	Result	Execution time	Memory
206321		oko	Horses (IOI15_horses)	C++14	34 / 100	1596 ms	52216 KiB

horses

#include "horses.h"
#include <stdio.h>
#include <stdlib.h>
#include <bits/stdc++.h>
using namespace std;
long long n,a[500500],b[500500],mod=1e9+7,tree[2005000],mxtree[2005000];
multiset<int>ms;
long long qrx(int nod,int l,int r,int x,int y)
{
    if(x<=l&&r<=y)return tree[nod];
    else if(r<x||y<l)return 1ll;
    int mid=(l+r)/2;
    return (qrx(nod*2,l,mid,x,y)*qrx(nod*2+1,mid+1,r,x,y))%mod;
}
long long qry(int nod,int l,int r,int x,int y)
{
    if(x<=l&&r<=y)return mxtree[nod];
    else if(r<x||y<l)return 0ll;
    int mid=(l+r)/2;
    return max(qry(nod*2,l,mid,x,y),qry(nod*2+1,mid+1,r,x,y));
}
long long slov()
{
    long long x=1,ans=0,st,i=n-1;
    while(1)
    {
        x*=a[i];
        if(x>(long long)2e9)break;
        st=i;
        if(i==0)break;
        i--;
    }
    if(st)ans=b[st-1];
    x=1;
    for(int i=st;i<n;i++)
    {
        x*=a[i];
        ans=max(ans,x*b[i]);
    }
    ans%=mod;
    for(int i=0;i<st;i++)
    {
        ans*=a[i];
        ans%=mod;
    }
    return ans%mod;
}
void upy(int nod,int l,int r,int x,long long val)
{
    if(x<l||r<x)return;
    if(l==r)
    {
        mxtree[nod]=val;
        return;
    }
    int mid=(l+r)/2;
    upy(nod*2,l,mid,x,val);
    upy(nod*2+1,mid+1,r,x,val);
    mxtree[nod]=max(mxtree[nod*2],mxtree[nod*2+1]);
}
void upx(int nod,int l,int r,int x,long long val)
{
    if(x<l||r<x)return;
    if(l==r)
    {
        tree[nod]=val;
        return;
    }
    int mid=(l+r)/2;
    upx(nod*2,l,mid,x,val);
    upx(nod*2+1,mid+1,r,x,val);
    tree[nod]=(tree[nod*2]*tree[nod*2+1])%mod;
}
int init(int N, int X[], int Y[])
{
    n=N;
    for(int i=0;i<n;i++)
    {
        a[i]=X[i];
        b[i]=Y[i];
        ms.insert(i);
        upx(1,0,n+5,i,a[i]);
        upy(1,0,n+5,i,b[i]);
    }
    return slov();
}
int updateX(int pos, int val)
{
    a[pos]=val;
    upx(1,0,n+5,pos,val);
    return slov();
}
int updateY(int pos, int val)
{
    b[pos]=val;
    upy(1,0,n+5,pos,val);
    return slov();
}

Compilation message (stderr)

horses.cpp: In function 'long long int slov()':
horses.cpp:35:13: warning: declaration of 'i' shadows a previous local [-Wshadow]
     for(int i=st;i<n;i++)
             ^
horses.cpp:24:28: note: shadowed declaration is here
     long long x=1,ans=0,st,i=n-1;
                            ^
horses.cpp:35:15: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     for(int i=st;i<n;i++)
               ^~
horses.cpp:41:13: warning: declaration of 'i' shadows a previous local [-Wshadow]
     for(int i=0;i<st;i++)
             ^
horses.cpp:24:28: note: shadowed declaration is here
     long long x=1,ans=0,st,i=n-1;
                            ^
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:82:18: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
         upx(1,0,n+5,i,a[i]);
                 ~^~
horses.cpp:83:18: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
         upy(1,0,n+5,i,b[i]);
                 ~^~
horses.cpp:85:16: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     return slov();
            ~~~~^~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:90:14: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     upx(1,0,n+5,pos,val);
             ~^~
horses.cpp:91:16: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     return slov();
            ~~~~^~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:96:14: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     upy(1,0,n+5,pos,val);
             ~^~
horses.cpp:97:16: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     return slov();
            ~~~~^~
horses.cpp: In function 'long long int slov()':
horses.cpp:24:25: warning: 'st' may be used uninitialized in this function [-Wmaybe-uninitialized]
     long long x=1,ans=0,st,i=n-1;
                         ^~

• Subtask 1: 17 / 17
• Subtask 2: 17 / 17
• Subtask 3: 0 / 20
• Subtask 4: 0 / 23
• Subtask 5: 0 / 23