# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
676026 | 2022-12-29T00:32:02 Z | Hacv16 | Horses (IOI15_horses) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; #define fr first #define sc second typedef long long ll; const int MAX = 1010; const int INF = 0x3f3f3f3f; const int MOD = 1e9 + 7; int x[MAX], y[MAX]; int getAnswer(){ int ans = 0, horses = 1; for(int i = 1; i <= n; i++){ horses *= x[i]; ans = max(ans, horses * y[i]); } return ans; } int init(int _n, int _x[], int _y[]){ n = _n; for(int i = 1; i <= n; i++) x[i] = _x[i - 1], y[i] = _y[i - 1]; return getAnswer(); } int updateX(int pos, int val){ x[pos + 1] = val; return getAnswer(); } int updateY(int pos, int val){ y[pos + 1] = val; return getAnswer(); }