Submission #649568

#	Time	Username	Problem	Language	Result	Execution time	Memory
649568		ToroTN	Horses (IOI15_horses)	C++14	37 / 100	696 ms	29560 KiB

horses

#include<bits/stdc++.h>
using namespace std;
#include "horses.h"
#define ll long long
#define X first
#define Y second
ll n,x[500005],y[500005],md=1e9+7,nw,fight,nn=0;
ll seg[2000005],val,str,ans,last,mul[2000005],big;
void build(ll tree,ll st,ll ed)
{
	ll md=(st+ed)/2;
	if(st==ed)
	{
		seg[tree]=y[ed];
		mul[tree]=x[ed];
		return;
	}
	build(2*tree,st,md);
	build(2*tree+1,md+1,ed);
	seg[tree]=max(seg[2*tree],seg[2*tree+1]);
	mul[tree]=1;
	if(mul[2*tree]!=0)
	{
		mul[tree]=(mul[tree]*mul[2*tree]);
		mul[tree]%=1000000007;
	}
	if(mul[2*tree+1]!=0)
	{
		mul[tree]=(mul[tree]*mul[2*tree+1]);
		mul[tree]%=1000000007;
	}
}
void update(ll tree,ll st,ll ed,ll idx,ll val)
{
	ll md=(st+ed)/2;
	if(st==ed)
	{
		seg[tree]=y[idx];
		mul[tree]=x[idx];
		return;
	}
	if(idx<=md)
	{
		update(2*tree,st,md,idx,val);
	}else
	{
		update(2*tree+1,md+1,ed,idx,val);
	}
	seg[tree]=max(seg[2*tree],seg[2*tree+1]);
	mul[tree]=1;
	if(mul[2*tree]!=0)
	{
		mul[tree]=(mul[tree]*mul[2*tree]);
		mul[tree]%=1000000007;
	}
	if(mul[2*tree+1]!=0)
	{
		mul[tree]=(mul[tree]*mul[2*tree+1]);
		mul[tree]%=1000000007;
	}
}
ll query(ll tree,ll st,ll ed,ll l,ll r)
{
	ll md=(st+ed)/2;
	if(st>r||ed<l)return -1e9;
	if(st>=l&&ed<=r)return seg[tree];
	return max(query(2*tree,st,md,l,r),query(2*tree+1,md+1,ed,l,r));
}
ll query2(ll tree,ll st,ll ed,ll l,ll r)
{
	ll md=(st+ed)/2;
	if(st>r||ed<l)return 1;
	if(st>=l&&ed<=r)return mul[tree];
	return (query2(2*tree,st,md,l,r)*query2(2*tree+1,md+1,ed,l,r))%1000000007;
}
set<ll> s;
stack<pair<ll,ll> > stk;
ll solve()
{
	for(auto it=s.begin();it!=s.end();it++)
	{
		stk.push({*it,query(1,1,n,(*it),n)});
	}
	nw=n;
	str=y[n];
	ans=str;
	while(!stk.empty())
	{
		fight=stk.top().X;
		val=stk.top().Y;
		stk.pop();
		if(str>1e9)
		{
			str=2e9;
			ans*=x[nw];
			ans%=md;
		}else
		{
			if(val>str*x[nw])
			{
				str=val;
				ans=val;
			}else
			{
				str*=x[nw];
				ans*=x[nw];
				ans%=md;
			}
		}
		if(y[fight]>str)
		{
			str=y[fight];
			ans=y[fight];
		}
		nw=fight;
	}
	big=query2(1,1,n,1,nw);
	if(str>1e9)
	{
		str=2e9;
		ans*=big;
		ans%=md;
		return ans;
	}else
	{
		last=seg[1];
		if(last>str*big)
		{
			return last;
		}else
		{
			ans*=big;
			ans%=md;
			return ans;
		}
	}
}
int init(int N, int X[], int Y[]) {
	n=N;
	for(int i=1;i<=n;i++)
	{
		x[i]=X[i-1];
		y[i]=Y[i-1];
	}
	build(1,1,n);
	for(int i=1;i<n;i++)
	{
		if(x[i]>1)s.insert(i);
		if((int)s.size()>30)
		{
			if(s.find(*s.begin())!=s.end())
			{
				s.erase(*s.begin());
			}
		}
	}
	return solve();
}

