제출 #305628

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
305628		baluteshih	식물 비교 (IOI20_plants)	C++14	11 / 100	99 ms	7928 KiB

plants

#include "plants.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define X first
#define Y second
#define ALL(v) v.begin(),v.end()
#define SZ(a) ((int)a.size())
#define pb push_back

const int INF=1e9;
int Rtr[200005][20],Ltr[200005][20];
pii seg3[1600005],seg4[1600005];
int seg1[800005],seg2[800005],lazy1[800005],lazy2[800005];
int layer[400005];
vector<int> store[200005];

void build(int l,int r,int rt,const vector<int> &v,int *seg)
{
    if(l==r)
        return seg[rt]=v[l],void();
    int mid=(l+r)>>1;
    build(l,mid,rt<<1,v,seg),build(mid+1,r,rt<<1|1,v,seg);
    seg[rt]=min(seg[rt<<1],seg[rt<<1|1]);
}

void down(int rt,int *seg,int *lazy)
{
    if(lazy[rt])
    {
        seg[rt<<1]+=lazy[rt],lazy[rt<<1]+=lazy[rt];
        seg[rt<<1|1]+=lazy[rt],lazy[rt<<1|1]+=lazy[rt];
        lazy[rt]=0;
    }
}

void modify(int L,int R,int l,int r,int rt,int val,int *seg,int *lazy)
{
    if(l!=r) down(rt,seg,lazy);
    if(L<=l&&R>=r)
        return lazy[rt]+=val,seg[rt]+=val,void();
    int mid=(l+r)>>1;
    if(L<=mid)
        modify(L,R,l,mid,rt<<1,val,seg,lazy);
    if(R>mid)
        modify(L,R,mid+1,r,rt<<1|1,val,seg,lazy);
    seg[rt]=min(seg[rt<<1],seg[rt<<1|1]);
}

int query(int l,int r,int rt,int *seg,int *lazy)
{
    if(l!=r) down(rt,seg,lazy);
    if(l==r)
        return l;
    int mid=(l+r)>>1;
    if(seg[rt<<1]<=seg[rt<<1|1])
        return query(l,mid,rt<<1,seg,lazy);
    return query(mid+1,r,rt<<1|1,seg,lazy);
}

void dfs(int l,int r,int rt,int *seg,int *lazy,vector<int> &rst)
{
    if(l!=r) down(rt,seg,lazy);
    if(l==r)
        return rst.pb(l);
    int mid=(l+r)>>1;
    if(seg[rt<<1]==0)
        dfs(l,mid,rt<<1,seg,lazy,rst);
    if(seg[rt<<1|1]==0)
        dfs(mid+1,r,rt<<1|1,seg,lazy,rst);
}

void build3(int l,int r,int rt)
{
    seg3[rt]=pii(INF,l);
    if(l==r)
        return;
    int mid=(l+r)>>1;
    build3(l,mid,rt<<1),build3(mid+1,r,rt<<1|1);
}

void build4(int l,int r,int rt)
{
    seg4[rt]=pii(INF,-r);
    if(l==r)
        return;
    int mid=(l+r)>>1;
    build4(l,mid,rt<<1),build4(mid+1,r,rt<<1|1);
}

void modify3(int x,int l,int r,int rt,int val)
{
    if(l==r)
        return seg3[rt]=pii(val,l),void();
    int mid=(l+r)>>1;
    if(x<=mid)
        modify3(x,l,mid,rt<<1,val);
    else
        modify3(x,mid+1,r,rt<<1|1,val);
    seg3[rt]=min(seg3[rt<<1],seg3[rt<<1|1]);
}

void modify4(int x,int l,int r,int rt,int val)
{
    if(l==r)
        return seg4[rt]=pii(val,-r),void();
    int mid=(l+r)>>1;
    if(x<=mid)
        modify4(x,l,mid,rt<<1,val);
    else
        modify4(x,mid+1,r,rt<<1|1,val);
    seg4[rt]=min(seg4[rt<<1],seg4[rt<<1|1]);
}

pii query2(int L,int R,int l,int r,int rt,pii *seg)
{
    if(L<=l&&R>=r)
        return seg[rt];
    int mid=(l+r)>>1;
    if(R<=mid)
        return query2(L,R,l,mid,rt<<1,seg);
    if(L>mid)
        return query2(L,R,mid+1,r,rt<<1|1,seg);
    return min(query2(L,R,l,mid,rt<<1,seg),query2(L,R,mid+1,r,rt<<1|1,seg));
}

int arr[200005],K,n,L;

