제출 #1004822

#제출 시각아이디문제언어결과실행 시간메모리
1004822magikarp23Horses (IOI15_horses)C++17
17 / 100
1586 ms8260 KiB
#include <bits/stdc++.h> #include "horses.h" using namespace std; const int MAX_N = 500000 + 1; int MOD = 1000000000 + 7; int X_store[MAX_N]; int Y_store[MAX_N]; int N_store; int calc_max_profit() { long long max_profit = 1; long long num_horses = 1; for (int i=0; i<N_store; i++) { num_horses *= X_store[i]; max_profit = max(max_profit, (num_horses * Y_store[i]) % MOD); } return int (max_profit % MOD); } int init(int N, int X[], int Y[]) { N_store = N; for (int i=0; i<N; i++) { X_store[i] = X[i]; Y_store[i] = Y[i]; } return calc_max_profit(); } int updateX(int pos, int val) { X_store[pos] = val; return calc_max_profit(); } int updateY(int pos, int val) { Y_store[pos] = val; return calc_max_profit(); }
#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...