제출 #1186411

#제출 시각아이디문제언어결과실행 시간메모리
1186411harvsftw말 (IOI15_horses)C++20
17 / 100
15 ms4424 KiB
#include <bits/stdc++.h> #include "horses.h" using namespace std; #define F(i, n) for(int i = 0; i < (n); i++) int init(int N, int X[], int Y[]) { int64_t ans = 0, h = 1; F(i, N) { h *= X[i]; ans = max(ans, h * Y[i]); } return ans; } int updateX(int pos, int val) { return -1; } int updateY(int pos, int val) { return -1; }
#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...