Submission #787998

#	Time	Username	Problem	Language	Result	Execution time	Memory
787998		GusterGoose27	Horses (IOI15_horses)	C++17	17 / 100	13 ms	8364 KiB

horses

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int MAXN = 50;
const int MOD = 1e9+7;
int x[MAXN];
int y[MAXN];
int n;

int solve() {
	ll prod = 1;
	ll ans = 0;
	for (int i = 0; i < n; i++) {
		prod *= x[i];
		ans = max(ans, prod*y[i]);
	}
	return ans%MOD;
}

int init(int N, int X[], int Y[]) {
	n = N;
	for (int i = 0; i < n; i++) {
		x[i] = X[i];
		y[i] = Y[i];
	}
	return solve();
}

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

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

Compilation message (stderr)

horses.cpp: In function 'int solve()':
horses.cpp:20:12: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   20 |  return ans%MOD;
      |         ~~~^~~~

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