Submission #649420

#	Time	Username	Problem	Language	Result	Execution time	Memory
649420		ToroTN	말 (IOI15_horses)	C++14	17 / 100	1542 ms	13708 KiB

horses

#include<bits/stdc++.h>
using namespace std;
#include "horses.h"
#define ll long long
ll n,x[500005],y[500005],z[100005],node,ans,md=1000000007;
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];
	}
	node=n;
	z[n]=y[n];
	for(int i=n-1;i>=1;i--)
	{
		if(z[i+1]*x[i+1]<y[i])
		{
			node=i;
			z[i]=y[i];
		}else
		{
			z[i]=z[i+1]*x[i+1];
		}
	}
	ans=1;
	for(int i=1;i<=node;i++)
	{
		ans*=x[i];
		ans%=md;
	}
	ans*=y[node];
	ans%=md;
	return ans;
}

int updateX(int pos, int val) {
	pos+=1;
	x[pos]=val;
	z[n]=y[n];
	node=n;
	for(int i=n-1;i>=1;i--)
	{
		if(z[i+1]*x[i+1]<y[i])
		{
			node=i;
			z[i]=y[i];
		}else
		{
			z[i]=z[i+1]*x[i+1];
		}
	}
	ans=1;
	for(int i=1;i<=node;i++)
	{
		ans*=x[i];
		ans%=md;
	}
	ans*=y[node];
	ans%=md;
	return ans;
}

int updateY(int pos, int val) {
	pos+=1;
	y[pos]=val;
	z[n]=y[n];
	node=n;
	for(int i=n-1;i>=1;i--)
	{
		if(z[i+1]*x[i+1]<y[i])
		{
			node=i;
			z[i]=y[i];
		}else
		{
			z[i]=z[i+1]*x[i+1];
		}
	}
	ans=1;
	for(int i=1;i<=node;i++)
	{
		ans*=x[i];
		ans%=md;
	}
	ans*=y[node];
	ans%=md;
	return ans;
}

Compilation message (stderr)

horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:15:13: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   15 |  for(int i=n-1;i>=1;i--)
      |            ~^~
horses.cpp:34:9: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   34 |  return ans;
      |         ^~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:42:13: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   42 |  for(int i=n-1;i>=1;i--)
      |            ~^~
horses.cpp:61:9: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   61 |  return ans;
      |         ^~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:69:13: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   69 |  for(int i=n-1;i>=1;i--)
      |            ~^~
horses.cpp:88:9: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   88 |  return ans;
      |         ^~~

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