void init(int k, vector<int> r)
{
    n=SZ(r),K=k,L=__lg(n);
    if(n>300) exit(0);
    int ly=0;
	build(0,n-1,1,r,seg1),build(0,n-1,1,vector<int>(n,INF),seg2);
    for(int i=0;i<n;++ly)
    {
        while(seg1[1]==0)
        {
            int u=query(0,n-1,1,seg1,lazy1);
            modify(u,u,0,n-1,1,INF,seg1,lazy1),modify(u,u,0,n-1,1,-INF,seg2,lazy2);
            if(u+k<=n)
                modify(u+1,u+k-1,0,n-1,1,1,seg2,lazy2);
            else
            {
                if(u<n-1)
                    modify(u+1,n-1,0,n-1,1,1,seg2,lazy2);
                modify(0,k-n+u-1,0,n-1,1,1,seg2,lazy2);
            }
        }
        vector<int> rst;
        dfs(0,n-1,1,seg2,lazy2,rst);
        for(int u:rst)
        {
            if(u>=k-1)
                modify(u-k+1,u,0,n-1,1,-1,seg1,lazy1);
            else
                modify(0,u,0,n-1,1,-1,seg1,lazy1),modify(n-(k-u-1),n-1,0,n-1,1,-1,seg1,lazy1);
            if(u+k<=n)
                modify(u+1,u+k-1,0,n-1,1,-1,seg2,lazy2);
            else
            {
                if(u<n-1)
                    modify(u+1,n-1,0,n-1,1,-1,seg2,lazy2);
                modify(0,k-n+u-1,0,n-1,1,-1,seg2,lazy2);
            }
            modify(u,u,0,n-1,1,INF,seg2,lazy2);
            layer[u]=ly;
        }
        i+=SZ(rst),store[ly].swap(rst);
    }
    for(int i=0;i<n;++i)
        layer[i+n]=layer[i];
    build3(0,2*n-1,1),build4(0,2*n-1,1);
    for(int i=ly-1;i>=0;--i)
    {
        for(int u:store[i])
        {
            pii tmp=query2(u+n-k+1,u+n,0,2*n-1,1,seg3);
            if(tmp.X==INF)
                Ltr[u][0]=u;
            else 
                Ltr[u][0]=tmp.Y%n;
            tmp=query2(u,u+k-1,0,2*n-1,1,seg4);
            if(tmp.X==INF)
                Rtr[u][0]=u;
            else
                Rtr[u][0]=(-tmp.Y)%n;
        }
        for(int u:store[i])
            modify3(u,0,2*n-1,1,layer[u]),modify3(u+n,0,2*n-1,1,layer[u]),
            modify4(u,0,2*n-1,1,layer[u]),modify4(u+n,0,2*n-1,1,layer[u]);
    }
    for(int t=1;t<=L;++t)
        for(int i=0;i<n;++i)
            Ltr[i][t]=Ltr[Ltr[i][t-1]][t-1],Rtr[i][t]=Rtr[Rtr[i][t-1]][t-1];
    /*cout << "layer: ";
    for(int i=0;i<n;++i)
        cout << layer[i] << " ";
    cout << endl;
    cout << "Ltr: ";
    for(int i=0;i<n;++i)
        cout << Ltr[i][0] << " ";
    cout << endl;
    cout << "Rtr: ";
    for(int i=0;i<n;++i)
        cout << Rtr[i][0] << " ";
    cout << endl;*/
}

int compare_plants(int x, int y)
{
    if(layer[x]==layer[y]) return 0;
    int rt=1,tar,nw,tmp;
    if(layer[x]>layer[y])
        swap(x,y),rt=-1;
    deque<int> dq(1,x);
    for(int i=x+1;i<x+n;++i)
    {
        if(dq.front()==i-K)
            dq.pop_front();
        if(dq.empty())
            break;
        if(layer[dq.front()]<layer[i])
        {
            if(i%n==y) return rt;
            while(!dq.empty()&&layer[dq.back()]>=layer[i])
                dq.pop_back();
            dq.pb(i);
        }
    }
    dq.clear(),dq.pb(x+n);
    for(int i=x+n-1;i>x;--i)
    {
        if(dq.front()==i+K)
            dq.pop_front();
        if(dq.empty())
            break;
        if(layer[dq.front()]<layer[i])
        {
            if(i%n==y) return rt;
            while(!dq.empty()&&layer[dq.back()]>=layer[i])
                dq.pop_back();
            dq.pb(i);
        }
    }
    return 0;
    if(x>y)
        tar=y+n;
    else
        tar=y;
    nw=x,tmp=nw;
    if(tmp+K>tar)
        return rt;
    for(int i=L;i>=0;--i)
    {
        tmp=Rtr[nw][i];
        if(tmp<x) tmp+=n;
        if(tmp+K<=tar)
            nw=Rtr[nw][i];
    }
    nw=Rtr[nw][0],tmp=nw;
    if(nw<x) tmp+=n;
    if(layer[y]>layer[nw]&&tmp+K>tar)
        return rt;
    if(x<y)
        tar=y-n;
    else
        tar=y;
    nw=x,tmp=nw;
    if(tmp-K<tar)
        return rt;
    for(int i=L;i>=0;--i)
    {
        int tmp=Ltr[nw][i];
        if(tmp>x) tmp-=n;
        if(tmp-K>=tar)
            nw=Ltr[nw][i];
    }
    nw=Ltr[nw][0],tmp=nw;
    if(nw>x) tmp-=n;
    if(layer[y]>layer[nw]&&tmp-K<tar)
        return rt;
    return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 14
• Subtask 3: 0 / 13
• Subtask 4: 0 / 17
• Subtask 5: 11 / 11
• Subtask 6: 0 / 15
• Subtask 7: 0 / 25