oj.uz

Submission #719407

# Submission time Handle Problem Language Result Execution time Memory
719407 2023-04-05T21:41:25 Z thimote75 Horses (IOI15_horses) C++14
17 / 100
 1500 ms 22032 KB 
#include "horses.h"

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

#define ld long double

const ld MOD = 1e9 + 7;

ld exp_table[25];

void init_exp_table () {
	exp_table[0] = exp(1.0);

	for (int j = 1; j < 25; j ++) {
		exp_table[j] = exp_table[j - 1] * exp_table[j - 1];
		exp_table[j] = fmod(exp_table[j], MOD);
	}
}

ld mod_exp (int n) {
	ld res = 1;

	for (int k = 0; k < 25; k ++) {
		if (((1 << k) & n) != 0) {
			res *= exp_table[k];
			res  = fmod(res, MOD);
		}
	}

	return res;
}
int mod_exp (ld doub) {
	int n = (int) floor(doub);
	ld f0 = mod_exp(n);

	ld om = doub - n;

	return round(fmod(f0 * exp(om), MOD));
}

vector<ld> lX;
vector<ld> lY;

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

	for (int j = 0; j < lX.size(); j ++) {
		sum_v += lX[j];

		max_v = max(max_v, sum_v + lY[j]);
	}

	return mod_exp(max_v);
}

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

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

	return compute();
}

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

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

Compilation message

horses.cpp: In function 'int mod_exp(long double)':
horses.cpp:39:14: warning: conversion from 'long double' to 'int' may change value [-Wfloat-conversion]
   39 |  return round(fmod(f0 * exp(om), MOD));
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
horses.cpp: In function 'int compute()':
horses.cpp:49:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long double>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |  for (int j = 0; j < lX.size(); j ++) {
      |                  ~~^~~~~~~~~~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 1 ms 304 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 300 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 352 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 300 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 304 KB Output is correct
20 Correct 1 ms 212 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 300 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 304 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 3 ms 212 KB Output is correct
19 Correct 0 ms 300 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Incorrect 1 ms 212 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 1554 ms 22032 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 300 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 304 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 1 ms 300 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 292 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 300 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Incorrect 1 ms 212 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 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 304 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 300 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Incorrect 1 ms 212 KB Output isn't correct
22 Halted 0 ms 0 KB -