Submission #437976

#TimeUsernameProblemLanguageResultExecution timeMemory
437976illyakrHorses (IOI15_horses)C++14
17 / 100
1567 ms10304 KiB
#include <bits/stdc++.h> #include "horses.h" using namespace std; int n; int x[501010], y[501010]; int init(int N, int X[], int Y[]) { n = N; for (int i = 0; i < n; i++) { x[i] = X[i]; y[i] = Y[i]; } int ans = 0, cnt = 1; for (int i = 0; i < n; i++) { cnt *= X[i]; ans = max(ans, Y[i] * cnt); } return ans; } int updateX(int pos, int val) { x[pos] = val; int ans = 0, cnt = 1; for (int i = 0; i < n; i++) { cnt *= x[i]; ans = max(ans, y[i] * cnt); } return ans; } int updateY(int pos, int val) { y[pos] = val; int ans = 0, cnt = 1; for (int i = 0; i < n; i++) { cnt *= x[i]; ans = max(ans, y[i] * cnt); } return ans; }
#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...