Submission #135409

#	Time	Username	Problem	Language	Result	Execution time	Memory
135409		tinjyu	Horses (IOI15_horses)	C++14	0 / 100	66 ms	41080 KiB

horses

#include "horses.h"
#include <iostream>
using namespace std;
long long int n,x[1000005],y[1000005],ans[100],tree[20000005],st,en;
int build(int s,int e,int t)
{
    if(s==e)return tree[t]=x[s];
    else return tree[t]=(build(s,(s+e)/2,t*2)*build((s+e)/2+1,e,t*2+1))%1000000007;
}
int findtree(int s,int e,int t)
{
    if(e<st || en<s)return 1;
    else if(st<=s && e<=en)return tree[t];
    else return (findtree(s,(s+e)/2,t*2)*findtree((s+e)/2,e,t*2+1))%1000000007;
}
int changetree(int s,int e,int t)
{
    if(s==e)return en;
    if(st<s || e<st)return 1;
    else return tree[t]=(build(s,(s+e)/2,t*2)*build((s+e)/2+1,e,t*2+1))%1000000007;
}
int init(int N, int X[], int Y[]) {
    n=N;
    for(int i=0;i<n;i++)x[i]=X[i];
    for(int i=0;i<n;i++)y[i]=Y[i];
    build(0,n-1,1);
    long long int ans=n-32,tmp=1;
    for(int i=n-32;i<n;i++)
    {
        double t=(double)y[ans]/double(y[i]);
        if(tmp<1000000000)tmp*=x[i];
        if(tmp>=t)
        {
            ans=i;
            tmp=1;
        }
    }
    long long int a=y[ans];
    a=(a*findtree(0,n-1,1))%1000000007;
	return a;
}

int updateX(int pos, int val) {
    x[pos]=val;
    st=pos,en=val;
    changetree(0,n-1,1);
    long long int ans=n-32,tmp=1;
    for(int i=n-32;i<n;i++)
    {
        double t=(double)y[ans]/double(y[i]);
        if(tmp<1000000000)tmp*=x[i];
        if(tmp>=t)
        {
            ans=i;
            tmp=1;
        }
    }
    long long int a=y[ans];
    a=(a*findtree(0,n-1,1))%1000000007;
	return a;
}

int updateY(int pos, int val) {
    y[pos]=val;
    long long int ans=n-32,tmp=1;
    for(int i=n-32;i<n;i++)
    {
        double t=(double)y[ans]/double(y[i]);
        if(tmp<1000000000)tmp*=x[i];
        if(tmp>=t)
        {
            ans=i;
            tmp=1;
        }
    }
    long long int a=y[ans];
    a=(a*findtree(0,n-1,1))%1000000007;
	return a;
}

Compilation message (stderr)

horses.cpp: In function 'int build(int, int, int)':
horses.cpp:7:27: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     if(s==e)return tree[t]=x[s];
                    ~~~~~~~^~~~~
horses.cpp:8:24: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     else return tree[t]=(build(s,(s+e)/2,t*2)*build((s+e)/2+1,e,t*2+1))%1000000007;
                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
horses.cpp: In function 'int findtree(int, int, int)':
horses.cpp:13:41: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     else if(st<=s && e<=en)return tree[t];
                                   ~~~~~~^
horses.cpp: In function 'int changetree(int, int, int)':
horses.cpp:18:20: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     if(s==e)return en;
                    ^~
horses.cpp:20:24: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     else return tree[t]=(build(s,(s+e)/2,t*2)*build((s+e)/2+1,e,t*2+1))%1000000007;
                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:26:14: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     build(0,n-1,1);
             ~^~
horses.cpp:27:19: warning: declaration of 'ans' shadows a global declaration [-Wshadow]
     long long int ans=n-32,tmp=1;
                   ^~~
horses.cpp:4:39: note: shadowed declaration is here
 long long int n,x[1000005],y[1000005],ans[100],tree[20000005],st,en;
                                       ^~~
horses.cpp:28:16: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     for(int i=n-32;i<n;i++)
               ~^~~
horses.cpp:32:17: warning: conversion to 'double' from 'long long int' may alter its value [-Wconversion]
         if(tmp>=t)
                 ^
horses.cpp:39:22: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     a=(a*findtree(0,n-1,1))%1000000007;
                     ~^~
horses.cpp:40:9: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  return a;
         ^
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:46:19: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     changetree(0,n-1,1);
                  ~^~
horses.cpp:47:19: warning: declaration of 'ans' shadows a global declaration [-Wshadow]
     long long int ans=n-32,tmp=1;
                   ^~~
horses.cpp:4:39: note: shadowed declaration is here
 long long int n,x[1000005],y[1000005],ans[100],tree[20000005],st,en;
                                       ^~~
horses.cpp:48:16: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     for(int i=n-32;i<n;i++)
               ~^~~
horses.cpp:52:17: warning: conversion to 'double' from 'long long int' may alter its value [-Wconversion]
         if(tmp>=t)
                 ^
horses.cpp:59:22: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     a=(a*findtree(0,n-1,1))%1000000007;
                     ~^~
horses.cpp:60:9: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  return a;
         ^
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:65:19: warning: declaration of 'ans' shadows a global declaration [-Wshadow]
     long long int ans=n-32,tmp=1;
                   ^~~
horses.cpp:4:39: note: shadowed declaration is here
 long long int n,x[1000005],y[1000005],ans[100],tree[20000005],st,en;
                                       ^~~
horses.cpp:66:16: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     for(int i=n-32;i<n;i++)
               ~^~~
horses.cpp:70:17: warning: conversion to 'double' from 'long long int' may alter its value [-Wconversion]
         if(tmp>=t)
                 ^
horses.cpp:77:22: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     a=(a*findtree(0,n-1,1))%1000000007;
                     ~^~
horses.cpp:78:9: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  return a;
         ^

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