| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 946986 | Nika533 | Horses (IOI15_horses) | C++17 | 41 ms | 10324 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC diagnostic warning "-std=c++11"
#include <bits/stdc++.h>
#include "horses.h"
#define pb push_back
#define f first
#define s second
#define MOD 1000000007
#define flush fflush(stdout)
#define all(x) (x).begin(),(x).end()
#define allr(x) (x).rbegin(), (x).rend()
#define pii pair<int,int>
using namespace std;
const int N=5e5+5;
int n,m,T,k,arr[N],x[N],y[N];
int power(int a, int b) {
int res=1;
while (b) {
if (b%2) {
res*=a; res%=MOD;
}
b/=2;
a*=a; a%=MOD;
}
return res;
}
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];
}
arr[0]=x[0];
for (int i=1; i<n; i++) {
arr[i]=arr[i-1]*x[i];
arr[i]%=MOD;
}
for (int i=0; i<n; i++) {
arr[i]*=y[i];
arr[i]%=MOD;
}
int ind=n-1;
int num=1e9;
long long p=1;
for (int i=n-1; i>=0; i--) {
p*=x[i];
if (p<=num) ind=i;
else break;
}
long long mx=0,idx;
long long a=1;
for (int i=ind; i<n; i++) {
a*=x[i];
if (a*y[i]>mx) {
idx=i;
mx=a*y[i];
}
}
return arr[idx];
}
int updateX(int pos, int val) {
for (int i=max(pos,n-35); i<n; i++) {
arr[i]*=val; arr[i]%=MOD;
//arr[i]/=x[pos];
arr[i]*=power(x[pos],MOD-2); arr[i]%=MOD;
}
x[pos]=val;
int ind=n-1;
int num=1e9;
long long p=1;
for (int i=n-1; i>=0; i--) {
p*=x[i];
if (p<=num) ind=i;
else break;
}
long long mx=0,idx;
long long a=1;
for (int i=ind; i<n; i++) {
a*=x[i];
if (a*y[i]>mx) {
idx=i;
mx=a*y[i];
}
}
return arr[idx];
}
int updateY(int pos, int val) {
arr[pos]*=val; arr[pos]%=MOD;
//arr[pos]/=y[pos];
arr[pos]*=power(y[pos],MOD-2); arr[pos]%=MOD;
y[pos]=val;
int ind=n-1;
int num=1e9;
long long p=1;
for (int i=n-1; i>=0; i--) {
p*=x[i];
if (p<=num) ind=i;
else break;
}
long long mx=0,idx;
long long a=1;
for (int i=ind; i<n; i++) {
a*=x[i];
if (a*y[i]>mx) {
idx=i;
mx=a*y[i];
}
}
return arr[idx];
}Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
