제출 #109098

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
109098		Garu	말 (IOI15_horses)	C++14	17 / 100	1546 ms	8236 KiB

horses

#include <bits/stdc++.h>
 
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int MAXN = 5e5 + 5;
int x[MAXN] , y[MAXN];
int n;
int updateX(int pos,int val)
{
x[pos] = val;
ll ans = 0;
ll profit = 0;
ll horses = 1;
 
for(int i = 0 ; i < n ; i++)
{
	horses = (horses * x[i]);
	horses%=MOD;
	profit = (horses * y[i]) % MOD;
	profit%=MOD;
	ans = max(ans , profit);
}
 
return (int)ans;
 
}
 
int updateY(int pos,int val)
{
 
y[pos] = val;
 
ll ans = 0;
ll profit = 0;
ll horses = 1;
 
for(int i = 0 ; i < n ; i++)
{
	horses = (horses * x[i]);
	horses%=MOD;
	profit = (horses * y[i]) % MOD;
	profit%=MOD;
	ans = max(ans , profit);
}
 
return (int)ans;
 
}
 
int init(int N , int X[] , int Y[])
{
n = N;
ll ans = 0;
ll profit = 0;
ll horses = 1;
for(int  i = 0 ; i < n ; i++)
 {
     x[i] = X[i];
     y[i] = Y[i];
 }
for(int i = 0 ; i < n ; i++)
{
	horses = (horses * x[i]);
	horses%=MOD;
	profit = (horses * y[i]) % MOD;
	profit%=MOD;
	ans = max(ans , profit);
}
 
return (int)ans;
 
}

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