제출 #1191985

#제출 시각아이디문제언어결과실행 시간메모리
1191985nagorn_ph말 (IOI15_horses)C++20
17 / 100
16 ms4420 KiB
#include <bits/stdc++.h> #include "horses.h" using namespace std; const int mod = 1e9 + 7; int init(int n, int x[], int y[]) { int ans = 1, h = 1; for (int i = 0; i < n; i++) { h *= x[i]; ans = max(ans, h * y[i]); } ans %= mod; return ans; } 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...