Submission #791187

#TimeUsernameProblemLanguageResultExecution timeMemory
791187KhizriHorses (IOI15_horses)C++17
37 / 100
538 ms52932 KiB
#include "horses.h" #include <bits/stdc++.h> using namespace std; #define ll unsigned long long #define pb push_back #define F first #define S second #define INF 1e18 #define all(v) (v).begin(),(v).end() #define rall(v) (v).rbegin(),(v).rend() #define pii pair<int,int> #define pll pair<ll,ll> #define OK cout<<"Ok"<<endl; #define MOD (ll)(1e9+7) const int mxn=5e5+5; ll n,idx[mxn],arr[mxn],tree2[mxn*4]; ll tree[4*mxn]; set<int>st; void build(int node,int l,int r){ if(l==r){ tree[node]=idx[l]; return; } int m=(l+r)/2; build(2*node,l,m); build(2*node+1,m+1,r); tree[node]=(tree[2*node]*tree[2*node+1])%MOD; } void build2(int node,int l,int r){ if(l==r){ tree2[node]=arr[l]; return; } int m=(l+r)/2; build2(2*node,l,m); build2(2*node+1,m+1,r); tree2[node]=max(tree2[2*node],tree2[2*node+1]); } void update(int node,int l,int r,int pos,int val){ if(l>pos||r<pos) return; if(l==r){ tree[node]=val; return; } int m=(l+r)/2; update(2*node,l,m,pos,val); update(2*node+1,m+1,r,pos,val); tree[node]=(tree[2*node]*tree[2*node+1])%MOD; } void update2(int node,int l,int r,int pos,int val){ if(l>pos||r<pos) return; if(l==r){ tree2[node]=val; return; } int m=(l+r)/2; update2(2*node,l,m,pos,val); update2(2*node+1,m+1,r,pos,val); tree2[node]=max(tree2[2*node],tree2[2*node+1]); } ll query(int node,int l,int r,int ql,int qr){ if(l>qr||r<ql) return 1; if(ql<=l&&r<=qr) return tree[node]; int m=(l+r)/2; return (query(2*node,l,m,ql,qr)*query(2*node+1,m+1,r,ql,qr))%MOD; } int query2(int node,int l,int r,int ql,int qr){ if(l>qr||r<ql) return 0; if(ql<=l&&r<=qr) return tree2[node]; int m=(l+r)/2; return max(query2(2*node,l,m,ql,qr),query2(2*node+1,m+1,r,ql,qr)); } int init(int N, int X[], int Y[]) { n=N; for(int i=0;i<n;i++){ arr[i+1]=Y[i]; idx[i+1]=X[i]; if(idx[i+1]>1){ st.insert(i+1); } } build(1,1,n); build2(1,1,n); int k=min(32,(int)st.size()); auto it=st.end(); ll res=query2(1,1,n,1,n); if(st.size()){ it=--st.end(); } else{ return res; } ll a=1; vector<int>vt; while(k--){ int x=*it; a=1ll*a*idx[x]; vt.pb(x); if(a>1e9) break; it--; } __int128 ans=1; __int128 mx=1; reverse(all(vt)); int q=-1; vt.pb(n+1); for(int i=0;i<vt.size()-1;i++){ __int128 qq=idx[vt[i]];; ans*=qq; int l=vt[i],r=vt[i+1]-1; qq=query2(1,1,n,l,r); __int128 k=ans*qq; if(k>mx){ mx=k; q=i; } } if(q==-1) return res; int l=vt[q],r=vt[q+1]-1; res=(1ll*query(1,1,n,1,vt[q])*query2(1,1,n,l,r))%MOD; return res; } int updateX(int pos, int val) { pos++; if(idx[pos]>1){ st.erase(pos); } idx[pos]=val; if(idx[pos]>1){ st.insert(pos); } update(1,1,n,pos,val); int k=min(32,(int)st.size()); auto it=st.end(); ll res=query2(1,1,n,1,n); if(st.size()){ it=--st.end(); } else{ return res; } ll a=1; vector<int>vt; while(k--){ int x=*it; a=1ll*a*idx[x]; vt.pb(x); if(a>1e9) break; it--; } __int128 ans=1; __int128 mx=1; reverse(all(vt)); int q=-1; vt.pb(n+1); for(int i=0;i<vt.size()-1;i++){ __int128 qq=idx[vt[i]];; ans*=qq; int l=vt[i],r=vt[i+1]-1; qq=query2(1,1,n,l,r); __int128 k=ans*qq; if(k>mx){ mx=k; q=i; } } if(q==-1) return res; int l=vt[q],r=vt[q+1]-1; res=(1ll*query(1,1,n,1,vt[q])*query2(1,1,n,l,r))%MOD; return res; } int updateY(int pos, int val) { pos++; arr[pos]=val; update2(1,1,n,pos,val); int k=min(32,(int)st.size()); auto it=st.end(); ll res=query2(1,1,n,1,n); if(st.size()){ it=--st.end(); } else{ return res; } ll a=1; vector<int>vt; while(k--){ int x=*it; a=1ll*a*idx[x]; vt.pb(x); if(a>1e9) break; it--; } __int128 ans=1; __int128 mx=1; reverse(all(vt)); int q=-1; vt.pb(n+1); for(int i=0;i<vt.size()-1;i++){ __int128 qq=idx[vt[i]];; ans*=qq; int l=vt[i],r=vt[i+1]-1; qq=query2(1,1,n,l,r); __int128 k=ans*qq; if(k>mx){ mx=k; q=i; } } if(q==-1) return res; int l=vt[q],r=vt[q+1]-1; res=(1ll*query(1,1,n,1,vt[q])*query2(1,1,n,l,r))%MOD; return res; }

