oj.uz

답안 #305668

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
305668 2020-09-23T18:56:56 Z baluteshih 식물 비교 (IOI20_plants) C++14
100 / 100
 1763 ms 148584 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;
    ll dis;
    node operator+(const node &a)const{
        return node{a.pa,dis+a.dis};
    }
}Rtr[200005][20],Ltr[200005][20];
pii seg3[1600005];
int seg1[800005],seg2[800005],lazy1[800005],lazy2[800005];
int layer[400005],pl[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 build2(int l,int r,int rt)
{
    seg3[rt]=pii(INF,l);
    if(l==r)
        return;
    int mid=(l+r)>>1;
    build2(l,mid,rt<<1),build2(mid+1,r,rt<<1|1);
}

void modify2(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)
        modify2(x,l,mid,rt<<1,val);
    else
        modify2(x,mid+1,r,rt<<1|1,val);
    seg3[rt]=min(seg3[rt<<1],seg3[rt<<1|1]);
}

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

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

void init(int k, vector<int> r)
{
    n=SZ(r),K=k,L=__lg(n);
	build(0,n-1,1,r,seg1),build(0,n-1,1,vector<int>(n,INF),seg2);
    for(int i=0;i<n;++i)
    {
        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);
            }
        }
        int u=query(0,n-1,1,seg2,lazy2);
        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]=i,pl[i]=u;
    }
    for(int i=0;i<n;++i)
        layer[i+n]=layer[i];
    build2(0,2*n-1,1);
    for(int i=n-1;i>=0;--i)
    {
        int u=pl[i];
        pii tmp=query2(u+n-k+1,u+n,0,2*n-1,1);
        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);
        if(tmp.X==INF)
            Rtr[u][0]=node{u,0};
        else
            Rtr[u][0]=node{tmp.Y%n,tmp.Y-u};
        modify2(u,0,2*n-1,1,layer[u]),modify2(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;
    ll 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;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 81 ms 3192 KB Output is correct
7 Correct 221 ms 18140 KB Output is correct
8 Correct 870 ms 147428 KB Output is correct
9 Correct 890 ms 147304 KB Output is correct
10 Correct 906 ms 147304 KB Output is correct
11 Correct 907 ms 147308 KB Output is correct
12 Correct 918 ms 147304 KB Output is correct
13 Correct 991 ms 147280 KB Output is correct
14 Correct 1038 ms 147304 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 6 ms 1152 KB Output is correct
7 Correct 99 ms 7032 KB Output is correct
8 Correct 3 ms 512 KB Output is correct
9 Correct 6 ms 1152 KB Output is correct
10 Correct 101 ms 7032 KB Output is correct
11 Correct 104 ms 6904 KB Output is correct
12 Correct 98 ms 7160 KB Output is correct
13 Correct 99 ms 7032 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 6 ms 1152 KB Output is correct
7 Correct 99 ms 7032 KB Output is correct
8 Correct 3 ms 512 KB Output is correct
9 Correct 6 ms 1152 KB Output is correct
10 Correct 101 ms 7032 KB Output is correct
11 Correct 104 ms 6904 KB Output is correct
12 Correct 98 ms 7160 KB Output is correct
13 Correct 99 ms 7032 KB Output is correct
14 Correct 200 ms 18252 KB Output is correct
15 Correct 1724 ms 148404 KB Output is correct
16 Correct 197 ms 18268 KB Output is correct
17 Correct 1763 ms 148584 KB Output is correct
18 Correct 1151 ms 148456 KB Output is correct
19 Correct 1128 ms 148456 KB Output is correct
20 Correct 1579 ms 148272 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 111 ms 4728 KB Output is correct
4 Correct 1114 ms 148136 KB Output is correct
5 Correct 1216 ms 148288 KB Output is correct
6 Correct 1498 ms 148456 KB Output is correct
7 Correct 1661 ms 148456 KB Output is correct
8 Correct 1724 ms 148452 KB Output is correct
9 Correct 1092 ms 148580 KB Output is correct
10 Correct 1106 ms 148328 KB Output is correct
11 Correct 991 ms 147432 KB Output is correct
12 Correct 1169 ms 148328 KB Output is correct
13 Correct 1218 ms 148456 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 20 ms 1280 KB Output is correct
8 Correct 18 ms 1280 KB Output is correct
9 Correct 21 ms 1280 KB Output is correct
10 Correct 19 ms 1280 KB Output is correct
11 Correct 20 ms 1280 KB Output is correct
12 Correct 21 ms 1280 KB Output is correct
13 Correct 17 ms 1280 KB Output is correct

Subtask #6
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 4 ms 1152 KB Output is correct
6 Correct 1064 ms 148324 KB Output is correct
7 Correct 1370 ms 148308 KB Output is correct
8 Correct 1559 ms 148456 KB Output is correct
9 Correct 1720 ms 148324 KB Output is correct
10 Correct 971 ms 148372 KB Output is correct
11 Correct 1359 ms 148456 KB Output is correct
12 Correct 968 ms 148200 KB Output is correct
13 Correct 1109 ms 148328 KB Output is correct
14 Correct 1349 ms 148380 KB Output is correct
15 Correct 1620 ms 148584 KB Output is correct
16 Correct 959 ms 148292 KB Output is correct
17 Correct 1075 ms 148328 KB Output is correct

Subtask #7
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 81 ms 3192 KB Output is correct
7 Correct 221 ms 18140 KB Output is correct
8 Correct 870 ms 147428 KB Output is correct
9 Correct 890 ms 147304 KB Output is correct
10 Correct 906 ms 147304 KB Output is correct
11 Correct 907 ms 147308 KB Output is correct
12 Correct 918 ms 147304 KB Output is correct
13 Correct 991 ms 147280 KB Output is correct
14 Correct 1038 ms 147304 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 512 KB Output is correct
20 Correct 6 ms 1152 KB Output is correct
21 Correct 99 ms 7032 KB Output is correct
22 Correct 3 ms 512 KB Output is correct
23 Correct 6 ms 1152 KB Output is correct
24 Correct 101 ms 7032 KB Output is correct
25 Correct 104 ms 6904 KB Output is correct
26 Correct 98 ms 7160 KB Output is correct
27 Correct 99 ms 7032 KB Output is correct
28 Correct 200 ms 18252 KB Output is correct
29 Correct 1724 ms 148404 KB Output is correct
30 Correct 197 ms 18268 KB Output is correct
31 Correct 1763 ms 148584 KB Output is correct
32 Correct 1151 ms 148456 KB Output is correct
33 Correct 1128 ms 148456 KB Output is correct
34 Correct 1579 ms 148272 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 0 ms 384 KB Output is correct
37 Correct 111 ms 4728 KB Output is correct
38 Correct 1114 ms 148136 KB Output is correct
39 Correct 1216 ms 148288 KB Output is correct
40 Correct 1498 ms 148456 KB Output is correct
41 Correct 1661 ms 148456 KB Output is correct
42 Correct 1724 ms 148452 KB Output is correct
43 Correct 1092 ms 148580 KB Output is correct
44 Correct 1106 ms 148328 KB Output is correct
45 Correct 991 ms 147432 KB Output is correct
46 Correct 1169 ms 148328 KB Output is correct
47 Correct 1218 ms 148456 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 0 ms 384 KB Output is correct
50 Correct 0 ms 384 KB Output is correct
51 Correct 1 ms 384 KB Output is correct
52 Correct 1 ms 384 KB Output is correct
53 Correct 3 ms 512 KB Output is correct
54 Correct 20 ms 1280 KB Output is correct
55 Correct 18 ms 1280 KB Output is correct
56 Correct 21 ms 1280 KB Output is correct
57 Correct 19 ms 1280 KB Output is correct
58 Correct 20 ms 1280 KB Output is correct
59 Correct 21 ms 1280 KB Output is correct
60 Correct 17 ms 1280 KB Output is correct
61 Correct 97 ms 4532 KB Output is correct
62 Correct 197 ms 18140 KB Output is correct
63 Correct 969 ms 148072 KB Output is correct
64 Correct 1085 ms 148324 KB Output is correct
65 Correct 1479 ms 148324 KB Output is correct
66 Correct 1667 ms 148456 KB Output is correct
67 Correct 1762 ms 148324 KB Output is correct
68 Correct 1043 ms 148196 KB Output is correct
69 Correct 1460 ms 148404 KB Output is correct
70 Correct 1098 ms 148072 KB Output is correct
71 Correct 1237 ms 148456 KB Output is correct
72 Correct 1519 ms 148452 KB Output is correct
73 Correct 1675 ms 148328 KB Output is correct
74 Correct 962 ms 148200 KB Output is correct
75 Correct 1096 ms 148304 KB Output is correct