Submission #927797

#TimeUsernameProblemLanguageResultExecution timeMemory
927797VMaksimoski008Horses (IOI15_horses)C++14
17 / 100
1555 ms6704 KiB
#include <bits/stdc++.h> #include "horses.h" #define sz(x) (int)x.size() #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() //#define int long long using namespace std; using ll = long long; using ull = unsigned long long; using ld = long double; using pii = pair<int, int>; using pll = pair<ll, ll>; const int mod = 1e9 + 7; const int LOG = 20; const int maxn = 1e5 + 5; const double eps = 1e-9; int n, X[5*maxn], Y[maxn]; int calc() { ll curr = 1, ans = 0; for(int i=0; i<n; i++) { curr = (curr * X[i]) % mod; ans = max(ans, (curr * Y[i]) % mod); } return (int)ans; } int init(int N, int x[], int y[]) { n = N; for(int i=0; i<n; i++) X[i] = x[i], Y[i] = y[i]; return calc(); } int updateX(int p, int v) { X[p] = v; return calc(); } int updateY(int p, int v) { Y[p] = v; return calc(); }
#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...