Submission #568549

#	Time	Username	Problem	Language	Result	Execution time	Memory
568549		n0sk1ll	Horses (IOI15_horses)	C++14	17 / 100	16 ms	10488 KiB

horses

#include "horses.h"

#include <bits/stdc++.h>

#define xx first
#define yy second

using namespace std;
long long int typedef li;
const int mod=1000000007;

int n;
int x[12],y[12];

int sta()
{
    int cur=1,ans=0;
    for (int i=0;i<n;i++)
    {
        cur*=x[i];
        if (cur*y[i]>ans) ans=cur*y[i];
    }
    return ans;
}

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 sta();
}

int updateX(int pos, int val)
{
	x[pos]=val;
	return sta();
}

int updateY(int pos, int val)
{
	y[pos]=val;
	return sta();
}

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