Submission #310045

#TimeUsernameProblemLanguageResultExecution timeMemory
310045tengiz05말 (IOI15_horses)C++17
17 / 100
17 ms9984 KiB
#include "horses.h" #include <bits/stdc++.h> using namespace std; int n; const int NN = 2e5+5; int a[NN]; int b[NN]; int init(int N, int X[], int Y[]) { n = N; for(int i=0;i<n;i++)a[i] = X[i]; for(int i=0;i<n;i++)b[i] = Y[i]; int cnt = 1; int ans = 0; for(int i=0;i<n;i++){ cnt *= a[i]; ans = max(ans, cnt*b[i]); } return ans; } int updateX(int pos, int val) { a[pos] = val; int cnt = 1; int ans = 0; for(int i=0;i<n;i++){ cnt *= a[i]; ans = max(ans, cnt*b[i]); } return ans; } int updateY(int pos, int val) { b[pos] = val; int cnt = 1; int ans = 0; for(int i=0;i<n;i++){ cnt *= a[i]; ans = max(ans, cnt*b[i]); } 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...