| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 603255 | chirathnirodha | Split the Attractions (IOI19_split) | C++17 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "horses.h"
#include<bits/stdc++.h>
using namespace std;
#define PB push_back
#define MP make_pair
#define P push
#define I insert
#define F first
#define S second
typedef long long ll;
const ll mod=1e9+7;
const int maxn=500000;
int n;
ll segx[4*maxn],segy[4*maxn];
ll co[maxn],pr[maxn];
set<int> notone;
ll expo(ll x,ll y){
if(y==0)return 1;
if(y%2==1)return (x*expo((x*x)%mod,y/2))%mod;
else return expo(x*x,y/2);
}
void updx(ll a,ll b,int c,ll x,ll px,int y){
segx[c]=(segx[c]%mod*expo(px,mod-2)%mod)%mod;
segx[c]*=x;segx[c]%=mod;
if(a==b)return;
ll m=(a+b)/2;
if(y<=m)updx(a,m,2*c,x,px,y);
else updx(m+1,b,2*c+1,x,px,y);
}
ll findx(ll a,ll b,ll c,ll x,ll y){
if(a==x && b==y)return segx[c];
ll m=(a+b)/2;
if(y<=m)return findx(a,m,2*c,x,y);
if(x>=m+1)return findx(m+1,b,2*c+1,x,y);
return (findx(a,m,2*c,x,m)*findx(m+1,b,2*c+1,m+1,y))%mod;
}
void updy(ll a,ll b,int c,ll x,int y){
if(a==b){
segy[c]=x;
return;
}
ll m=(a+b)/2;
if(y<=m)updy(a,m,2*c,x,y);
else updy(m+1,b,2*c+1,x,y);
segy[c]=max(segy[2*c],segy[2*c+1]);
}
ll findy(ll a,ll b,ll c,ll x,ll y){
if(a==x && b==y)return segy[c];
ll m=(a+b)/2;
if(y<=m)return findy(a,m,2*c,x,y);
if(x>=m+1)return findy(m+1,b,2*c+1,x,y);
return max(findy(a,m,2*c,x,m),findy(m+1,b,2*c+1,m+1,y));
}
int func(){
auto itr=notone.end();itr--;
int last=*itr;itr--;
vector<pair<ll,ll> > v;
while(true){
if(v.size()>=80)break;
int cur=*itr;
if(cur+1!=last)v.PB(MP(last-1,findy(0,n-1,1,cur+1,last-1)));
if(cur==-1)break;
v.PB(MP(cur,pr[cur]));
last=cur;
itr--;
}
reverse(v.begin(),v.end());
int cmax=0;
ll mul=1;
for(int i=1;i<v.size();i++){
mul*=co[v[i].F];
if(mul*v[i].S>v[cmax].S){
cmax=i;
mul=1;
}
}
ll ans=v[cmax].S;
ans=v[cmax].S*findx(0,n-1,1,0,v[cmax].F);
ans%=mod;
return ans;
}
int init(int N, int X[], int Y[]) {
n=N;
for(int i=0;i<4*n;i++){segx[i]=1;segy[i]=0;}
for(int i=0;i<n;i++){
co[i]=X[i];
pr[i]=Y[i];
updy(0,n-1,1,Y[i],i);
updx(0,n-1,1,X[i],1,i);
}
for(int i=0;i<12;i++)cout<<segx[i]<<" ";cout<<endl;
for(int i=0;i<12;i++)cout<<segy[i]<<" ";cout<<endl;
cout<<endl;
notone.I(-1);notone.I(n);
for(int i=0;i<n;i++)if(X[i]!=1)notone.I(i);
return func();
}
int updateX(int pos, int val) {
updx(0,n-1,1,val,co[pos],pos);
co[pos]=val;
if(val==1)notone.erase(pos);
else notone.I(pos);
for(int i=0;i<12;i++)cout<<segx[i]<<" ";cout<<endl;
for(int i=0;i<12;i++)cout<<segy[i]<<" ";cout<<endl;
cout<<endl;
return func();
}
int updateY(int pos, int val) {
updy(0,n-1,1,val,pos);
pr[pos]=val;
for(int i=0;i<12;i++)cout<<segx[i]<<" ";cout<<endl;
for(int i=0;i<12;i++)cout<<segy[i]<<" ";cout<<endl;
cout<<"UPY"<<endl;
return func();
}