oj.uz

답안 #305606

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
305606 2020-09-23T16:43:42 Z baluteshih 식물 비교 (IOI20_plants) C++14
32 / 100
 1960 ms 72972 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;
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);
    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;
    if(x>y)
        tar=y+n;
    else
        tar=y;
    nw=x,tmp=nw;
    if(nw<x) tmp+=n;
    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(nw>x) tmp-=n;
    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
5.0 / 5.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 3 ms 5120 KB Output is correct
6 Correct 74 ms 7928 KB Output is correct
7 Correct 195 ms 14456 KB Output is correct
8 Correct 982 ms 66664 KB Output is correct
9 Correct 1052 ms 66660 KB Output is correct
10 Correct 1037 ms 66660 KB Output is correct
11 Correct 977 ms 67172 KB Output is correct
12 Correct 947 ms 68760 KB Output is correct
13 Correct 958 ms 71848 KB Output is correct
14 Correct 985 ms 71908 KB Output is correct

Subtask #2
14.0 / 14.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 10 ms 5504 KB Output is correct
7 Correct 104 ms 9720 KB Output is correct
8 Correct 6 ms 5248 KB Output is correct
9 Correct 9 ms 5504 KB Output is correct
10 Correct 105 ms 9848 KB Output is correct
11 Correct 103 ms 9592 KB Output is correct
12 Correct 130 ms 9848 KB Output is correct
13 Correct 96 ms 9724 KB Output is correct

Subtask #3
13.0 / 13.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 10 ms 5504 KB Output is correct
7 Correct 104 ms 9720 KB Output is correct
8 Correct 6 ms 5248 KB Output is correct
9 Correct 9 ms 5504 KB Output is correct
10 Correct 105 ms 9848 KB Output is correct
11 Correct 103 ms 9592 KB Output is correct
12 Correct 130 ms 9848 KB Output is correct
13 Correct 96 ms 9724 KB Output is correct
14 Correct 222 ms 15072 KB Output is correct
15 Correct 1960 ms 72860 KB Output is correct
16 Correct 216 ms 15096 KB Output is correct
17 Correct 1945 ms 72972 KB Output is correct
18 Correct 1173 ms 72792 KB Output is correct
19 Correct 1155 ms 72932 KB Output is correct
20 Correct 1768 ms 72932 KB Output is correct

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5120 KB Output is correct
2 Correct 4 ms 5120 KB Output is correct
3 Incorrect 109 ms 8468 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 11.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 5 ms 5120 KB Output is correct
6 Correct 6 ms 5120 KB Output is correct
7 Correct 23 ms 5760 KB Output is correct
8 Incorrect 22 ms 5880 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #6
0 / 15.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 Incorrect 7 ms 5376 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #7
0 / 25.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 3 ms 5120 KB Output is correct
6 Correct 74 ms 7928 KB Output is correct
7 Correct 195 ms 14456 KB Output is correct
8 Correct 982 ms 66664 KB Output is correct
9 Correct 1052 ms 66660 KB Output is correct
10 Correct 1037 ms 66660 KB Output is correct
11 Correct 977 ms 67172 KB Output is correct
12 Correct 947 ms 68760 KB Output is correct
13 Correct 958 ms 71848 KB Output is correct
14 Correct 985 ms 71908 KB Output is correct
15 Correct 4 ms 5120 KB Output is correct
16 Correct 4 ms 5120 KB Output is correct
17 Correct 4 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 10 ms 5504 KB Output is correct
21 Correct 104 ms 9720 KB Output is correct
22 Correct 6 ms 5248 KB Output is correct
23 Correct 9 ms 5504 KB Output is correct
24 Correct 105 ms 9848 KB Output is correct
25 Correct 103 ms 9592 KB Output is correct
26 Correct 130 ms 9848 KB Output is correct
27 Correct 96 ms 9724 KB Output is correct
28 Correct 222 ms 15072 KB Output is correct
29 Correct 1960 ms 72860 KB Output is correct
30 Correct 216 ms 15096 KB Output is correct
31 Correct 1945 ms 72972 KB Output is correct
32 Correct 1173 ms 72792 KB Output is correct
33 Correct 1155 ms 72932 KB Output is correct
34 Correct 1768 ms 72932 KB Output is correct
35 Correct 4 ms 5120 KB Output is correct
36 Correct 4 ms 5120 KB Output is correct
37 Incorrect 109 ms 8468 KB Output isn't correct
38 Halted 0 ms 0 KB -