# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
800780 | Liudas | 말 (IOI15_horses) | C++17 | 0 ms | 0 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 <bits/stdc++.h>
#include "horses.h"
using namespace std;
int init(int N, vector<int> X, vector<int> Y){
int ans = 0;
for(int i = 0; i < N; i ++){
if(i){
X[i] *= X[i-1];
}
ans = max(ans, X[i]*Y[i]);
}
return ans;
}
int updateX(int pos, int val){
return 0;
}
int updateY(int pos, int val){
return 0;
}