oj.uz

Submission #305418

# Submission time Handle Problem Language Result Execution time Memory
305418 2020-09-23T03:33:15 Z baluteshih Comparing Plants (IOI20_plants) C++14
44 / 100
 1133 ms 15080 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

int seg1[800005],seg2[800005],lazy1[800005],lazy2[800005];
int layer[400005],tag[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);
}

const int INF=1e9;
int arr[200005],K,n;

void init(int k, vector<int> r)
{
    n=SZ(r),K=k;
	build(0,n-1,1,r,seg1),build(0,n-1,1,vector<int>(n,INF),seg2);
    for(int i=0,ly=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);
    }
    layer[n]=layer[0];
    deque<int> dq(1,0);
    for(int i=1;i<n;++i)
    {
        if(dq.front()==i-k)
            dq.pop_front();
        if(dq.empty())
            break;
        if(layer[dq.front()]<layer[i])
        {
            tag[i]=1;
            while(!dq.empty()&&layer[dq.back()]>=layer[i])
                dq.pop_back();
            dq.pb(i);
        }
    }
    dq.clear(),dq.pb(n);
    for(int i=n-1;i>0;--i)
    {
        if(dq.front()==i+k)
            dq.pop_front();
        if(dq.empty())
            break;
        if(layer[dq.front()]<layer[i])
        {
            tag[i]=1;
            while(!dq.empty()&&layer[dq.back()]>=layer[i])
                dq.pop_back();
            dq.pb(i); 
        }
    }
    dq.clear(),dq.pb(n);
    for(int i=1;i<n;++i)
    {
        if(dq.front()==i-k)
            dq.pop_front();
        if(dq.empty())
            break;
        if(layer[dq.front()]>layer[i])
        {
            tag[i]=-1;
            while(!dq.empty()&&layer[dq.back()]<=layer[i])
                dq.pop_back();
            dq.pb(i);
        }
    }
    dq.clear(),dq.pb(n);
    for(int i=n-1;i>0;--i)
    {
        if(dq.front()==i+k)
            dq.pop_front();
        if(dq.empty())
            break;
        if(layer[dq.front()]>layer[i])
        {
            tag[i]=-1;
            while(!dq.empty()&&layer[dq.back()]<=layer[i])
                dq.pop_back();
            dq.pb(i); 
        }
    }
    /*for(int i=0;i<n;++i)
        cout << layer[i] << " \n"[i+1==n];
    for(int i=0;i<n;++i)
        cout << "[" << L[i] << "," << R[i] << "]" << " \n"[i+1==n];*/
}

int compare_plants(int x, int y)
{
    if(layer[x]==layer[y]) return 0;
    if(x==0)
        return tag[y];
    else
        return layer[x]<layer[y]?1:-1;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Incorrect 0 ms 384 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory 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 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 81 ms 3580 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 87 ms 3704 KB Output is correct
11 Correct 77 ms 3448 KB Output is correct
12 Correct 76 ms 3708 KB Output is correct
13 Correct 83 ms 3576 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory 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 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 81 ms 3580 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 87 ms 3704 KB Output is correct
11 Correct 77 ms 3448 KB Output is correct
12 Correct 76 ms 3708 KB Output is correct
13 Correct 83 ms 3576 KB Output is correct
14 Correct 142 ms 4600 KB Output is correct
15 Correct 1133 ms 14180 KB Output is correct
16 Correct 146 ms 4572 KB Output is correct
17 Correct 1122 ms 14088 KB Output is correct
18 Correct 791 ms 14568 KB Output is correct
19 Correct 769 ms 15080 KB Output is correct
20 Correct 982 ms 14220 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 69 ms 3320 KB Output is correct
4 Correct 557 ms 13964 KB Output is correct
5 Correct 665 ms 14184 KB Output is correct
6 Correct 911 ms 14052 KB Output is correct
7 Correct 1048 ms 14052 KB Output is correct
8 Correct 1106 ms 14184 KB Output is correct
9 Correct 580 ms 13544 KB Output is correct
10 Correct 602 ms 14180 KB Output is correct
11 Correct 502 ms 13160 KB Output is correct
12 Correct 592 ms 14824 KB Output is correct
13 Correct 749 ms 14336 KB Output is correct

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Incorrect 0 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Incorrect 1 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Incorrect 0 ms 384 KB Output isn't correct
5 Halted 0 ms 0 KB -