Submission #1270029

#TimeUsernameProblemLanguageResultExecution timeMemory
1270029scalifrastico_098Horses (IOI15_horses)C++20
17 / 100
1593 ms8280 KiB
#include "horses.h" #include <bits/stdc++.h> using namespace std; vector<int> gh, fg; int u, l=1; int init(int n, int x[], int y[]) { gh.resize(n); fg.resize(n); for(int i=0; i<n; i++) gh[i]=x[i]; for(int i=0; i<n; i++) fg[i]=y[i]; int k=0; u=n; for(int i=0; i<n; i++){l*=gh[i]; k=max(k, l*fg[i]);} return k; } int updateX(int pos, int val) { gh[pos]=val; int hjg=0, kj=1; for(int i=0; i<u; i++){kj*=gh[i]; hjg=max(hjg, kj*fg[i]);} return hjg; } int updateY(int pos, int val) { fg[pos]=val; int jh=0, ghj=1; for(int i=0; i<u; i++){ghj*=gh[i]; jh=max(jh, ghj*fg[i]);} return jh; }
#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...