Submission #1172649

#TimeUsernameProblemLanguageResultExecution timeMemory
1172649HappyCapybaraHorses (IOI15_horses)C++17
34 / 100
1596 ms8256 KiB
#include "horses.h" #include<bits/stdc++.h> using namespace std; #define ll __int128 ll m = 1000000007; int n; vector<int> x, y; int solve(){ ll cur = 1, cy = 0, cx, bsf; for (int i=0; i<n; i++){ cur = (cur*x[i]) % m; cx *= x[i]; if (cx * y[i] > cy){ bsf = (cur*y[i]) % m; cy = y[i]; cx = 1; } } return bsf; } 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 solve(); } int updateX(int pos, int val){ x[pos] = val; return solve(); } int updateY(int pos, int val){ y[pos] = val; return solve(); }
#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...