int updateX(int pos, int val) {
	++pos;
	++nn;
	x[pos]=val;
	update(1,1,n,pos,val);
	if(pos<n)
	{
		if(x[pos]>1)
		{
			s.insert(pos);
		}else
		{
			if(s.find(pos)!=s.end())
			{
				s.erase(pos);
			}
		}
		if(s.size()>30)
		{
			if(s.find(*s.begin())!=s.end())
			{
				s.erase(*s.begin());
			}
		}
	}
	return solve();
}

int updateY(int pos, int val) {
	++pos;
	++nn;
	y[pos]=val;
	update(1,1,n,pos,val);
	return solve();
}

Compilation message (stderr)

horses.cpp: In function 'void build(long long int, long long int, long long int)':
horses.cpp:11:5: warning: declaration of 'md' shadows a global declaration [-Wshadow]
   11 |  ll md=(st+ed)/2;
      |     ^~
horses.cpp:7:26: note: shadowed declaration is here
    7 | ll n,x[500005],y[500005],md=1e9+7,nw,fight,nn=0;
      |                          ^~
horses.cpp: In function 'void update(long long int, long long int, long long int, long long int, long long int)':
horses.cpp:33:43: warning: declaration of 'val' shadows a global declaration [-Wshadow]
   33 | void update(ll tree,ll st,ll ed,ll idx,ll val)
      |                                           ^
horses.cpp:8:17: note: shadowed declaration is here
    8 | ll seg[2000005],val,str,ans,last,mul[2000005],big;
      |                 ^~~
horses.cpp:35:5: warning: declaration of 'md' shadows a global declaration [-Wshadow]
   35 |  ll md=(st+ed)/2;
      |     ^~
horses.cpp:7:26: note: shadowed declaration is here
    7 | ll n,x[500005],y[500005],md=1e9+7,nw,fight,nn=0;
      |                          ^~
horses.cpp: In function 'long long int query(long long int, long long int, long long int, long long int, long long int)':
horses.cpp:64:5: warning: declaration of 'md' shadows a global declaration [-Wshadow]
   64 |  ll md=(st+ed)/2;
      |     ^~
horses.cpp:7:26: note: shadowed declaration is here
    7 | ll n,x[500005],y[500005],md=1e9+7,nw,fight,nn=0;
      |                          ^~
horses.cpp: In function 'long long int query2(long long int, long long int, long long int, long long int, long long int)':
horses.cpp:71:5: warning: declaration of 'md' shadows a global declaration [-Wshadow]
   71 |  ll md=(st+ed)/2;
      |     ^~
horses.cpp:7:26: note: shadowed declaration is here
    7 | ll n,x[500005],y[500005],md=1e9+7,nw,fight,nn=0;
      |                          ^~
horses.cpp: In function 'long long int solve()':
horses.cpp:92:6: warning: conversion from 'long long int' to 'double' may change value [-Wconversion]
   92 |   if(str>1e9)
      |      ^~~
horses.cpp:118:5: warning: conversion from 'long long int' to 'double' may change value [-Wconversion]
  118 |  if(str>1e9)
      |     ^~~
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:157:14: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  157 |  return solve();
      |         ~~~~~^~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:160:26: warning: declaration of 'val' shadows a global declaration [-Wshadow]
  160 | int updateX(int pos, int val) {
      |                      ~~~~^~~
horses.cpp:8:17: note: shadowed declaration is here
    8 | ll seg[2000005],val,str,ans,last,mul[2000005],big;
      |                 ^~~
horses.cpp:185:14: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  185 |  return solve();
      |         ~~~~~^~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:188:26: warning: declaration of 'val' shadows a global declaration [-Wshadow]
  188 | int updateY(int pos, int val) {
      |                      ~~~~^~~
horses.cpp:8:17: note: shadowed declaration is here
    8 | ll seg[2000005],val,str,ans,last,mul[2000005],big;
      |                 ^~~
horses.cpp:193:14: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  193 |  return solve();
      |         ~~~~~^~

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