This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "plants.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
int n;
vector <int> ans;
vector <vector <int> > graph;
bool table[300][300];
vector <int> L;
vector <int> R;
vector <int> dir;
int K;
void init(int k, std::vector<int> r)
{
K=k;
n=r.size();
ans=vector <int> (n);
if(n<=1)
{
graph.resize(n);
for(int i=0;i<n;i++)
{
int loc;
int last=-1;
for(int j=n-k;j<n;j++)
{
if(r[j]==0)
{
last=j;
}
}
for(int j=0;j<n;j++)
{
if(r[j]==0)
{
if(last==-1 || (last<j && last+k<=j) || (last>j && j+n-k>=last) || j==last)
{
loc=j;
break;
}
last=j;
}
}
r[loc]=n*4;
for(int j=(loc-k+1+n)%n;j!=loc;j=(j+1)%n)
{
r[j]--;
if(r[j]<=n)
{
graph[j].pb(loc);
}
}
for(int j=(loc+k-1)%n;j!=loc;j=(j-1+n)%n)
{
if(r[j]<=n)
{
graph[j].pb(loc);
}
}
/*for(int j=0;j<n;j++)
{
printf("%d ",r[j]);
}
printf("\n");*/
}
/*for(int i=0;i<n;i++)
{
printf("%d: ",i);
for(int j=0;j<graph[i].size();j++)
{
printf("%d ",graph[i][j]);
}
printf("\n");
}*/
for(int j=0;j<n;j++)
{
vector <bool> v(n,0);
stack <int> st;
st.push(j);
while(st.size())
{
int node=st.top();
st.pop();
v[node]=1;
for(int k=0;k<graph[node].size();k++)
{
if(v[graph[node][k]]==0)
{
st.push(graph[node][k]);
v[graph[node][k]]=1;
}
}
}
for(int k=0;k<n;k++)
{
if(v[k])
{
table[j][k]=1;
}
}
}
}
else if(k!=2)
{
for(int i=0;i<n;i++)
{
int loc;
int last=-1;
for(int j=n-k;j<n;j++)
{
if(r[j]==0)
{
last=j;
}
}
for(int j=0;j<n;j++)
{
if(r[j]==0)
{
if(last==-1 || (last<j && last+k<=j) || (last>j && j+n-k>=last) || j==last)
{
loc=j;
break;
}
last=j;
}
}
r[loc]=n*4;
ans[loc]=i;
for(int j=(loc-k+1+n)%n;j!=loc;j=(j+1)%n)
{
r[j]--;
}
/*for(int j=0;j<n;j++)
{
printf("%d ",r[j]);
}
printf("\n");*/
}
}
else
{
L=R=dir=vector <int> (n);
for(int i=0;i<n;i++)
{
L[i]=i;
R[i]=(i+1)%n;
if(r[i]==0)
{
dir[i]=1;
}
else
{
dir[i]=0;
}
}
for(int i=0;i<n;i++)
{
if(r[i]==r[(i+1)%n])
{
L[(i+1)%n]=L[i];
}
}
for(int i=0;i<n;i++)
{
if(r[i]==r[(i+1)%n])
{
L[(i+1)%n]=L[i];
}
}
for(int i=n-1;i>=0;i--)
{
if(r[i]==r[(i-1+n)%n])
{
R[(i-1+n)%n]=R[i];
}
}
for(int i=n-1;i>=0;i--)
{
if(r[i]==r[(i-1+n)%n])
{
R[(i-1+n)%n]=R[i];
}
}
/*for(int i=0;i<n;i++)
{
printf("%d ",L[i]);
}
printf("\n");
for(int j=0;j<n;j++)
{
printf("%d ",R[j]);
}
printf("\n");*/
}
return;
}
int compare_plants(int x, int y)
{
if(n<=1)
{
if(table[x][y])
{
return -1;
}
if(table[y][x])
{
return 1;
}
return 0;
}
if(K!=2)
{
if(ans[x]<ans[y])
{
return 1;
}
return -1;
}
if(x<y && (y<=R[x] || R[x]<=x))
{
if(dir[x])
{
return 1;
}
return -1;
}
if(x<y && L[(x-1+n)%n]>x && L[(x-1+n)%n]<=y)
{
if(dir[(x-1+n)%n])
{
return -1;
}
return 1;
}
if(x>y)
{
swap(x,y);
}
if(x<y && (y<=R[x] || R[x]<=x))
{
if(dir[x])
{
return -1;
}
return 1;
}
if(x<y && L[(x-1+n)%n]>x && L[(x-1+n)%n]<=y)
{
if(dir[(x-1+n)%n])
{
return 1;
}
return -1;
}
return 0;
}
Compilation message (stderr)
plants.cpp: In function 'void init(int, std::vector<int>)':
plants.cpp:115:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
115 | for(int k=0;k<graph[node].size();k++)
| ~^~~~~~~~~~~~~~~~~~~
plants.cpp:165:9: warning: 'loc' may be used uninitialized in this function [-Wmaybe-uninitialized]
165 | r[loc]=n*4;
| ^
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |