Submission #802091

#TimeUsernameProblemLanguageResultExecution timeMemory
802091jlallas384Horses (IOI15_horses)C++17
17 / 100
1574 ms10300 KiB
#include "horses.h" #include <bits/stdc++.h> using namespace std; using ll = long long; const int mod = 1e9 + 7; vector<int> x, y; int n; int solve(){ int ans = 0; int hv = 1; for(int i = 0; i < n; i++){ hv *= x[i]; ans = max(ans, hv * y[i]); } return ans; } int init(int N, int X[], int Y[]) { n = N; x.resize(n), y.resize(n); for(int i = 0; i < n; i++){ x[i] = X[i]; y[i] = Y[i]; } return solve(); } int updateX(int pos, int val) { x[pos] = val; return solve(); } int updateY(int pos, int val) { y[pos] = val; return solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...