oj.uz

Submission #641643

# Submission time Handle Problem Language Result Execution time Memory
641643 2022-09-17T10:44:18 Z lis05st Comparing Plants (IOI20_plants) C++17
49 / 100
 1181 ms 74460 KB 
#ifdef LIS05ST
    #define _GLIBCXX_DEBUG
    #define _GLIBCXX_DEBUG_PEDANTIC
#endif
#pragma GCC optimize("O3")
#pragma GCC target("avx2,popcnt,lzcnt")
#include"plants.h"
#include"bits/stdc++.h"
using namespace std;

typedef long long ll;
typedef long double ld;

const int NMAX=2e6;
int pref[NMAX+5];
int n,k;

int get(int l,int r){
    return pref[r]-pref[l-1];
}
bool one(int l,int r){
    return get(l,r)==r-l+1;
}
bool zero(int l,int r){
    return get(l,r)==0;
}
vector<int>h;
int id(int x){
    return (x%n+n)%n;
}


struct Node{
    int min;
    int pos;
    ll padd;
};
Node tree[4*NMAX+5];

Node merge(Node a,Node b){
    Node res;
    res.min=min(a.min,b.min);
    res.pos=-1;
    if(a.min==res.min){
        res.pos=max(res.pos,a.pos);
    }
    if(b.min==res.min){
        res.pos=max(res.pos,b.pos);
    }
    res.padd=0;
    return res;
}

vector<int>vec;
void build(int v,int l,int r){
    if(l==r){
        tree[v].min=vec[l];
        tree[v].pos=l;
        tree[v].padd=0;
        return;
    }
    int m=(l+r)/2;
    build(2*v,l,m);
    build(2*v+1,m+1,r);
    tree[v]=merge(tree[2*v],tree[2*v+1]);
}

void pushAdd(int v,int val){
    tree[v].min+=val;
    tree[v].padd+=val;
}
void push(int v,int l,int r){
    pushAdd(2*v,tree[v].padd);
    pushAdd(2*v+1,tree[v].padd);
    tree[v].padd=0;
}

pair<int,int> get(int v,int l,int r,int l0,int r0,bool p=1){
    //if(p)cout<<l<<":"<<r<<" "<<l0<<":"<<r0<<"\n";
    //if(p)cout<<tree[2*v].min<<" "<<tree[2*v].pos<<"\n";
    push(v,l,r);
    if(r0<l||r<l0||tree[v].min!=0)return {1e9,1e9};
    if(l0<=l&&r<=r0&&l==r)return {tree[v].min,tree[v].pos};
    int m=(l+r)/2;
    if(tree[2*v].min==0&&tree[2*v].pos>=l0)return get(2*v,l,m,l0,r0,p);
    return get(2*v+1,m+1,r,l0,r0,p);
}

void add(int v,int l,int r,int l0,int r0,int val){
    push(v,l,r);
    if(r0<l||r<l0)return;
    if(l0<=l&&r<=r0){
        pushAdd(v,val);
        return;
    }
    int m=(l+r)/2;
    add(2*v,l,m,l0,r0,val);
    add(2*v+1,m+1,r,l0,r0,val);
    tree[v]=merge(tree[2*v],tree[2*v+1]);
}

void add(int l,int r,int val){
    l-=3*n;r-=3*n;
    for(auto e:vector<int>{0,1,2,3,4,5,6,7,8}){
        if(0<=r&&r<=3*n-1){
            int L=min(3*n-1,max(l,0));
            int R=min(3*n-1,max(r,0));
            add(1,0,3*n-1,L,R,val);
        }
        else if(0<=l&&l<=3*n-1){
            int L=min(3*n-1,max(l,0));
            int R=min(3*n-1,max(r,0));
            add(1,0,3*n-1,L,R,val);
        }
        l+=n;r+=n;
    }
}
int step;
void extract(int pos){
    while(true){
        auto [a,b]=get(1,0,3*n-1,pos-k+1,pos-1);
        if(a==0)extract(b);
        else break;
    }

    h[pos%n]=step--;
    add(pos-k+1,pos-1,-1);
    add(pos,pos,1e9);
}

int dist(int u,int v){
    return min({abs(u-v),abs(u+n-v),abs(v+n-u)});
}
bool d1[300+5][300+5];
void init(int K, std::vector<int> rr){
    n=rr.size();h.resize(n);
    k=K;
    for(int i=0;i<n;i++)pref[i+1]=pref[i]+rr[i];

    for(int e=0;e<3;e++)for(int i=0;i<n;i++){
        vec.push_back(rr[i]);
    }
    //for(auto e:vec)cout<<e<<" ";cout<<"\n";
    build(1,0,3*n-1);
    int L=0+n+n;int R=n-1+n+n;
    step=n;
    while(step>=1){

        auto[val,pos]=get(1,0,3*n-1,L,R);
        extract(pos);
    }
    if(n<=300){
        for(int i=0;i<=n;i++)for(int ii=0;ii<=n;ii++)d1[i][ii]=0;
        for(int i=0;i<n;i++){
            for(int ii=0;ii<n;ii++){
                if(i==ii)continue;
                if(dist(i,ii)<k){
                    if(h[i]>h[ii])d1[i][ii]=1;
                    if(h[i]<h[ii])d1[ii][i]=1;
                }
            }
        }
    
        for(int i=0;i<n;i++)
        for(int ii=0;ii<n;ii++)
        for(int iii=0;iii<n;iii++)
        {
            d1[i][ii]|=d1[i][iii]&d1[iii][ii];
        }
    }
    //for(auto e:h)cout<<e<<" ";cout<<endl;
};
int compare_plants(int x, int y){
    if(k==2){
        x++,y++;
        if(zero(x,y-1))return 1;
        if(one(1,x-1)&&one(y,n))return 1;
        if(one(x,y-1))return -1;
        if(zero(1,x-1)&&zero(y,n))return -1;
        return 0;
    }
    if(n<=300){
        if(d1[x][y])return 1;
        if(d1[y][x])return -1;
        return 0;
    }
    if(h[x]>h[y])return 1;
    if(h[x]<h[y])return -1;
    return 0;
}

