#include "horses.h"
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int add (int a, int b) {
a += b; if (a >= MOD) a -= MOD;
return a;
}
int sub (int a, int b) {
a -= b; if (a < 0) a += MOD;
return a;
}
int mul (int a, int b) {
return (a * 1ll * b) % MOD;
}
const int MAXN = 5e5 + 25;
int x[MAXN], y[MAXN], n;
int ans () {
long double s = log2(x[0]) + log2(y[0]);
int pos = 0;
for (int i = 1; i < n; i++) {
long double t = s;
s -= log2(y[i - 1]);
s += log2(y[i]);
s += log2(x[i]);
swap(s, t);
if (t > s) {
s = t; pos = i;
}
}
int ret = 1;
for (int i = 0; i <= pos; i++) {
ret = mul(ret, x[i]);
}
ret = mul(ret, y[pos]);
return ret;
}
int init (int N, int X[], int Y[]) {
n = N;
for (int i = 0; i < n; i++) {
x[i] = X[i]; y[i] = Y[i];
}
return ans();
}
int updateX (int pos, int val) {
x[pos] = val;
return ans();
}
int updateY (int pos, int val) {
y[pos] = val;
return ans();
}
Compilation message
horses.cpp: In function 'int mul(int, int)':
horses.cpp:14:23: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
14 | return (a * 1ll * b) % MOD;
| ~~~~~~~~~~~~~~^~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 2 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 3 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 4 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 5 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 6 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 7 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 8 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 9 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 10 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 11 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 12 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 13 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 14 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 15 |
Correct |
0 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 |
2468 KB |
Output is correct |
| 19 |
Correct |
0 ms |
2492 KB |
Output is correct |
| 20 |
Correct |
0 ms |
2396 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 2 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 3 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 4 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 5 |
Correct |
0 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 |
0 ms |
2396 KB |
Output is correct |
| 10 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 11 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 12 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 13 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 14 |
Correct |
0 ms |
2492 KB |
Output is correct |
| 15 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 16 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 17 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 18 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 19 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 20 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 21 |
Incorrect |
0 ms |
2396 KB |
Output isn't correct |
| 22 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Execution timed out |
1552 ms |
9820 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 3 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 4 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 5 |
Correct |
0 ms |
2492 KB |
Output is correct |
| 6 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 7 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 8 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 9 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 10 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 11 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 12 |
Correct |
0 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 |
0 ms |
2396 KB |
Output is correct |
| 16 |
Correct |
0 ms |
2496 KB |
Output is correct |
| 17 |
Correct |
1 ms |
2648 KB |
Output is correct |
| 18 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 19 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 20 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 21 |
Incorrect |
0 ms |
2396 KB |
Output isn't correct |
| 22 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 2 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 3 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 4 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 5 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 6 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 7 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 8 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 9 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 10 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 11 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 12 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 13 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 14 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 15 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 16 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 17 |
Correct |
0 ms |
2496 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 |
2396 KB |
Output is correct |
| 21 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
| 22 |
Halted |
0 ms |
0 KB |
- |
