제출 #961737

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
961737		LucaLucaM	말 (IOI15_horses)	C++17	17 / 100	1519 ms	12180 KiB

horses

#include "horses.h"
#include <cassert>
#include <iostream>
#include <vector>
#include <algorithm>

typedef long long ll;

#define int ll

const int NMAX = 5e5;
const int mod = 1e9 + 7;

int n;
int x[NMAX + 1], y[NMAX + 1];

int solve() {
  ll prod = 1;
  bool bigProd = false;
  for (int i = 1; i <= n; i++) {
    if ((ll) prod * x[i] > 1e9) {
      bigProd = true;
      break;
    }
    prod *= x[i];
  }

  if (bigProd) {
    int m = n;
    int maxY = 0;
    while (m > 0 && x[m] == 1) {
      maxY = std::max(maxY, y[m--]);
    }
    maxY = std::max(maxY, y[m]);
    prod = 1;
    for (int i = 1; i <= m; i++) {
      prod = (ll) prod * x[i] % mod;
    }
    return (ll) prod * maxY;
  }
  ll dp[n + 1] = {}; /// dp[i] =def= care e profitul maxim a.i. la finalul celei de a i-a zile am exact 1 cal

  for (int i = 1; i <= n; i++) {
    int intre = 1;
    for (int j = i; j > 0; j--) {
      intre *= x[j];
      dp[i] = std::max(dp[i], dp[j - 1] + (ll) y[i] * (intre - 1));
    }
  }

  ll ret = 0;
  for (int i = 1; i <= n; i++) {
    ret = std::max(ret, dp[i] + y[i]);
  }
  return ret % mod;
}

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

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

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

컴파일 시 표준 에러 (stderr) 메시지

horses.cpp: In function 'll solve()':
horses.cpp:21:19: warning: conversion from 'll' {aka 'long long int'} to 'double' may change value [-Wconversion]
   21 |     if ((ll) prod * x[i] > 1e9) {
      |         ~~~~~~~~~~^~~~~~
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:64:15: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   64 |   return solve();
      |          ~~~~~^~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:69:15: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   69 |   return solve();
      |          ~~~~~^~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:74:15: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   74 |   return solve();
      |          ~~~~~^~

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