# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
792123 | mousebeaver | Comparing Plants (IOI20_plants) | C++14 | 1 ms | 340 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;
vector<int> height(0);
void init(int k, vector<int> r)
{
int n = r.size();
height.assign(n, -1); //-1 = not already known
for(int nodes = 0; nodes < n; nodes++)
{
vector<int> candidates(0);
for(int i = 0; i < n; i++)
{
if(height[i] == -1 && r[i] == 0)
{
candidates.push_back(i);
}
}
while(candidates.empty()){ int a = 0;}
int index = 0;
while(index < (int) candidates.size()-1 && candidates[index]+k-1 >= candidates[(index+1)])
{
index++;
}
height[candidates[index]] = n-nodes;
for(int i = 0; i < k; i++)
{
r[(candidates[index]+n-i)%n]--;
}
candidates.clear();
}
//vector<int> test = height;
//int temp = 0;
}
int compare_plants(int x, int y)
{
if(height[x] > height[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... |