답안 #305664

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
305664 2020-09-23T18:43:55 Z baluteshih 식물 비교 (IOI20_plants) C++14
43 / 100
1993 ms 104240 KB
#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;
struct node
{
    int pa,dis;
    node operator+(const node &a)const{
        return node{a.pa,dis+a.dis};
    }
}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);
    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]=node{u,0};
            else 
                Ltr[u][0]=node{tmp.Y%n,u+n-tmp.Y};
            tmp=query2(u,u+k-1,0,2*n-1,1,seg4);
            if(tmp.X==INF)
                Rtr[u][0]=node{u,0};
            else
                Rtr[u][0]=node{(-tmp.Y)%n,(-tmp.Y)-u};
        }
        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[i][t-1]+Ltr[Ltr[i][t-1].pa][t-1],Rtr[i][t]=Rtr[i][t-1]+Rtr[Rtr[i][t-1].pa][t-1];
}

int compare_plants(int x, int y)
{
    if(layer[x]==layer[y]) return 0;
    int rt=1,tar,nw,dis;
    if(layer[x]>layer[y])
        swap(x,y),rt=-1;
    if(x>y)
        tar=y+n;
    else
        tar=y;
    nw=x;
    if(nw+K>tar)
        return rt;
    dis=0;
    for(int i=L;i>=0;--i)
        if(x+dis+Rtr[nw][i].dis+K<=tar)
            dis+=Rtr[nw][i].dis,nw=Rtr[nw][i].pa;
    dis+=Rtr[nw][0].dis,nw=Rtr[nw][0].pa;
    if(layer[y]>layer[nw]&&x+dis+K>tar)
        return rt;
    nw=x;
    if(x<y)
        tar=y-n;
    else
        tar=y;
    if(nw-K<tar)
        return rt;
    dis=0;
    for(int i=L;i>=0;--i)
        if(x+dis-Ltr[nw][i].dis-K>=tar)
            dis-=Ltr[nw][i].dis,nw=Ltr[nw][i].pa;
    dis-=Ltr[nw][0].dis,nw=Ltr[nw][0].pa;
    if(layer[y]>layer[nw]&&x+dis-K<tar)
        return rt;
    return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5120 KB Output is correct
2 Correct 4 ms 5120 KB Output is correct
3 Correct 4 ms 5120 KB Output is correct
4 Correct 4 ms 5120 KB Output is correct
5 Correct 4 ms 5120 KB Output is correct
6 Correct 72 ms 7928 KB Output is correct
7 Correct 196 ms 17528 KB Output is correct
8 Correct 1025 ms 97896 KB Output is correct
9 Correct 1113 ms 97948 KB Output is correct
10 Correct 1125 ms 98120 KB Output is correct
11 Correct 1055 ms 98720 KB Output is correct
12 Correct 1022 ms 100108 KB Output is correct
13 Correct 1033 ms 103140 KB Output is correct
14 Correct 1091 ms 103092 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5120 KB Output is correct
2 Correct 4 ms 5120 KB Output is correct
3 Correct 3 ms 5120 KB Output is correct
4 Correct 4 ms 5120 KB Output is correct
5 Correct 4 ms 5120 KB Output is correct
6 Correct 9 ms 5632 KB Output is correct
7 Correct 100 ms 10616 KB Output is correct
8 Correct 6 ms 5248 KB Output is correct
9 Correct 9 ms 5632 KB Output is correct
10 Correct 105 ms 10488 KB Output is correct
11 Correct 100 ms 10400 KB Output is correct
12 Correct 101 ms 10616 KB Output is correct
13 Correct 98 ms 10660 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5120 KB Output is correct
2 Correct 4 ms 5120 KB Output is correct
3 Correct 3 ms 5120 KB Output is correct
4 Correct 4 ms 5120 KB Output is correct
5 Correct 4 ms 5120 KB Output is correct
6 Correct 9 ms 5632 KB Output is correct
7 Correct 100 ms 10616 KB Output is correct
8 Correct 6 ms 5248 KB Output is correct
9 Correct 9 ms 5632 KB Output is correct
10 Correct 105 ms 10488 KB Output is correct
11 Correct 100 ms 10400 KB Output is correct
12 Correct 101 ms 10616 KB Output is correct
13 Correct 98 ms 10660 KB Output is correct
14 Correct 203 ms 18264 KB Output is correct
15 Correct 1992 ms 104040 KB Output is correct
16 Correct 206 ms 18296 KB Output is correct
17 Correct 1993 ms 104168 KB Output is correct
18 Correct 1234 ms 104240 KB Output is correct
19 Correct 1206 ms 104140 KB Output is correct
20 Correct 1832 ms 104188 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5120 KB Output is correct
2 Correct 4 ms 5120 KB Output is correct
3 Correct 107 ms 8984 KB Output is correct
4 Correct 1153 ms 101604 KB Output is correct
5 Correct 1326 ms 99432 KB Output is correct
6 Correct 1710 ms 100324 KB Output is correct
7 Correct 1859 ms 100956 KB Output is correct
8 Incorrect 1928 ms 103856 KB Output isn't correct
9 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5120 KB Output is correct
2 Correct 4 ms 5120 KB Output is correct
3 Correct 3 ms 5120 KB Output is correct
4 Correct 4 ms 5120 KB Output is correct
5 Correct 4 ms 5120 KB Output is correct
6 Correct 6 ms 5248 KB Output is correct
7 Correct 22 ms 5888 KB Output is correct
8 Correct 21 ms 5888 KB Output is correct
9 Correct 24 ms 5880 KB Output is correct
10 Correct 21 ms 5888 KB Output is correct
11 Correct 23 ms 5912 KB Output is correct
12 Correct 23 ms 5884 KB Output is correct
13 Correct 20 ms 5888 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5120 KB Output is correct
2 Correct 4 ms 5120 KB Output is correct
3 Correct 4 ms 5120 KB Output is correct
4 Correct 4 ms 5120 KB Output is correct
5 Correct 8 ms 5504 KB Output is correct
6 Correct 1472 ms 99064 KB Output is correct
7 Correct 1733 ms 99176 KB Output is correct
8 Correct 1811 ms 99172 KB Output is correct
9 Incorrect 1913 ms 103524 KB Output isn't correct
10 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5120 KB Output is correct
2 Correct 4 ms 5120 KB Output is correct
3 Correct 4 ms 5120 KB Output is correct
4 Correct 4 ms 5120 KB Output is correct
5 Correct 4 ms 5120 KB Output is correct
6 Correct 72 ms 7928 KB Output is correct
7 Correct 196 ms 17528 KB Output is correct
8 Correct 1025 ms 97896 KB Output is correct
9 Correct 1113 ms 97948 KB Output is correct
10 Correct 1125 ms 98120 KB Output is correct
11 Correct 1055 ms 98720 KB Output is correct
12 Correct 1022 ms 100108 KB Output is correct
13 Correct 1033 ms 103140 KB Output is correct
14 Correct 1091 ms 103092 KB Output is correct
15 Correct 4 ms 5120 KB Output is correct
16 Correct 4 ms 5120 KB Output is correct
17 Correct 3 ms 5120 KB Output is correct
18 Correct 4 ms 5120 KB Output is correct
19 Correct 4 ms 5120 KB Output is correct
20 Correct 9 ms 5632 KB Output is correct
21 Correct 100 ms 10616 KB Output is correct
22 Correct 6 ms 5248 KB Output is correct
23 Correct 9 ms 5632 KB Output is correct
24 Correct 105 ms 10488 KB Output is correct
25 Correct 100 ms 10400 KB Output is correct
26 Correct 101 ms 10616 KB Output is correct
27 Correct 98 ms 10660 KB Output is correct
28 Correct 203 ms 18264 KB Output is correct
29 Correct 1992 ms 104040 KB Output is correct
30 Correct 206 ms 18296 KB Output is correct
31 Correct 1993 ms 104168 KB Output is correct
32 Correct 1234 ms 104240 KB Output is correct
33 Correct 1206 ms 104140 KB Output is correct
34 Correct 1832 ms 104188 KB Output is correct
35 Correct 4 ms 5120 KB Output is correct
36 Correct 4 ms 5120 KB Output is correct
37 Correct 107 ms 8984 KB Output is correct
38 Correct 1153 ms 101604 KB Output is correct
39 Correct 1326 ms 99432 KB Output is correct
40 Correct 1710 ms 100324 KB Output is correct
41 Correct 1859 ms 100956 KB Output is correct
42 Incorrect 1928 ms 103856 KB Output isn't correct
43 Halted 0 ms 0 KB -