Compilation message (stderr)

horses.cpp: In function 'int query2(int, int, int, int, int)':
horses.cpp:69:39: warning: conversion from 'long long unsigned int' to 'int' may change value [-Wconversion]
   69 |     if(ql<=l&&r<=qr) return tree2[node];
      |                             ~~~~~~~~~~^
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:75:15: warning: comparison of integer expressions of different signedness: 'int' and 'long long unsigned int' [-Wsign-compare]
   75 |  for(int i=0;i<n;i++){
      |              ~^~
horses.cpp:82:12: warning: conversion from 'long long unsigned int' to 'int' may change value [-Wconversion]
   82 |  build(1,1,n);
      |            ^
horses.cpp:83:13: warning: conversion from 'long long unsigned int' to 'int' may change value [-Wconversion]
   83 |  build2(1,1,n);
      |             ^
horses.cpp:86:20: warning: conversion from 'long long unsigned int' to 'int' may change value [-Wconversion]
   86 |  ll res=query2(1,1,n,1,n);
      |                    ^
horses.cpp:86:24: warning: conversion from 'long long unsigned int' to 'int' may change value [-Wconversion]
   86 |  ll res=query2(1,1,n,1,n);
      |                        ^
horses.cpp:91:16: warning: conversion from 'long long unsigned int' to 'int' may change value [-Wconversion]
   91 |         return res;
      |                ^~~
horses.cpp:99:12: warning: conversion from 'long long unsigned int' to 'double' may change value [-Wconversion]
   99 |         if(a>1e9) break;
      |            ^
horses.cpp:106:9: warning: conversion from 'long long unsigned int' to 'std::vector<int>::value_type' {aka 'int'} may change value [-Wconversion]
  106 |  vt.pb(n+1);
      |        ~^~
horses.cpp:107:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  107 |  for(int i=0;i<vt.size()-1;i++){
      |              ~^~~~~~~~~~~~
horses.cpp:111:23: warning: conversion from 'long long unsigned int' to 'int' may change value [-Wconversion]
  111 |         qq=query2(1,1,n,l,r);
      |                       ^
horses.cpp:112:18: warning: declaration of 'k' shadows a previous local [-Wshadow]
  112 |         __int128 k=ans*qq;
      |                  ^
horses.cpp:84:6: note: shadowed declaration is here
   84 |  int k=min(32,(int)st.size());
      |      ^
horses.cpp:118:19: warning: conversion from 'long long unsigned int' to 'int' may change value [-Wconversion]
  118 |  if(q==-1) return res;
      |                   ^~~
horses.cpp:120:21: warning: conversion from 'long long unsigned int' to 'int' may change value [-Wconversion]
  120 |  res=(1ll*query(1,1,n,1,vt[q])*query2(1,1,n,l,r))%MOD;
      |                     ^
horses.cpp:120:43: warning: conversion from 'long long unsigned int' to 'int' may change value [-Wconversion]
  120 |  res=(1ll*query(1,1,n,1,vt[q])*query2(1,1,n,l,r))%MOD;
      |                                           ^
horses.cpp:121:9: warning: conversion from 'long long unsigned int' to 'int' may change value [-Wconversion]
  121 |  return res;
      |         ^~~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:133:13: warning: conversion from 'long long unsigned int' to 'int' may change value [-Wconversion]
  133 |  update(1,1,n,pos,val);
      |             ^
horses.cpp:136:20: warning: conversion from 'long long unsigned int' to 'int' may change value [-Wconversion]
  136 |  ll res=query2(1,1,n,1,n);
      |                    ^
horses.cpp:136:24: warning: conversion from 'long long unsigned int' to 'int' may change value [-Wconversion]
  136 |  ll res=query2(1,1,n,1,n);
      |                        ^
horses.cpp:141:16: warning: conversion from 'long long unsigned int' to 'int' may change value [-Wconversion]
  141 |         return res;
      |                ^~~
horses.cpp:149:12: warning: conversion from 'long long unsigned int' to 'double' may change value [-Wconversion]
  149 |         if(a>1e9) break;
      |            ^
horses.cpp:156:9: warning: conversion from 'long long unsigned int' to 'std::vector<int>::value_type' {aka 'int'} may change value [-Wconversion]
  156 |  vt.pb(n+1);
      |        ~^~
horses.cpp:157:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  157 |  for(int i=0;i<vt.size()-1;i++){
      |              ~^~~~~~~~~~~~
horses.cpp:161:23: warning: conversion from 'long long unsigned int' to 'int' may change value [-Wconversion]
  161 |         qq=query2(1,1,n,l,r);
      |                       ^
horses.cpp:162:18: warning: declaration of 'k' shadows a previous local [-Wshadow]
  162 |         __int128 k=ans*qq;
      |                  ^
horses.cpp:134:6: note: shadowed declaration is here
  134 |  int k=min(32,(int)st.size());
      |      ^
horses.cpp:168:19: warning: conversion from 'long long unsigned int' to 'int' may change value [-Wconversion]
  168 |  if(q==-1) return res;
      |                   ^~~
horses.cpp:170:21: warning: conversion from 'long long unsigned int' to 'int' may change value [-Wconversion]
  170 |  res=(1ll*query(1,1,n,1,vt[q])*query2(1,1,n,l,r))%MOD;
      |                     ^
horses.cpp:170:43: warning: conversion from 'long long unsigned int' to 'int' may change value [-Wconversion]
  170 |  res=(1ll*query(1,1,n,1,vt[q])*query2(1,1,n,l,r))%MOD;
      |                                           ^
horses.cpp:171:9: warning: conversion from 'long long unsigned int' to 'int' may change value [-Wconversion]
  171 |  return res;
      |         ^~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:177:14: warning: conversion from 'long long unsigned int' to 'int' may change value [-Wconversion]
  177 |  update2(1,1,n,pos,val);
      |              ^
horses.cpp:180:20: warning: conversion from 'long long unsigned int' to 'int' may change value [-Wconversion]
  180 |  ll res=query2(1,1,n,1,n);
      |                    ^
horses.cpp:180:24: warning: conversion from 'long long unsigned int' to 'int' may change value [-Wconversion]
  180 |  ll res=query2(1,1,n,1,n);
      |                        ^
horses.cpp:185:16: warning: conversion from 'long long unsigned int' to 'int' may change value [-Wconversion]
  185 |         return res;
      |                ^~~
horses.cpp:193:12: warning: conversion from 'long long unsigned int' to 'double' may change value [-Wconversion]
  193 |         if(a>1e9) break;
      |            ^
horses.cpp:200:9: warning: conversion from 'long long unsigned int' to 'std::vector<int>::value_type' {aka 'int'} may change value [-Wconversion]
  200 |  vt.pb(n+1);
      |        ~^~
horses.cpp:201:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  201 |  for(int i=0;i<vt.size()-1;i++){
      |              ~^~~~~~~~~~~~
horses.cpp:205:23: warning: conversion from 'long long unsigned int' to 'int' may change value [-Wconversion]
  205 |         qq=query2(1,1,n,l,r);
      |                       ^
horses.cpp:206:18: warning: declaration of 'k' shadows a previous local [-Wshadow]
  206 |         __int128 k=ans*qq;
      |                  ^
horses.cpp:178:6: note: shadowed declaration is here
  178 |  int k=min(32,(int)st.size());
      |      ^
horses.cpp:212:19: warning: conversion from 'long long unsigned int' to 'int' may change value [-Wconversion]
  212 |  if(q==-1) return res;
      |                   ^~~
horses.cpp:214:21: warning: conversion from 'long long unsigned int' to 'int' may change value [-Wconversion]
  214 |  res=(1ll*query(1,1,n,1,vt[q])*query2(1,1,n,l,r))%MOD;
      |                     ^
horses.cpp:214:43: warning: conversion from 'long long unsigned int' to 'int' may change value [-Wconversion]
  214 |  res=(1ll*query(1,1,n,1,vt[q])*query2(1,1,n,l,r))%MOD;
      |                                           ^
horses.cpp:215:9: warning: conversion from 'long long unsigned int' to 'int' may change value [-Wconversion]
  215 |  return res;
      |         ^~~
#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...