oj.uz

Submission #961734

# Submission time Handle Problem Language Result Execution time Memory
961734 2024-04-12T11:35:31 Z LucaLucaM Horses (IOI15_horses) C++17
17 / 100
 1500 ms 8280 KB 
#include "horses.h"
#include <cassert>
#include <iostream>
#include <vector>
#include <algorithm>

typedef long long 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--]);
    }
    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;
}

int init(int N, int X[], int Y[]) {
  n = N;
  for (int i = 1; i <= n; i++) {
    x[i] = X[i - 1];
    y[i] = Y[i - 1];
  }
  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

horses.cpp: In function 'int solve()':
horses.cpp:20:19: warning: conversion from 'll' {aka 'long long int'} to 'double' may change value [-Wconversion]
   20 |     if ((ll) prod * x[i] > 1e9) {
      |         ~~~~~~~~~~^~~~~~
horses.cpp:37:22: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   37 |     return (ll) prod * maxY;
      |            ~~~~~~~~~~^~~~~~
horses.cpp:53:14: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   53 |   return ret % mod;
      |          ~~~~^~~~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 0 ms 2392 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2440 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Incorrect 1 ms 2396 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1526 ms 8280 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Incorrect 1 ms 2396 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2592 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2440 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 1 ms 2392 KB Output is correct
21 Incorrect 1 ms 2396 KB Output isn't correct
22 Halted 0 ms 0 KB -