# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
120799 | khulegub | Horses (IOI15_horses) | C++14 | 32 ms | 14072 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
#define eps 1e-9
using namespace std;
typedef long long i64;
int mod = 1e9 + 7;
// vector<i64> st;
vector<int> arr;
vector<int> x, y;
int mxid;
int n;
int init(int N, int X[], int Y[]){
n = N;
arr.resize(n);
x.resize(n);
y.resize(n);
for(int i = 0; i < n; i++){
x[i] = X[i];
y[i] = Y[i];
}
int urjver = x[0];
// init
int mx = 0;
double rem = (double) y[0];
for(int i = 1; i < n; i++){
if(x[i] * y[i] >= rem){
mx = i;
rem = (double) y[i];
}
rem /= (double) x[i];
}
for(int i = 1; i <= mx; i++){
urjver *= x[i];
}
urjver *= y[mx];
return urjver;
}
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... |