#include "horses.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int maxn = 5e5 + 10;
int n;
ll x[maxn], y[maxn], pref[maxn];
int solve() {
ll prod = 1, last = 0, mx = 0;
for(int i = 0; i < n; i++) {
prod *= x[i];
if((long double)y[i] * prod > last) {
mx = pref[i] * y[i] % mod;
prod = 1; last = y[i];
}
} return mx;
}
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];
pref[0] = x[0];
for(int i = 1; i < N; i++) {
pref[i] = pref[i - 1] * x[i] % mod;
}
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:19:11: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
} return mx;
^~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
248 KB |
Output is correct |
2 |
Correct |
2 ms |
356 KB |
Output is correct |
3 |
Correct |
2 ms |
408 KB |
Output is correct |
4 |
Correct |
2 ms |
408 KB |
Output is correct |
5 |
Correct |
2 ms |
408 KB |
Output is correct |
6 |
Correct |
2 ms |
460 KB |
Output is correct |
7 |
Correct |
2 ms |
516 KB |
Output is correct |
8 |
Correct |
2 ms |
516 KB |
Output is correct |
9 |
Correct |
2 ms |
516 KB |
Output is correct |
10 |
Correct |
2 ms |
576 KB |
Output is correct |
11 |
Correct |
2 ms |
576 KB |
Output is correct |
12 |
Correct |
2 ms |
596 KB |
Output is correct |
13 |
Correct |
2 ms |
596 KB |
Output is correct |
14 |
Correct |
2 ms |
620 KB |
Output is correct |
15 |
Correct |
2 ms |
620 KB |
Output is correct |
16 |
Correct |
2 ms |
620 KB |
Output is correct |
17 |
Correct |
2 ms |
620 KB |
Output is correct |
18 |
Correct |
2 ms |
620 KB |
Output is correct |
19 |
Correct |
2 ms |
748 KB |
Output is correct |
20 |
Correct |
2 ms |
748 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
748 KB |
Output is correct |
2 |
Correct |
2 ms |
748 KB |
Output is correct |
3 |
Correct |
2 ms |
748 KB |
Output is correct |
4 |
Correct |
2 ms |
748 KB |
Output is correct |
5 |
Correct |
2 ms |
748 KB |
Output is correct |
6 |
Correct |
2 ms |
748 KB |
Output is correct |
7 |
Correct |
2 ms |
748 KB |
Output is correct |
8 |
Correct |
2 ms |
748 KB |
Output is correct |
9 |
Correct |
2 ms |
748 KB |
Output is correct |
10 |
Correct |
2 ms |
748 KB |
Output is correct |
11 |
Correct |
2 ms |
748 KB |
Output is correct |
12 |
Correct |
2 ms |
748 KB |
Output is correct |
13 |
Correct |
2 ms |
748 KB |
Output is correct |
14 |
Correct |
2 ms |
748 KB |
Output is correct |
15 |
Correct |
2 ms |
748 KB |
Output is correct |
16 |
Correct |
2 ms |
748 KB |
Output is correct |
17 |
Correct |
2 ms |
748 KB |
Output is correct |
18 |
Correct |
2 ms |
748 KB |
Output is correct |
19 |
Correct |
2 ms |
748 KB |
Output is correct |
20 |
Correct |
2 ms |
748 KB |
Output is correct |
21 |
Incorrect |
2 ms |
748 KB |
Output isn't correct |
22 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1579 ms |
16304 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
16304 KB |
Output is correct |
2 |
Correct |
2 ms |
16304 KB |
Output is correct |
3 |
Correct |
2 ms |
16304 KB |
Output is correct |
4 |
Correct |
2 ms |
16304 KB |
Output is correct |
5 |
Correct |
2 ms |
16304 KB |
Output is correct |
6 |
Correct |
2 ms |
16304 KB |
Output is correct |
7 |
Correct |
2 ms |
16304 KB |
Output is correct |
8 |
Correct |
2 ms |
16304 KB |
Output is correct |
9 |
Correct |
2 ms |
16304 KB |
Output is correct |
10 |
Correct |
2 ms |
16304 KB |
Output is correct |
11 |
Correct |
2 ms |
16304 KB |
Output is correct |
12 |
Correct |
2 ms |
16304 KB |
Output is correct |
13 |
Correct |
2 ms |
16304 KB |
Output is correct |
14 |
Correct |
2 ms |
16304 KB |
Output is correct |
15 |
Correct |
2 ms |
16304 KB |
Output is correct |
16 |
Correct |
2 ms |
16304 KB |
Output is correct |
17 |
Correct |
2 ms |
16304 KB |
Output is correct |
18 |
Correct |
2 ms |
16304 KB |
Output is correct |
19 |
Correct |
2 ms |
16304 KB |
Output is correct |
20 |
Correct |
2 ms |
16304 KB |
Output is correct |
21 |
Incorrect |
2 ms |
16304 KB |
Output isn't correct |
22 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
16304 KB |
Output is correct |
2 |
Correct |
2 ms |
16304 KB |
Output is correct |
3 |
Correct |
2 ms |
16304 KB |
Output is correct |
4 |
Correct |
2 ms |
16304 KB |
Output is correct |
5 |
Correct |
2 ms |
16304 KB |
Output is correct |
6 |
Correct |
2 ms |
16304 KB |
Output is correct |
7 |
Correct |
2 ms |
16304 KB |
Output is correct |
8 |
Correct |
2 ms |
16304 KB |
Output is correct |
9 |
Correct |
2 ms |
16304 KB |
Output is correct |
10 |
Correct |
2 ms |
16304 KB |
Output is correct |
11 |
Correct |
2 ms |
16304 KB |
Output is correct |
12 |
Correct |
2 ms |
16304 KB |
Output is correct |
13 |
Correct |
2 ms |
16304 KB |
Output is correct |
14 |
Correct |
2 ms |
16304 KB |
Output is correct |
15 |
Correct |
2 ms |
16304 KB |
Output is correct |
16 |
Correct |
2 ms |
16304 KB |
Output is correct |
17 |
Correct |
2 ms |
16304 KB |
Output is correct |
18 |
Correct |
2 ms |
16304 KB |
Output is correct |
19 |
Correct |
2 ms |
16304 KB |
Output is correct |
20 |
Correct |
2 ms |
16304 KB |
Output is correct |
21 |
Incorrect |
2 ms |
16304 KB |
Output isn't correct |
22 |
Halted |
0 ms |
0 KB |
- |