제출 #137306

#제출 시각아이디문제언어결과실행 시간메모리
137306eohomegrownapps말 (IOI15_horses)C++14
0 / 100
1550 ms8328 KiB
#include "horses.h" #include <bits/stdc++.h> using namespace std; int md = 1000000007; vector<int> x; vector<int> y; int n; int init(int N, int X[], int Y[]) { n=N; x.resize(n); y.resize(n); for (int i = 0; i<n; i++){ x[i]=X[i]; y[i]=Y[i]; } return 0; } int query(){ int mx = 1; int current = 1; for (int i = 0; i<n; i++){ current*=x[i]; current%=md; mx=max(mx,(current*y[i])%md); } return mx; } int updateX(int pos, int val) { x[pos]=val; return query(); } int updateY(int pos, int val) { y[pos]=val; return query(); }
#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...