Submission #47737

#TimeUsernameProblemLanguageResultExecution timeMemory
47737RezwanArefin01Horses (IOI15_horses)C++17
34 / 100
1592 ms17092 KiB
#include "horses.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll; 
const int mod = 1e9 + 7; 
const int maxn = 5e5 + 10; 
int n;
ll x[maxn], y[maxn]; 

int solve() {
	ll prod = 1, last = 0, pref = 1, mx = 0; 
	for(int i = 0; i < n; i++) {
		prod *= x[i]; 
		pref = pref * x[i] % mod;
		if((long double)y[i] * prod > last) {
			mx = pref * y[i] % mod;
			prod = 1; last = y[i]; 
		}	
	} return mx; 
}

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:11: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
  } return mx; 
           ^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...