#define MULTITESTS false
void solve(int testCase){

}

           
//   x     y


void precalc(){

}
/*
signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    precalc();
    int t=1;
    if(MULTITESTS)cin>>t;
    for(int i=1;i<=t;i++){
        auto t1=clock();
        solve(i);
        auto t2=clock();
        float delta=t2-t1;
        delta/=CLOCKS_PER_SEC;
        #ifdef LIS05ST
        cout<<"("<<i<<")------------"<<fixed<<setprecision(2)<<delta<<"s\n";
        #endif
    }
}*/

Compilation message

plants.cpp: In function 'void add(int, int, int)':
plants.cpp:104:14: warning: unused variable 'e' [-Wunused-variable]
  104 |     for(auto e:vector<int>{0,1,2,3,4,5,6,7,8}){
      |              ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 50 ms 3016 KB Output is correct
7 Correct 107 ms 7820 KB Output is correct
8 Correct 503 ms 73908 KB Output is correct
9 Correct 522 ms 74164 KB Output is correct
10 Correct 563 ms 74020 KB Output is correct
11 Correct 508 ms 73932 KB Output is correct
12 Correct 538 ms 74028 KB Output is correct
13 Correct 529 ms 73840 KB Output is correct
14 Correct 532 ms 73872 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 4 ms 596 KB Output is correct
7 Correct 61 ms 4292 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 4 ms 596 KB Output is correct
10 Correct 62 ms 4344 KB Output is correct
11 Correct 67 ms 4216 KB Output is correct
12 Correct 55 ms 4436 KB Output is correct
13 Correct 61 ms 4296 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 4 ms 596 KB Output is correct
7 Correct 61 ms 4292 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 4 ms 596 KB Output is correct
10 Correct 62 ms 4344 KB Output is correct
11 Correct 67 ms 4216 KB Output is correct
12 Correct 55 ms 4436 KB Output is correct
13 Correct 61 ms 4296 KB Output is correct
14 Correct 116 ms 7836 KB Output is correct
15 Correct 1173 ms 74020 KB Output is correct
16 Correct 118 ms 7928 KB Output is correct
17 Correct 1181 ms 73964 KB Output is correct
18 Correct 667 ms 73972 KB Output is correct
19 Correct 691 ms 73976 KB Output is correct
20 Correct 1002 ms 73944 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 49 ms 3712 KB Output is correct
4 Correct 601 ms 74460 KB Output is correct
5 Correct 709 ms 74224 KB Output is correct
6 Correct 969 ms 74040 KB Output is correct
7 Correct 1072 ms 73948 KB Output is correct
8 Correct 1150 ms 74188 KB Output is correct
9 Correct 624 ms 74096 KB Output is correct
10 Correct 627 ms 74016 KB Output is correct
11 Correct 510 ms 73960 KB Output is correct
12 Correct 566 ms 73828 KB Output is correct
13 Correct 686 ms 73960 KB Output is correct

Subtask #5
0 / 11.0

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

Subtask #6
0 / 15.0

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

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 50 ms 3016 KB Output is correct
7 Correct 107 ms 7820 KB Output is correct
8 Correct 503 ms 73908 KB Output is correct
9 Correct 522 ms 74164 KB Output is correct
10 Correct 563 ms 74020 KB Output is correct
11 Correct 508 ms 73932 KB Output is correct
12 Correct 538 ms 74028 KB Output is correct
13 Correct 529 ms 73840 KB Output is correct
14 Correct 532 ms 73872 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 4 ms 596 KB Output is correct
21 Correct 61 ms 4292 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 4 ms 596 KB Output is correct
24 Correct 62 ms 4344 KB Output is correct
25 Correct 67 ms 4216 KB Output is correct
26 Correct 55 ms 4436 KB Output is correct
27 Correct 61 ms 4296 KB Output is correct
28 Correct 116 ms 7836 KB Output is correct
29 Correct 1173 ms 74020 KB Output is correct
30 Correct 118 ms 7928 KB Output is correct
31 Correct 1181 ms 73964 KB Output is correct
32 Correct 667 ms 73972 KB Output is correct
33 Correct 691 ms 73976 KB Output is correct
34 Correct 1002 ms 73944 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 49 ms 3712 KB Output is correct
38 Correct 601 ms 74460 KB Output is correct
39 Correct 709 ms 74224 KB Output is correct
40 Correct 969 ms 74040 KB Output is correct
41 Correct 1072 ms 73948 KB Output is correct
42 Correct 1150 ms 74188 KB Output is correct
43 Correct 624 ms 74096 KB Output is correct
44 Correct 627 ms 74016 KB Output is correct
45 Correct 510 ms 73960 KB Output is correct
46 Correct 566 ms 73828 KB Output is correct
47 Correct 686 ms 73960 KB Output is correct
48 Correct 1 ms 224 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Incorrect 3 ms 340 KB Output isn't correct
54 Halted 0 ms 0 KB -