# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
601268 | yutabi | Comparing Plants (IOI20_plants) | C++14 | 4051 ms | 8668 KiB |
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;
void init(int k, std::vector<int> r)
{
n=r.size();
ans=vector <int> (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;
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");*/
}
return;
}
int compare_plants(int x, int y)
{
if(ans[x]<ans[y])
{
return 1;
}
return -1;
}
Compilation message (stderr)
# | 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... |