oj.uz

Submission #727010

# Submission time Handle Problem Language Result Execution time Memory
727010 2023-04-19T19:55:25 Z Yell0 Horses (IOI15_horses) C++17
37 / 100
 617 ms 83636 KB 
#include <bits/stdc++.h>
 
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int MOD=1e9+7;
ll modinv(ll a) {
  ll res=1;
  for(ll i=0;(1LL<<i)<=MOD-2;++i) {
    if((MOD-2)&(1LL<<i)) res=res*a%MOD;
    a=a*a%MOD;
  }
  return res;
}

int N;
vector<ll> bit,X,Y;
set<pii> iv;
void upd(int i,int a) {
  for(;i<=N;i+=-i&i) bit[i]=bit[i]*a%MOD;
}
ll qry(int i) {
  ll res=1;
  for(;i>0;i-=-i&i) res=res*bit[i]%MOD;
  return res;
}
struct node{int l,r;ll mx=1;};
vector<node> seg;
void bldmx(int l,int r,int i) {
  seg[i].l=l;
  seg[i].r=r;
  if(l==r) return;
  int mid=(l+r)/2;
  bldmx(l,mid,i*2);
  bldmx(mid+1,r,i*2+1);
  seg[i].mx=max(seg[i*2].mx,seg[i*2+1].mx);
}
void updmx(int p,ll v,int i) {
  if(seg[i].l==p&&p==seg[i].r) {
    seg[i].mx=v;
    return;
  }
  int mid=(seg[i].l+seg[i].r)/2;
  if(p<=mid) updmx(p,v,i*2);
  else updmx(p,v,i*2+1);
  seg[i].mx=max(seg[i*2].mx,seg[i*2+1].mx);
}
ll qrymx(int l,int r,int i) {
  if(seg[i].l==l&&seg[i].r==r) return seg[i].mx;
  int mid=(seg[i].l+seg[i].r)/2;
  if(r<=mid) return qrymx(l,r,i*2);
  else if(l>mid) return qrymx(l,r,i*2+1);
  else return max(qrymx(l,mid,i*2),qrymx(mid+1,r,i*2+1));
}

ll fndmx() {
  ll pfx=1,sfx=1,mpfx=1;
  auto sti=--iv.end();
  for(auto i=sti;i!=--iv.begin();--i) {
    sfx*=X[i->first];
    sti=i;
    if(sfx>=(ll)1e9) break;
  }
  auto mxi=sti;
  for(auto i=sti;i!=iv.end();++i) {
    pfx*=X[i->first];
    if(pfx/mpfx>qrymx(mxi->first,mxi->second,1)/qrymx(i->first,i->second,1)) {
      mxi=i;
      mpfx=pfx;
    }
  }
  return qry(mxi->first)*qrymx(mxi->first,mxi->second,1)%MOD;
}

int init(int n,int x[],int y[]) {
  N=n;
  bit.resize(N+2,1);
  X.resize(N+2,1);
  Y.resize(N+2,1);
  seg.resize(N*4);
  bldmx(1,N,1);
  for(int i=1;i<=N;++i) {
    upd(i,x[i-1]);
    X[i]=x[i-1];
    updmx(i,y[i-1],1);
    Y[i]=y[i-1];
  }
  int st=1,ed=1;
  for(int i=1;i<=N;++i) {
    ed=i;
    if(X[i]==1) {
      if(X[i-1]>1) st=i;
      if(X[i+1]>1||i==N) iv.insert({st,ed});
      continue;
    }
    st=i;
    iv.insert({st,ed});
  }
  return fndmx();
}
int updateX(int i,int a) {
  ++i;
  upd(i,modinv(X[i])*a%MOD);
  if(X[i]==1&&a!=1) {
    pii old=*(--iv.upper_bound({i,INT_MAX}));
    if(old.first!=old.second) {
      iv.erase(old);
      if(i==old.first) iv.insert({old.first+1,old.second});
      else if(i==old.second) iv.insert({old.first,old.second-1});
      else { 
        iv.insert({old.first,i-1});
        iv.insert({i,i});
        iv.insert({i+1,old.second});
      }
    }
  }
  if(a==1&&X[i]!=1) {
    pii curr={i,i};
    int st=0,ed=0;
    if(X[i-1]==1&&i!=1) {
      st=(--iv.lower_bound(curr))->first;
      iv.erase(--iv.lower_bound(curr));
    }
    if(X[i+1]==1&&i!=N) {
      ed=(iv.upper_bound(curr))->second;
      iv.erase(iv.upper_bound(curr));
    }
    iv.erase(curr);
    iv.insert({(st?st:i),(ed?ed:i)});
  }
  X[i]=a;
  return fndmx();
}
int updateY(int i,int a) {
  ++i;
  Y[i]=a;
  updmx(i,a,1);
  return fndmx();
}

Compilation message

horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:99:15: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   99 |   return fndmx();
      |          ~~~~~^~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:103:23: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
  103 |   upd(i,modinv(X[i])*a%MOD);
      |         ~~~~~~~~~~~~~~^~~~
horses.cpp:132:15: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
  132 |   return fndmx();
      |          ~~~~~^~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:138:15: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
  138 |   return fndmx();
      |          ~~~~~^~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 304 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 296 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 300 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 300 KB Output is correct
19 Correct 1 ms 296 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 296 KB Output is correct
23 Incorrect 2 ms 340 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 617 ms 75536 KB Output is correct
2 Correct 379 ms 83636 KB Output is correct
3 Correct 365 ms 73032 KB Output is correct
4 Correct 376 ms 73000 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 300 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Incorrect 2 ms 340 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 268 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 288 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 304 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Incorrect 2 ms 432 KB Output isn't correct
24 Halted 0 ms 0 KB -