#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define ll long long
ll mod=1000000007;
int inf=1000000007;
ll infl=1000000000000000007;
const int pot=1<<18,N=200007;
int n;
int p[N];
struct T
{
pair<int,int> seg[2*pot+7];
int lzy[2*pot+7];
T()
{
memset(seg,0,sizeof seg);
memset(lzy,0,sizeof lzy);
}
void push(int v)
{
lzy[2*v]+=lzy[v];
lzy[2*v+1]+=lzy[v];
seg[2*v].st+=lzy[v];
seg[2*v+1].st+=lzy[v];
lzy[v]=0;
}
void add(int v,int a,int b,int l,int r,int x)
{
if(a<=l&&b>=r)
{
lzy[v]+=x;
seg[v].st+=x;
return ;
}
if(r<a||l>b) return ;
push(v);
add(2*v,a,b,l,(l+r)/2,x);
add(2*v+1,a,b,(l+r)/2+1,r,x);
seg[v]=min(seg[2*v],seg[2*v+1]);
}
int get(int v,int a,int l,int r)
{
if(v>=pot) return seg[v].st;
push(v);
if(a<=(l+r)/2) return get(2*v,a,l,(l+r)/2);
else return get(2*v+1,a,(l+r)/2+1,r);
}
};
void init(int k,vector<int>r)
{
n=sz(r);
T R,ile;
for(int i=0;i<n;i++) R.seg[i+pot]={r[i],i+1};
for(int i=n+1;i<=pot;i++) R.seg[i+pot-1]={inf,i};
for(int i=1;i<=pot;i++) ile.seg[i+pot-1]={inf,i};
for(int i=pot-1;i>0;i--)
{
R.seg[i]=min(R.seg[2*i],R.seg[2*i+1]);
ile.seg[i]=min(ile.seg[2*i],ile.seg[2*i+1]);
}
int it=0;
while(it<n)
{
while(R.seg[1].st==0)
{
int i=R.seg[1].nd;
R.add(1,i,i,1,pot,inf);
ile.add(1,i,i,1,pot,-ile.get(1,i,1,pot));
if(i+k-1<=n) ile.add(1,i+1,i+k-1,1,pot,1);
else
{
ile.add(1,i+1,n,1,pot,1);
ile.add(1,1,i+k-1-n,1,pot,1);
}
}
int i=ile.seg[1].nd;
// cout<<i<<endl;
if(ile.seg[1].st!=0) return 2137;
ile.add(1,i,i,1,pot,inf);
p[i]=n-it++;
if(i+k-1<=n) ile.add(1,i+1,i+k-1,1,pot,-1);
else
{
ile.add(1,i+1,n,1,pot,-1);
ile.add(1,1,i+k-1-n,1,pot,-1);
}
if(i-k+1>0) R.add(1,i-k+1,i-1,1,pot,-1);
else
{
R.add(1,i-k+1+n,n,1,pot,-1);
R.add(1,1,i-1,1,pot,-1);
}
}
for(int i=1;i<=n;i++) cout<<p[i]<<" ";
cout<<endl;
}
int compare_plants(int x,int y)
{
if(p[x+1]>p[y+1]) return 1;
else return -1;
}
int main()
{
init(3, {0, 1, 1, 2});
cout<<compare_plants(0, 2)<<endl;
cout<<compare_plants(1, 2)<<endl;
return 0;
}
Compilation message
plants.cpp: In constructor 'T::T()':
plants.cpp:27:32: warning: 'void* memset(void*, int, size_t)' clearing an object of type 'struct std::pair<int, int>' with no trivial copy-assignment; use assignment instead [-Wclass-memaccess]
27 | memset(seg,0,sizeof seg);
| ^
In file included from /usr/include/c++/10/bits/stl_algobase.h:64,
from /usr/include/c++/10/bits/char_traits.h:39,
from /usr/include/c++/10/ios:40,
from /usr/include/c++/10/istream:38,
from /usr/include/c++/10/sstream:38,
from /usr/include/c++/10/complex:45,
from /usr/include/c++/10/ccomplex:39,
from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:54,
from plants.cpp:1:
/usr/include/c++/10/bits/stl_pair.h:211:12: note: 'struct std::pair<int, int>' declared here
211 | struct pair
| ^~~~
plants.cpp: In function 'void init(int, std::vector<int>)':
plants.cpp:92:37: error: return-statement with a value, in function returning 'void' [-fpermissive]
92 | if(ile.seg[1].st!=0) return 2137;
| ^~~~
