제출 #1240955

#제출 시각아이디문제언어결과실행 시간메모리
1240955edga1Horses (IOI15_horses)C++20
17 / 100
17 ms8352 KiB
#include "horses.h" #include <bits/stdc++.h> using namespace std; const int MOD=1e9+7, N=5e5+5; int x[N], y[N]; int init(int n, int X[], int Y[]){ for(int i=0; i<n; i++){ x[i]=X[i]; y[i]=Y[i]; } int m=0; for(int i=n-1; i>=0; i--){ m=max(m*x[i],x[i]*y[i]); } return m; } int updateX(int pos, int val) { return 0; } int updateY(int pos, int val) { return 0; }
#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...