Submission #299218

#	Time	Username	Problem	Language	Result	Execution time	Memory
299218		ASDF123	Horses (IOI15_horses)	C++17	0 / 100	1538 ms	8192 KiB

horses

#include "horses.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
#define ll long long
#define double long double
using namespace std;

const int N = (int)5e5 + 5;
const int MOD = (int)1e9 + 7;
const double eps = 1e-9;

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

int calc() {
  int pos = -1;
  double best = 0;
  double pref = 0;
  for (int i = 0; i < n; i++) {
    pref += (double)log2(x[i]*1.0);
    if (pref + (double)log2(y[i]*1.0) - best > eps) {
      best = pref + log2(y[i]*1.0);
      pos = i;
    }
  }
  long long ans = 1;
  for (int i = 0; i <= pos; i++) {
    ans *= x[i], ans %= MOD;
  }
  ans *= y[pos], ans %= MOD;
  return ans;
}

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

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

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

Compilation message (stderr)

horses.cpp: In function 'int calc()':
horses.cpp:31:10: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   31 |   return ans;
      |          ^~~

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