# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
307299 | vipghn2003 | Horses (IOI15_horses) | C++14 | 768 ms | 53496 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.
#include "horses.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N ((int)501*1000)
#define MOD ((int)1e9+7)
int tavan(int x,int y){int res=1;while(y){res=1LL*res*((y%2)?x:1)%MOD;x=1LL*x*x%MOD;y/=2;}return res;}
int n,x[N],y[N];
set <int> s;
int segMul[4*N],segMax[4*N];
void updateMul(int q,int val,int xl=0,int xr=n,int id=1)
{
if(xl==xr-1)
{
segMul[id]=val;
return ;
}
int mid=(xl+xr)/2;
if(q<mid)updateMul(q,val,xl,mid,id*2);
else updateMul(q,val,mid,xr,id*2+1);
segMul[id]=1LL*segMul[id*2]*segMul[id*2+1]%MOD;
return ;
}
void updateMax(int q,int val,int xl=0,int xr=n,int id=1)
{
if(xl==xr-1)
{
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... |