# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
120606 | khulegub | Horses (IOI15_horses) | C++14 | 27 ms | 6656 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "horses.h"
#include<bits/stdc++.h>
#define ll(x) x*2+1
#define rr(x) x*2+2
using namespace std;
typedef long long i64;
int mod = 1e9 + 7;
// vector<i64> st;
vector<int> arr;
int n;
// void build(int l, int r, int node){
// if(l == r){
// st[node] = arr[l];
// return ;
// }
// int mid = (l + r) >> 1;
// build(l, mid, ll(node));
// build(mid+1, rr, rr(node));
// st[node] = max(st[ll(node)], st[rr(node)]);
// }
// i64 query(int l, int r, )
// void update(int pos, int val, int l, int r, int node){
// }
int init(int N, int X[], int Y[]) {
n=N;
int mx=1;
arr.resize(N);
for(int i = 0; i < N; i++){
arr[i] = Y[i];
if(i > 0) arr[i] *= arr[i-1];
// cout << arr[i] << ' ';
mx = max(mx, X[i] * arr[i]);
}
// st.resize(4*N);
// build(0, N-1, 0);
return mx;
}
int updateX(int pos, int val) {
return 0;
}
int updateY(int pos, int val) {
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |