Submission #439091

#	Time	Username	Problem	Language	Result	Execution time	Memory
439091		MilosMilutinovic	말 (IOI15_horses)	C++14	17 / 100	1572 ms	8120 KiB

horses

#include <bits/stdc++.h>
#define MAXN 500007
#define mod 1000000007
using namespace std;
int n,x[MAXN],y[MAXN];
int brute()
{
    long long p=1LL,ans=0;
    for(int i=0;i<n;i++)
    {
        p*=x[i];
        p%=mod;
        ans=max(ans,(p*y[i])%mod);
    }
    return ans%mod;
}
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];
    return brute();
}
int updateX(int pos, int val)
{
    x[pos]=val;
    return brute();
}
int updateY(int pos, int val)
{
    y[pos]=val;
    return brute();
}

Compilation message (stderr)

horses.cpp: In function 'int brute()':
horses.cpp:15:15: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   15 |     return ans%mod;
      |               ^

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