제출 #1270026

#제출 시각아이디문제언어결과실행 시간메모리
1270026scalifrastico_098말 (IOI15_horses)C++20
17 / 100
1596 ms8256 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; for(int i=0; i<u; i++){l*=gh[i]; hjg=max(hjg, l*fg[i]);} return hjg; } int updateY(int pos, int val) { fg[pos]=val; int jh=0; for(int i=0; i<u; i++){l*=gh[i]; jh=max(jh, l*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...