Submission #1088722

#	Time	Username	Problem	Language	Result	Execution time	Memory
1088722		gustavo_d	Horses (IOI15_horses)	C++17	17 / 100	1567 ms	12124 KiB

horses

#include "horses.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int MAXN = 500000;
const ll MOD = 1e9+7;
int n;
vector<ll> x(MAXN), y(MAXN);

int init(int N, int X[], int Y[]) {
	n = N+1;
	for (int i=1; i<n; i++) x[i] = (ll)X[i-1];
	for (int i=1; i<n; i++) y[i] = (ll)Y[i-1];

	ll ans = 0;
	ll qtd = 1;
	for (int i=1; i<n; i++) {
		qtd = (qtd * x[i]) % MOD;
		ans = max(ans, (qtd * y[i]) % MOD);
	}
	return ans;
	// int dp[n][MX_COW+1];
	// for (int i=1; i<=MX_COW; i++) {
	// 	dp[0][i] = -1e9;
	// }
	// dp[0][1] = 0;
	// for (int i=1; i<n; i++) {
	// 	for (int cow=0; cow<=MX_COW; cow++) {
	// 		dp[i][cow] = -1e9;
	// 		for (int v=0; v<=MX_COW; v++) {
	// 			if ((cow+v)/x[i] > MX_COW) continue;
	// 			if ((cow+v) % x[i] != 0) continue;
	// 			dp[i][cow] = max(
	// 				dp[i][cow],
	// 				dp[i-1][(cow + v) / x[i]] + v * y[i]
	// 			);
	// 		}
	// 	}
	// }
	// return dp[n-1][0];
}

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

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

Compilation message (stderr)

horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:23:9: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   23 |  return ans;
      |         ^~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:53:9: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   53 |  return ans;
      |         ^~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:64:9: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   64 |  return ans;
      |         ^~~

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