Submission #676029

#TimeUsernameProblemLanguageResultExecution timeMemory
676029Hacv16Horses (IOI15_horses)C++17
17 / 100
13 ms8336 KiB
#include <bits/stdc++.h> using namespace std; #define fr first #define sc second typedef long long ll; const int MAX = 1010; const int INF = 0x3f3f3f3f; const int MOD = 1e9 + 7; int n, x[MAX], y[MAX]; int getAnswer(){ ll ans = 0, horses = 1; for(int i = 1; i <= n; i++){ horses = (horses * x[i]) % MOD; ll cur = (horses * y[i]) % MOD; ans = max(ans, cur); } ans %= MOD; return (int) ans; } int init(int _n, int _x[], int _y[]){ n = _n; for(int i = 1; i <= n; i++) x[i] = _x[i - 1], y[i] = _y[i - 1]; return getAnswer(); } int updateX(int pos, int val){ x[pos + 1] = val; return getAnswer(); } int updateY(int pos, int val){ y[pos + 1] = val; return getAnswer(); }
#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...