Submission #719443

# Submission time Handle Problem Language Result Execution time Memory
719443 2023-04-05T22:47:37 Z thimote75 Horses (IOI15_horses) C++14
0 / 100
1500 ms 27708 KB
#include "horses.h"

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

#define ld long double
#define num long long

const num MOD = 1e9 + 7;

vector<num> X;
vector<num> Y;
vector<ld> lX;
vector<ld> lY;

int compute () {
	ld max_v = 0;
	ld sum_v = 0;

	num prod_v = 1;
	num mx_p_v = 0;

	for (int j = 0; j < lX.size(); j ++) {
		sum_v  += lX[j];
		prod_v *= X[j];
		prod_v %= MOD;

		ld cur_v = sum_v + lY[j];
		if (cur_v > max_v) {
			max_v = cur_v;

			mx_p_v = (prod_v * Y[j]) % MOD;
		}
	}

	return (int) mx_p_v;
}

int init(int N, int _X[], int _Y[]) {
	X.resize(N);
	Y.resize(N);
	lX.resize(N);
	lY.resize(N);

	for (int i = 0; i < N; i ++) {
		X [i] = _X[i];
		Y [i] = _Y[i];
		lX[i] = log((ld) X[i]);
		lY[i] = log((ld) Y[i]);
	}

	return compute();
}

int updateX(int pos, int val) {
	X [pos] = val;
	lX[pos] = log((ld) val);
	return compute();
}

int updateY(int pos, int val) {
	Y [pos] = val;
	lY[pos] = log((ld) val);
	return compute();
}

Compilation message

horses.cpp: In function 'int compute()':
horses.cpp:23:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long double>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |  for (int j = 0; j < lX.size(); j ++) {
      |                  ~~^~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Incorrect 1 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Incorrect 0 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 1566 ms 27708 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Incorrect 1 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Incorrect 0 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -